java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:13:00,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:13:00,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:13:00,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:13:00,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:13:00,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:13:00,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:13:00,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:13:00,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:13:00,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:13:00,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:13:00,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:13:00,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:13:00,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:13:00,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:13:00,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:13:00,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:13:00,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:13:00,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:13:00,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:13:00,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:13:00,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:13:00,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:13:00,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:13:00,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:13:00,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:13:00,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:13:00,635 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:13:00,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:13:00,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:13:00,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:13:00,636 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 14:13:00,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:13:00,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:13:00,646 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:13:00,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:13:00,647 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:13:00,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:13:00,647 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:13:00,647 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:13:00,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:13:00,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:13:00,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:13:00,648 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:13:00,648 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:13:00,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:13:00,648 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:13:00,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:13:00,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:13:00,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:13:00,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:13:00,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:13:00,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:13:00,650 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 14:13:00,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 14:13:00,650 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 14:13:00,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:13:00,688 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:13:00,691 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:13:00,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:13:00,693 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:13:00,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-02-04 14:13:00,858 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:13:00,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:13:00,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:13:00,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:13:00,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:13:00,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:13:00" (1/1) ... [2018-02-04 14:13:00,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d2dd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:00, skipping insertion in model container [2018-02-04 14:13:00,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:13:00" (1/1) ... [2018-02-04 14:13:00,882 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:13:00,919 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:13:01,016 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:13:01,036 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:13:01,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01 WrapperNode [2018-02-04 14:13:01,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:13:01,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:13:01,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:13:01,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:13:01,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... [2018-02-04 14:13:01,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... [2018-02-04 14:13:01,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... [2018-02-04 14:13:01,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... [2018-02-04 14:13:01,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... [2018-02-04 14:13:01,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... [2018-02-04 14:13:01,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... [2018-02-04 14:13:01,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:13:01,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:13:01,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:13:01,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:13:01,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 14:13:01,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-04 14:13:01,120 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-04 14:13:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-04 14:13:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-02-04 14:13:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-04 14:13:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 14:13:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure inspect [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-02-04 14:13:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-04 14:13:01,123 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:13:01,123 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:13:01,123 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:13:01,588 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:13:01,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:13:01 BoogieIcfgContainer [2018-02-04 14:13:01,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:13:01,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:13:01,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:13:01,592 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:13:01,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:13:00" (1/3) ... [2018-02-04 14:13:01,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296eee1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:13:01, skipping insertion in model container [2018-02-04 14:13:01,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:13:01" (2/3) ... [2018-02-04 14:13:01,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296eee1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:13:01, skipping insertion in model container [2018-02-04 14:13:01,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:13:01" (3/3) ... [2018-02-04 14:13:01,596 INFO L107 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-02-04 14:13:01,611 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:13:01,618 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-02-04 14:13:01,657 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:13:01,657 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:13:01,658 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 14:13:01,658 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 14:13:01,658 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:13:01,658 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:13:01,658 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:13:01,658 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:13:01,659 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:13:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states. [2018-02-04 14:13:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 14:13:01,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:01,695 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 14:13:01,696 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:01,699 INFO L82 PathProgramCache]: Analyzing trace with hash 19743518, now seen corresponding path program 1 times [2018-02-04 14:13:01,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:01,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:01,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:01,733 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:01,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:01,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:01,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:01,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:13:01,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:13:01,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:13:01,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:13:01,910 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 3 states. [2018-02-04 14:13:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:02,095 INFO L93 Difference]: Finished difference Result 263 states and 285 transitions. [2018-02-04 14:13:02,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:13:02,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 14:13:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:02,102 INFO L225 Difference]: With dead ends: 263 [2018-02-04 14:13:02,102 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 14:13:02,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:13:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 14:13:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-02-04 14:13:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 14:13:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-02-04 14:13:02,137 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 4 [2018-02-04 14:13:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:02,137 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-02-04 14:13:02,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:13:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-02-04 14:13:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 14:13:02,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:02,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 14:13:02,138 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 19743519, now seen corresponding path program 1 times [2018-02-04 14:13:02,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:02,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:02,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:02,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:02,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:02,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:02,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:13:02,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:13:02,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:13:02,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:13:02,185 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 3 states. [2018-02-04 14:13:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:02,307 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-02-04 14:13:02,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:13:02,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 14:13:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:02,309 INFO L225 Difference]: With dead ends: 245 [2018-02-04 14:13:02,310 INFO L226 Difference]: Without dead ends: 245 [2018-02-04 14:13:02,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:13:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-04 14:13:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-02-04 14:13:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 14:13:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 250 transitions. [2018-02-04 14:13:02,323 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 250 transitions. Word has length 4 [2018-02-04 14:13:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:02,323 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 250 transitions. [2018-02-04 14:13:02,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:13:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 250 transitions. [2018-02-04 14:13:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 14:13:02,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:02,324 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:13:02,324 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash -935456334, now seen corresponding path program 1 times [2018-02-04 14:13:02,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:02,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:02,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:02,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:02,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:02,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:02,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:13:02,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:13:02,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:13:02,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:13:02,387 INFO L87 Difference]: Start difference. First operand 241 states and 250 transitions. Second operand 4 states. [2018-02-04 14:13:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:02,510 INFO L93 Difference]: Finished difference Result 238 states and 247 transitions. [2018-02-04 14:13:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:13:02,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 14:13:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:02,511 INFO L225 Difference]: With dead ends: 238 [2018-02-04 14:13:02,511 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 14:13:02,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:13:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 14:13:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 14:13:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 14:13:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2018-02-04 14:13:02,518 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 16 [2018-02-04 14:13:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:02,518 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2018-02-04 14:13:02,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:13:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2018-02-04 14:13:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 14:13:02,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:02,519 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:13:02,519 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash -935456333, now seen corresponding path program 1 times [2018-02-04 14:13:02,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:02,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:02,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,520 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:02,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:02,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:02,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:02,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:13:02,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:13:02,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:13:02,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:13:02,595 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand 4 states. [2018-02-04 14:13:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:02,757 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2018-02-04 14:13:02,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:13:02,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 14:13:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:02,759 INFO L225 Difference]: With dead ends: 235 [2018-02-04 14:13:02,759 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 14:13:02,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:13:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 14:13:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-02-04 14:13:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 14:13:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2018-02-04 14:13:02,766 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 16 [2018-02-04 14:13:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:02,766 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2018-02-04 14:13:02,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:13:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2018-02-04 14:13:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:13:02,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:02,767 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:13:02,767 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730920, now seen corresponding path program 1 times [2018-02-04 14:13:02,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:02,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:02,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:02,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:02,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:02,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:02,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:13:02,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:13:02,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:13:02,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:13:02,840 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 7 states. [2018-02-04 14:13:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:03,184 INFO L93 Difference]: Finished difference Result 243 states and 251 transitions. [2018-02-04 14:13:03,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:13:03,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 14:13:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:03,186 INFO L225 Difference]: With dead ends: 243 [2018-02-04 14:13:03,186 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 14:13:03,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:13:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 14:13:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-02-04 14:13:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 14:13:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-02-04 14:13:03,194 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 19 [2018-02-04 14:13:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:03,194 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-02-04 14:13:03,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:13:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-02-04 14:13:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:13:03,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:03,195 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:13:03,195 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730921, now seen corresponding path program 1 times [2018-02-04 14:13:03,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:03,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:03,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:03,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:03,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:03,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:03,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:03,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:13:03,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:13:03,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:13:03,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:13:03,313 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 9 states. [2018-02-04 14:13:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:03,604 INFO L93 Difference]: Finished difference Result 238 states and 246 transitions. [2018-02-04 14:13:03,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:13:03,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 14:13:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:03,605 INFO L225 Difference]: With dead ends: 238 [2018-02-04 14:13:03,605 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 14:13:03,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:13:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 14:13:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 14:13:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 14:13:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 246 transitions. [2018-02-04 14:13:03,611 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 246 transitions. Word has length 19 [2018-02-04 14:13:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:03,612 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 246 transitions. [2018-02-04 14:13:03,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:13:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 246 transitions. [2018-02-04 14:13:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:13:03,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:03,612 INFO L351 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] [2018-02-04 14:13:03,612 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173164, now seen corresponding path program 1 times [2018-02-04 14:13:03,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:03,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:03,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:03,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:03,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:03,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:03,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:03,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 14:13:03,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:13:03,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:13:03,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:13:03,712 INFO L87 Difference]: Start difference. First operand 238 states and 246 transitions. Second operand 10 states. [2018-02-04 14:13:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:04,024 INFO L93 Difference]: Finished difference Result 264 states and 274 transitions. [2018-02-04 14:13:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:13:04,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 14:13:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:04,028 INFO L225 Difference]: With dead ends: 264 [2018-02-04 14:13:04,028 INFO L226 Difference]: Without dead ends: 264 [2018-02-04 14:13:04,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:13:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-04 14:13:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-02-04 14:13:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 14:13:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2018-02-04 14:13:04,036 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 22 [2018-02-04 14:13:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:04,037 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2018-02-04 14:13:04,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:13:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2018-02-04 14:13:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:13:04,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:04,038 INFO L351 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] [2018-02-04 14:13:04,038 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173165, now seen corresponding path program 1 times [2018-02-04 14:13:04,038 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:04,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:04,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:04,039 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:04,039 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:04,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:04,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:04,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:13:04,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:13:04,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:13:04,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:13:04,212 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand 11 states. [2018-02-04 14:13:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:04,828 INFO L93 Difference]: Finished difference Result 484 states and 500 transitions. [2018-02-04 14:13:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:13:04,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 14:13:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:04,830 INFO L225 Difference]: With dead ends: 484 [2018-02-04 14:13:04,830 INFO L226 Difference]: Without dead ends: 484 [2018-02-04 14:13:04,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:13:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-04 14:13:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2018-02-04 14:13:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-04 14:13:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 473 transitions. [2018-02-04 14:13:04,844 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 473 transitions. Word has length 22 [2018-02-04 14:13:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:04,844 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 473 transitions. [2018-02-04 14:13:04,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:13:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 473 transitions. [2018-02-04 14:13:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:13:04,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:04,845 INFO L351 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] [2018-02-04 14:13:04,845 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -598304902, now seen corresponding path program 1 times [2018-02-04 14:13:04,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:04,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:04,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:04,846 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:04,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:04,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:04,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:04,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:13:04,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:13:04,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:13:04,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:13:04,922 INFO L87 Difference]: Start difference. First operand 400 states and 473 transitions. Second operand 7 states. [2018-02-04 14:13:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:05,135 INFO L93 Difference]: Finished difference Result 412 states and 481 transitions. [2018-02-04 14:13:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:13:05,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 14:13:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:05,137 INFO L225 Difference]: With dead ends: 412 [2018-02-04 14:13:05,137 INFO L226 Difference]: Without dead ends: 412 [2018-02-04 14:13:05,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:13:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-04 14:13:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 271. [2018-02-04 14:13:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 14:13:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 288 transitions. [2018-02-04 14:13:05,143 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 288 transitions. Word has length 23 [2018-02-04 14:13:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:05,144 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 288 transitions. [2018-02-04 14:13:05,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:13:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 288 transitions. [2018-02-04 14:13:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:13:05,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:05,144 INFO L351 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] [2018-02-04 14:13:05,144 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash -598304901, now seen corresponding path program 1 times [2018-02-04 14:13:05,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:05,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:05,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:05,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:05,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:05,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:05,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:13:05,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:13:05,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:13:05,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:13:05,229 INFO L87 Difference]: Start difference. First operand 271 states and 288 transitions. Second operand 8 states. [2018-02-04 14:13:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:05,441 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2018-02-04 14:13:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:13:05,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 14:13:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:05,442 INFO L225 Difference]: With dead ends: 275 [2018-02-04 14:13:05,442 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 14:13:05,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:13:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 14:13:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-02-04 14:13:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-04 14:13:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 284 transitions. [2018-02-04 14:13:05,449 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 284 transitions. Word has length 23 [2018-02-04 14:13:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:05,449 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 284 transitions. [2018-02-04 14:13:05,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:13:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 284 transitions. [2018-02-04 14:13:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:13:05,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:05,450 INFO L351 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] [2018-02-04 14:13:05,450 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:05,450 INFO L82 PathProgramCache]: Analyzing trace with hash 554606109, now seen corresponding path program 1 times [2018-02-04 14:13:05,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:05,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:05,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:05,451 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:05,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:05,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:05,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:13:05,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:13:05,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:13:05,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:13:05,484 INFO L87 Difference]: Start difference. First operand 271 states and 284 transitions. Second operand 5 states. [2018-02-04 14:13:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:05,636 INFO L93 Difference]: Finished difference Result 270 states and 281 transitions. [2018-02-04 14:13:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:13:05,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 14:13:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:05,639 INFO L225 Difference]: With dead ends: 270 [2018-02-04 14:13:05,639 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 14:13:05,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:13:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 14:13:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-02-04 14:13:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 14:13:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 281 transitions. [2018-02-04 14:13:05,647 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 281 transitions. Word has length 25 [2018-02-04 14:13:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:05,647 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 281 transitions. [2018-02-04 14:13:05,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:13:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 281 transitions. [2018-02-04 14:13:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:13:05,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:05,648 INFO L351 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] [2018-02-04 14:13:05,648 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:05,648 INFO L82 PathProgramCache]: Analyzing trace with hash 554606110, now seen corresponding path program 1 times [2018-02-04 14:13:05,648 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:05,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:05,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,649 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:05,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:05,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:05,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:05,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:13:05,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:13:05,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:13:05,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:13:05,725 INFO L87 Difference]: Start difference. First operand 270 states and 281 transitions. Second operand 8 states. [2018-02-04 14:13:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:05,901 INFO L93 Difference]: Finished difference Result 272 states and 279 transitions. [2018-02-04 14:13:05,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:13:05,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 14:13:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:05,902 INFO L225 Difference]: With dead ends: 272 [2018-02-04 14:13:05,902 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 14:13:05,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:13:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 14:13:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-02-04 14:13:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 14:13:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 279 transitions. [2018-02-04 14:13:05,908 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 279 transitions. Word has length 25 [2018-02-04 14:13:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:05,908 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 279 transitions. [2018-02-04 14:13:05,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:13:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 279 transitions. [2018-02-04 14:13:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:13:05,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:05,909 INFO L351 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] [2018-02-04 14:13:05,909 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658537, now seen corresponding path program 1 times [2018-02-04 14:13:05,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:05,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:05,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:05,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:05,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:06,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:06,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:13:06,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 14:13:06,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 14:13:06,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 14:13:06,040 INFO L87 Difference]: Start difference. First operand 270 states and 279 transitions. Second operand 11 states. [2018-02-04 14:13:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:06,352 INFO L93 Difference]: Finished difference Result 269 states and 278 transitions. [2018-02-04 14:13:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:13:06,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 14:13:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:06,354 INFO L225 Difference]: With dead ends: 269 [2018-02-04 14:13:06,354 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 14:13:06,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:13:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 14:13:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-02-04 14:13:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-04 14:13:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 278 transitions. [2018-02-04 14:13:06,358 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 278 transitions. Word has length 48 [2018-02-04 14:13:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:06,358 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 278 transitions. [2018-02-04 14:13:06,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 14:13:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 278 transitions. [2018-02-04 14:13:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 14:13:06,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:06,359 INFO L351 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] [2018-02-04 14:13:06,359 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:06,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658536, now seen corresponding path program 1 times [2018-02-04 14:13:06,360 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:06,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:06,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:06,360 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:06,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:06,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:06,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:06,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:13:06,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:13:06,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:13:06,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:13:06,396 INFO L87 Difference]: Start difference. First operand 269 states and 278 transitions. Second operand 7 states. [2018-02-04 14:13:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:06,607 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2018-02-04 14:13:06,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:13:06,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 14:13:06,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:06,608 INFO L225 Difference]: With dead ends: 264 [2018-02-04 14:13:06,608 INFO L226 Difference]: Without dead ends: 264 [2018-02-04 14:13:06,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:13:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-04 14:13:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-02-04 14:13:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 14:13:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 273 transitions. [2018-02-04 14:13:06,612 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 273 transitions. Word has length 48 [2018-02-04 14:13:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:06,612 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 273 transitions. [2018-02-04 14:13:06,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:13:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 273 transitions. [2018-02-04 14:13:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 14:13:06,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:06,613 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:13:06,613 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 652522709, now seen corresponding path program 1 times [2018-02-04 14:13:06,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:06,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:06,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:06,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:06,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:06,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:06,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:13:06,998 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:13:07,007 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:07,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:13:07,102 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-02-04 14:13:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 14:13:07,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 14:13:07,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 14:13:07,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 14:13:07,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,239 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-02-04 14:13:07,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-04 14:13:07,431 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-02-04 14:13:07,433 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-02-04 14:13:07,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,440 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-02-04 14:13:07,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-04 14:13:07,593 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 21 treesize of output 33 [2018-02-04 14:13:07,600 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 22 treesize of output 21 [2018-02-04 14:13:07,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 14:13:07,689 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 58 [2018-02-04 14:13:07,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:07,697 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 56 treesize of output 69 [2018-02-04 14:13:07,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,727 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-02-04 14:13:07,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-04 14:13:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:07,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:07,785 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 15 treesize of output 8 [2018-02-04 14:13:07,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,791 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-02-04 14:13:07,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-02-04 14:13:07,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:07,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:07,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:07,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-02-04 14:13:07,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,863 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-02-04 14:13:07,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:77 [2018-02-04 14:13:07,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2018-02-04 14:13:07,967 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 12 treesize of output 1 [2018-02-04 14:13:07,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:07,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:07,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:77 [2018-02-04 14:13:08,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-02-04 14:13:08,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:08,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-02-04 14:13:08,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:08,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 14 [2018-02-04 14:13:08,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:08,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:08,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:08,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:81, output treesize:28 [2018-02-04 14:13:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:08,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:13:08,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2018-02-04 14:13:08,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 14:13:08,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 14:13:08,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1884, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 14:13:08,361 INFO L87 Difference]: Start difference. First operand 264 states and 273 transitions. Second operand 46 states. [2018-02-04 14:13:13,567 WARN L146 SmtUtils]: Spent 4056ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-02-04 14:13:17,666 WARN L146 SmtUtils]: Spent 4057ms on a formula simplification. DAG size of input: 92 DAG size of output 66 [2018-02-04 14:13:18,322 WARN L146 SmtUtils]: Spent 612ms on a formula simplification. DAG size of input: 101 DAG size of output 73 [2018-02-04 14:13:22,385 WARN L146 SmtUtils]: Spent 4026ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-02-04 14:13:22,962 WARN L146 SmtUtils]: Spent 541ms on a formula simplification. DAG size of input: 75 DAG size of output 59 [2018-02-04 14:13:23,484 WARN L146 SmtUtils]: Spent 464ms on a formula simplification. DAG size of input: 50 DAG size of output 40 [2018-02-04 14:13:24,053 WARN L146 SmtUtils]: Spent 475ms on a formula simplification. DAG size of input: 54 DAG size of output 44 [2018-02-04 14:13:24,562 WARN L146 SmtUtils]: Spent 443ms on a formula simplification. DAG size of input: 42 DAG size of output 42 [2018-02-04 14:13:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:26,841 INFO L93 Difference]: Finished difference Result 443 states and 465 transitions. [2018-02-04 14:13:26,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 14:13:26,841 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2018-02-04 14:13:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:26,843 INFO L225 Difference]: With dead ends: 443 [2018-02-04 14:13:26,843 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 14:13:26,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=810, Invalid=5510, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 14:13:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 14:13:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 365. [2018-02-04 14:13:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-04 14:13:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 407 transitions. [2018-02-04 14:13:26,853 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 407 transitions. Word has length 52 [2018-02-04 14:13:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:26,854 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 407 transitions. [2018-02-04 14:13:26,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 14:13:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 407 transitions. [2018-02-04 14:13:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 14:13:26,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:26,855 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:13:26,855 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:26,855 INFO L82 PathProgramCache]: Analyzing trace with hash 652522710, now seen corresponding path program 1 times [2018-02-04 14:13:26,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:26,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:26,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:26,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:26,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:26,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:27,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:13:27,330 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:13:27,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:27,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:13:27,391 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-02-04 14:13:27,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 14:13:27,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 14:13:27,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 14:13:27,456 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-02-04 14:13:27,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 14:13:27,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 14:13:27,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,528 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-02-04 14:13:27,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-04 14:13:27,657 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-02-04 14:13:27,659 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-02-04 14:13:27,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,686 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-02-04 14:13:27,688 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-02-04 14:13:27,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:27,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-02-04 14:13:27,835 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 25 treesize of output 49 [2018-02-04 14:13:27,838 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 34 treesize of output 33 [2018-02-04 14:13:27,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,878 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 36 treesize of output 46 [2018-02-04 14:13:27,880 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 37 treesize of output 36 [2018-02-04 14:13:27,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:27,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-02-04 14:13:27,963 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 127 [2018-02-04 14:13:27,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:27,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:27,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:27,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 150 [2018-02-04 14:13:27,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:27,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:28,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,022 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 125 treesize of output 146 [2018-02-04 14:13:28,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,064 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 119 treesize of output 115 [2018-02-04 14:13:28,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,075 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 114 treesize of output 135 [2018-02-04 14:13:28,076 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,124 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,137 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:153, output treesize:137 [2018-02-04 14:13:28,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,185 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 15 treesize of output 8 [2018-02-04 14:13:28,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:136 [2018-02-04 14:13:28,248 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 31 treesize of output 22 [2018-02-04 14:13:28,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,264 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-02-04 14:13:28,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:147, output treesize:132 [2018-02-04 14:13:28,383 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 134 [2018-02-04 14:13:28,388 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 130 treesize of output 118 [2018-02-04 14:13:28,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 124 [2018-02-04 14:13:28,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 14:13:28,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 14:13:28,522 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 153 [2018-02-04 14:13:28,526 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 144 treesize of output 132 [2018-02-04 14:13:28,694 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 138 [2018-02-04 14:13:28,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 14:13:28,775 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 14:13:28,780 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 109 treesize of output 106 [2018-02-04 14:13:28,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 80 [2018-02-04 14:13:28,784 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,793 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,798 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 109 treesize of output 106 [2018-02-04 14:13:28,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:28,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 80 [2018-02-04 14:13:28,803 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,813 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:28,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 14:13:28,849 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:162, output treesize:291 [2018-02-04 14:13:29,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2018-02-04 14:13:29,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2018-02-04 14:13:29,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 14:13:29,123 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-02-04 14:13:29,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 64 [2018-02-04 14:13:29,148 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 64 treesize of output 29 [2018-02-04 14:13:29,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,161 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-02-04 14:13:29,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-02-04 14:13:29,175 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-02-04 14:13:29,181 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,183 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2018-02-04 14:13:29,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 14:13:29,195 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2018-02-04 14:13:29,199 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,203 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:29,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:13:29,211 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:181, output treesize:25 [2018-02-04 14:13:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:29,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 14:13:29,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 46 [2018-02-04 14:13:29,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 14:13:29,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 14:13:29,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2009, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 14:13:29,321 INFO L87 Difference]: Start difference. First operand 365 states and 407 transitions. Second operand 47 states. [2018-02-04 14:13:30,780 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 114 DAG size of output 78 [2018-02-04 14:13:30,962 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 121 DAG size of output 87 [2018-02-04 14:13:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:34,306 INFO L93 Difference]: Finished difference Result 442 states and 464 transitions. [2018-02-04 14:13:34,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 14:13:34,306 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 52 [2018-02-04 14:13:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:34,308 INFO L225 Difference]: With dead ends: 442 [2018-02-04 14:13:34,308 INFO L226 Difference]: Without dead ends: 442 [2018-02-04 14:13:34,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=726, Invalid=5126, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 14:13:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-04 14:13:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 338. [2018-02-04 14:13:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 14:13:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 379 transitions. [2018-02-04 14:13:34,317 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 379 transitions. Word has length 52 [2018-02-04 14:13:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:34,317 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 379 transitions. [2018-02-04 14:13:34,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 14:13:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 379 transitions. [2018-02-04 14:13:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 14:13:34,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:34,318 INFO L351 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] [2018-02-04 14:13:34,318 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1566668974, now seen corresponding path program 1 times [2018-02-04 14:13:34,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:34,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:34,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:34,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:34,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:34,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:34,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:34,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 14:13:34,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 14:13:34,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 14:13:34,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:13:34,506 INFO L87 Difference]: Start difference. First operand 338 states and 379 transitions. Second operand 14 states. [2018-02-04 14:13:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:35,148 INFO L93 Difference]: Finished difference Result 350 states and 391 transitions. [2018-02-04 14:13:35,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:13:35,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-04 14:13:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:35,150 INFO L225 Difference]: With dead ends: 350 [2018-02-04 14:13:35,150 INFO L226 Difference]: Without dead ends: 350 [2018-02-04 14:13:35,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-02-04 14:13:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-04 14:13:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 336. [2018-02-04 14:13:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-04 14:13:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 375 transitions. [2018-02-04 14:13:35,154 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 375 transitions. Word has length 52 [2018-02-04 14:13:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:35,154 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 375 transitions. [2018-02-04 14:13:35,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 14:13:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 375 transitions. [2018-02-04 14:13:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 14:13:35,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:35,154 INFO L351 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] [2018-02-04 14:13:35,155 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:35,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557105, now seen corresponding path program 1 times [2018-02-04 14:13:35,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:35,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:35,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:35,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:35,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:35,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:35,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:35,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 14:13:35,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 14:13:35,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 14:13:35,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-02-04 14:13:35,752 INFO L87 Difference]: Start difference. First operand 336 states and 375 transitions. Second operand 25 states. [2018-02-04 14:13:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:38,239 INFO L93 Difference]: Finished difference Result 539 states and 599 transitions. [2018-02-04 14:13:38,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 14:13:38,240 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-02-04 14:13:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:38,241 INFO L225 Difference]: With dead ends: 539 [2018-02-04 14:13:38,241 INFO L226 Difference]: Without dead ends: 539 [2018-02-04 14:13:38,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=2149, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 14:13:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-04 14:13:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 458. [2018-02-04 14:13:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 14:13:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 538 transitions. [2018-02-04 14:13:38,251 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 538 transitions. Word has length 61 [2018-02-04 14:13:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:38,251 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 538 transitions. [2018-02-04 14:13:38,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 14:13:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 538 transitions. [2018-02-04 14:13:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 14:13:38,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:38,252 INFO L351 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] [2018-02-04 14:13:38,252 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557104, now seen corresponding path program 1 times [2018-02-04 14:13:38,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:38,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:38,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:38,254 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:38,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:38,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:39,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:39,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-04 14:13:39,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 14:13:39,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 14:13:39,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-04 14:13:39,157 INFO L87 Difference]: Start difference. First operand 458 states and 538 transitions. Second operand 24 states. [2018-02-04 14:13:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:42,097 INFO L93 Difference]: Finished difference Result 552 states and 613 transitions. [2018-02-04 14:13:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 14:13:42,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-04 14:13:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:42,098 INFO L225 Difference]: With dead ends: 552 [2018-02-04 14:13:42,098 INFO L226 Difference]: Without dead ends: 552 [2018-02-04 14:13:42,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=296, Invalid=2056, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 14:13:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-02-04 14:13:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 458. [2018-02-04 14:13:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-04 14:13:42,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 535 transitions. [2018-02-04 14:13:42,107 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 535 transitions. Word has length 61 [2018-02-04 14:13:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:42,108 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 535 transitions. [2018-02-04 14:13:42,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 14:13:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 535 transitions. [2018-02-04 14:13:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 14:13:42,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:42,109 INFO L351 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] [2018-02-04 14:13:42,109 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137695, now seen corresponding path program 1 times [2018-02-04 14:13:42,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:42,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:42,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:42,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:42,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:42,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:42,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:42,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:13:42,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:13:42,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:13:42,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:13:42,160 INFO L87 Difference]: Start difference. First operand 458 states and 535 transitions. Second operand 4 states. [2018-02-04 14:13:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:42,265 INFO L93 Difference]: Finished difference Result 452 states and 517 transitions. [2018-02-04 14:13:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:13:42,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 14:13:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:42,267 INFO L225 Difference]: With dead ends: 452 [2018-02-04 14:13:42,267 INFO L226 Difference]: Without dead ends: 452 [2018-02-04 14:13:42,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:13:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-04 14:13:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2018-02-04 14:13:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 14:13:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 517 transitions. [2018-02-04 14:13:42,274 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 517 transitions. Word has length 73 [2018-02-04 14:13:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:42,275 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 517 transitions. [2018-02-04 14:13:42,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:13:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 517 transitions. [2018-02-04 14:13:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 14:13:42,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:42,276 INFO L351 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] [2018-02-04 14:13:42,276 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137694, now seen corresponding path program 1 times [2018-02-04 14:13:42,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:42,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:42,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:42,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:42,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:42,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:43,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:13:43,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-02-04 14:13:43,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 14:13:43,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 14:13:43,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-04 14:13:43,346 INFO L87 Difference]: Start difference. First operand 452 states and 517 transitions. Second operand 26 states. [2018-02-04 14:13:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:13:46,215 INFO L93 Difference]: Finished difference Result 534 states and 589 transitions. [2018-02-04 14:13:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 14:13:46,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-02-04 14:13:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:13:46,217 INFO L225 Difference]: With dead ends: 534 [2018-02-04 14:13:46,217 INFO L226 Difference]: Without dead ends: 534 [2018-02-04 14:13:46,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 14:13:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-04 14:13:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 452. [2018-02-04 14:13:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 14:13:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 511 transitions. [2018-02-04 14:13:46,223 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 511 transitions. Word has length 73 [2018-02-04 14:13:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:13:46,223 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 511 transitions. [2018-02-04 14:13:46,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 14:13:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 511 transitions. [2018-02-04 14:13:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 14:13:46,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:13:46,224 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:13:46,224 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 14:13:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash 935805702, now seen corresponding path program 1 times [2018-02-04 14:13:46,224 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 14:13:46,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 14:13:46,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:46,225 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:46,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 14:13:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:46,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:13:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:13:47,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 14:13:47,618 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 14:13:47,623 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 14:13:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:13:47,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 14:13:47,672 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-02-04 14:13:47,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 14:13:47,701 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-02-04 14:13:47,702 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-02-04 14:13:47,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 14:13:47,732 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 21 treesize of output 16 [2018-02-04 14:13:47,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:47,734 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 16 treesize of output 23 [2018-02-04 14:13:47,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 14:13:47,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 14:13:47,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 14:13:47,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:47,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 14:13:47,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:47,787 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-02-04 14:13:48,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:48,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:48,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:48,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:146, output treesize:275 [2018-02-04 14:13:48,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 14:13:48,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:48,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:48,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-02-04 14:13:49,539 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-02-04 14:13:49,541 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-02-04 14:13:49,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:49,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:49,551 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-02-04 14:13:49,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:93 [2018-02-04 14:13:49,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:49,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:49,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:49,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:186, output treesize:323 [2018-02-04 14:13:49,991 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 586 treesize of output 582 [2018-02-04 14:13:49,994 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 587 treesize of output 586 [2018-02-04 14:13:49,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:50,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:50,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:50,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:622, output treesize:618 [2018-02-04 14:13:50,565 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 870 treesize of output 776 [2018-02-04 14:13:50,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:50,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:50,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:50,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:50,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 923 [2018-02-04 14:13:50,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:50,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:50,915 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 865 treesize of output 882 [2018-02-04 14:13:50,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:51,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:13:51,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:51,087 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:883, output treesize:879 [2018-02-04 14:13:51,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:51,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:13:51,526 INFO L303 Elim1Store]: Index analysis took 164 ms [2018-02-04 14:13:51,527 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-02-04 14:13:51,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:13:52,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-04 14:13:52,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:40183, output treesize:40177 [2018-02-04 14:13:55,010 WARN L143 SmtUtils]: Spent 331ms on a formula simplification that was a NOOP. DAG size: 91 [2018-02-04 14:14:00,232 WARN L146 SmtUtils]: Spent 5210ms on a formula simplification. DAG size of input: 141 DAG size of output 95 [2018-02-04 14:14:00,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:00,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:00,363 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-02-04 14:14:00,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2018-02-04 14:14:00,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:01,875 INFO L303 Elim1Store]: Index analysis took 313 ms [2018-02-04 14:14:01,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28284 treesize of output 18824 [2018-02-04 14:14:01,917 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-02-04 14:14:01,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:02,647 INFO L303 Elim1Store]: Index analysis took 413 ms [2018-02-04 14:14:02,648 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18819 treesize of output 7583 [2018-02-04 14:14:04,455 WARN L146 SmtUtils]: Spent 1806ms on a formula simplification. DAG size of input: 113 DAG size of output 77 [2018-02-04 14:14:04,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:04,604 INFO L303 Elim1Store]: Index analysis took 147 ms [2018-02-04 14:14:04,997 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 4 case distinctions, treesize of input 5356 treesize of output 5081 [2018-02-04 14:14:04,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 14:14:06,405 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-02-04 14:14:06,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5064 treesize of output 3155 [2018-02-04 14:14:06,476 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-02-04 14:14:06,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:06,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-02-04 14:14:06,498 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:06,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:06,896 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-02-04 14:14:06,901 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 3 case distinctions, treesize of input 21 treesize of output 36 [2018-02-04 14:14:06,902 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:07,308 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 14:14:07,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:07,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3154 treesize of output 1982 [2018-02-04 14:14:10,816 WARN L146 SmtUtils]: Spent 2948ms on a formula simplification. DAG size of input: 106 DAG size of output 99 [2018-02-04 14:14:10,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:10,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-02-04 14:14:10,859 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:11,839 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 0 case distinctions, treesize of input 1773 treesize of output 1159 [2018-02-04 14:14:12,532 WARN L146 SmtUtils]: Spent 691ms on a formula simplification. DAG size of input: 131 DAG size of output 69 [2018-02-04 14:14:12,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:12,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:12,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:12,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 594 treesize of output 536 [2018-02-04 14:14:12,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:12,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:12,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:12,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:12,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 515 [2018-02-04 14:14:12,592 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:12,665 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:12,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 389 [2018-02-04 14:14:13,279 WARN L143 SmtUtils]: Spent 447ms on a formula simplification that was a NOOP. DAG size: 84 [2018-02-04 14:14:13,281 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 14:14:13,281 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:13,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:13,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:13,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:13,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:13,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:13,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:13,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:13,386 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-02-04 14:14:13,480 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 8 case distinctions, treesize of input 322 treesize of output 365 [2018-02-04 14:14:13,482 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 16 xjuncts. [2018-02-04 14:14:14,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 248 [2018-02-04 14:14:14,278 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 78 DAG size of output 66 [2018-02-04 14:14:14,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,373 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 4 case distinctions, treesize of input 141 treesize of output 229 [2018-02-04 14:14:14,373 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-02-04 14:14:14,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 195 [2018-02-04 14:14:14,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,618 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:14,640 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 198 [2018-02-04 14:14:14,755 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 125 DAG size of output 80 [2018-02-04 14:14:14,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,780 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 251 [2018-02-04 14:14:14,780 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:14,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,879 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,881 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:14,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 177 [2018-02-04 14:14:14,882 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:14,922 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:14,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,957 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:14,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 142 [2018-02-04 14:14:14,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:14,971 INFO L477 Elim1Store]: Elim1 applied some 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 78 [2018-02-04 14:14:14,972 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:14:15,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 138 [2018-02-04 14:14:15,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,117 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 109 treesize of output 322 [2018-02-04 14:14:15,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,135 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:15,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 291 treesize of output 349 [2018-02-04 14:14:15,159 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:15,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,605 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:15,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 14 case distinctions, treesize of input 95 treesize of output 341 [2018-02-04 14:14:15,656 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:15,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,844 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:15,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 300 [2018-02-04 14:14:15,849 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:15,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,972 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:15,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:15,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 97 treesize of output 326 [2018-02-04 14:14:16,004 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:16,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,162 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:16,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 14 case distinctions, treesize of input 98 treesize of output 336 [2018-02-04 14:14:16,202 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:16,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,301 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:16,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 330 [2018-02-04 14:14:16,329 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:16,431 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:14:16,458 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:14:16,492 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 14:14:16,516 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:16,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 177 [2018-02-04 14:14:16,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,568 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:16,591 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:16,614 INFO L477 Elim1Store]: Elim1 applied some 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 6 case distinctions, treesize of input 90 treesize of output 218 [2018-02-04 14:14:16,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 207 treesize of output 278 [2018-02-04 14:14:16,687 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:16,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:16,968 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:16,985 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 2 case distinctions, treesize of input 74 treesize of output 236 [2018-02-04 14:14:16,986 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:17,169 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 14:14:17,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,375 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:17,375 INFO L303 Elim1Store]: Index analysis took 153 ms [2018-02-04 14:14:17,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 142 [2018-02-04 14:14:17,399 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 104 [2018-02-04 14:14:17,399 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:14:17,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 149 [2018-02-04 14:14:17,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,540 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 341 [2018-02-04 14:14:17,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,587 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:17,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 307 treesize of output 355 [2018-02-04 14:14:17,631 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:17,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,983 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:17,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:17,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 111 treesize of output 372 [2018-02-04 14:14:18,011 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:18,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,222 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:18,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 92 treesize of output 355 [2018-02-04 14:14:18,261 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:18,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,530 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:18,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 331 [2018-02-04 14:14:18,539 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:18,609 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:14:18,640 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:14:18,673 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 14:14:18,696 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:18,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 195 [2018-02-04 14:14:18,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,782 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:18,816 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-02-04 14:14:18,825 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 233 [2018-02-04 14:14:18,941 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 136 DAG size of output 81 [2018-02-04 14:14:18,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:18,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 281 [2018-02-04 14:14:19,017 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-02-04 14:14:19,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,253 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:19,274 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 68 treesize of output 245 [2018-02-04 14:14:19,274 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:19,400 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:14:19,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,464 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:19,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 165 [2018-02-04 14:14:19,501 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 154 [2018-02-04 14:14:19,502 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 14:14:19,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 187 [2018-02-04 14:14:19,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,716 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 158 treesize of output 448 [2018-02-04 14:14:19,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,750 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:19,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:19,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 415 treesize of output 523 [2018-02-04 14:14:19,778 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:20,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,591 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,604 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:20,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 30 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 504 [2018-02-04 14:14:20,631 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:20,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,972 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:20,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,981 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:20,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 485 [2018-02-04 14:14:20,993 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:21,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,310 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,312 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:21,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 469 [2018-02-04 14:14:21,339 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:21,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,668 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:21,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 459 [2018-02-04 14:14:21,689 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:21,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,949 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,953 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:21,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 451 [2018-02-04 14:14:21,991 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:22,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,227 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:22,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 420 [2018-02-04 14:14:22,272 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:22,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,672 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:22,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 27 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 484 [2018-02-04 14:14:22,701 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:22,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,980 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:22,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:22,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 26 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 12 case distinctions, treesize of input 138 treesize of output 464 [2018-02-04 14:14:23,035 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:23,164 INFO L267 ElimStorePlain]: Start of recursive call 54: 7 dim-0 vars, 12 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-02-04 14:14:23,271 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-02-04 14:14:23,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 176 [2018-02-04 14:14:23,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,410 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 17 case distinctions, treesize of input 143 treesize of output 431 [2018-02-04 14:14:23,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,442 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:23,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:23,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 26 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 473 [2018-02-04 14:14:23,466 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:26,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,360 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:26,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:26,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 140 treesize of output 430 [2018-02-04 14:14:26,402 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:27,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,954 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:27,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,973 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:27,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 460 [2018-02-04 14:14:27,986 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:29,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,496 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:29,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:29,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 26 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 445 [2018-02-04 14:14:29,519 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:30,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,952 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:30,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:30,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 445 [2018-02-04 14:14:30,976 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:32,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,420 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:32,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:32,472 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-02-04 14:14:32,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 138 treesize of output 465 [2018-02-04 14:14:32,497 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 4 xjuncts. [2018-02-04 14:14:34,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,038 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:34,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:34,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 401 [2018-02-04 14:14:34,055 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:35,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,568 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:35,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:35,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 427 [2018-02-04 14:14:35,606 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:36,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,926 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:36,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:36,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 139 treesize of output 452 [2018-02-04 14:14:36,990 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-02-04 14:14:37,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,811 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,812 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:37,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:37,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 421 [2018-02-04 14:14:37,855 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:39,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,118 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:39,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 144 treesize of output 452 [2018-02-04 14:14:39,174 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:39,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,769 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,779 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:39,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:39,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 434 [2018-02-04 14:14:39,807 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:40,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,414 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:40,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:40,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 26 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 458 [2018-02-04 14:14:40,453 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:41,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,545 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:41,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:41,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 399 [2018-02-04 14:14:41,570 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:42,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,462 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:42,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:42,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 456 [2018-02-04 14:14:42,498 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:43,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,482 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,492 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:43,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:43,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 436 [2018-02-04 14:14:43,547 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:44,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,047 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:44,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:44,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 456 [2018-02-04 14:14:44,091 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:44,532 INFO L267 ElimStorePlain]: Start of recursive call 65: 16 dim-0 vars, 28 dim-1 vars, End of recursive call: 8 dim-0 vars, and 11 xjuncts. [2018-02-04 14:14:44,745 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 11 xjuncts. [2018-02-04 14:14:45,183 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 26 dim-0 vars, and 17 xjuncts. [2018-02-04 14:14:45,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,189 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:45,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 161 [2018-02-04 14:14:45,215 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 121 [2018-02-04 14:14:45,216 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:14:45,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 159 [2018-02-04 14:14:45,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,359 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 351 [2018-02-04 14:14:45,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,378 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:45,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 326 treesize of output 404 [2018-02-04 14:14:45,409 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 3 xjuncts. [2018-02-04 14:14:45,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,794 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,794 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:45,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:45,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 116 treesize of output 426 [2018-02-04 14:14:45,849 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 9 xjuncts. [2018-02-04 14:14:46,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,127 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:46,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 393 [2018-02-04 14:14:46,154 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 3 xjuncts. [2018-02-04 14:14:46,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,364 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:46,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 345 [2018-02-04 14:14:46,372 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:46,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,494 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:46,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 16 case distinctions, treesize of input 119 treesize of output 425 [2018-02-04 14:14:46,558 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 9 xjuncts. [2018-02-04 14:14:46,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,837 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:46,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:46,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 102 treesize of output 379 [2018-02-04 14:14:46,864 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 3 xjuncts. [2018-02-04 14:14:46,940 INFO L267 ElimStorePlain]: Start of recursive call 86: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:14:46,971 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 14:14:47,016 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 14:14:47,445 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 24 dim-0 vars, and 15 xjuncts. [2018-02-04 14:14:47,886 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 24 dim-0 vars, and 17 xjuncts. [2018-02-04 14:14:47,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 248 [2018-02-04 14:14:48,158 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 78 DAG size of output 66 [2018-02-04 14:14:48,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,242 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 4 case distinctions, treesize of input 139 treesize of output 231 [2018-02-04 14:14:48,243 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 4 xjuncts. [2018-02-04 14:14:48,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 175 [2018-02-04 14:14:48,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 195 [2018-02-04 14:14:48,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,474 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:48,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 284 [2018-02-04 14:14:48,476 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-02-04 14:14:48,519 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 14:14:48,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,556 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:48,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 146 [2018-02-04 14:14:48,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,574 INFO L477 Elim1Store]: Elim1 applied some 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 94 [2018-02-04 14:14:48,575 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 14:14:48,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,617 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:48,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 153 [2018-02-04 14:14:48,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,640 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 14:14:48,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 14:14:48,682 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_110 term size 110 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 14:14:48,685 INFO L168 Benchmark]: Toolchain (without parser) took 107826.79 ms. Allocated memory was 402.1 MB in the beginning and 824.2 MB in the end (delta: 422.1 MB). Free memory was 358.6 MB in the beginning and 603.7 MB in the end (delta: -245.1 MB). Peak memory consumption was 503.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:14:48,686 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:14:48,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.39 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 345.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-02-04 14:14:48,686 INFO L168 Benchmark]: Boogie Preprocessor took 32.83 ms. Allocated memory is still 402.1 MB. Free memory was 345.2 MB in the beginning and 342.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:14:48,686 INFO L168 Benchmark]: RCFGBuilder took 509.43 ms. Allocated memory is still 402.1 MB. Free memory was 342.6 MB in the beginning and 281.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-02-04 14:14:48,686 INFO L168 Benchmark]: TraceAbstraction took 107094.91 ms. Allocated memory was 402.1 MB in the beginning and 824.2 MB in the end (delta: 422.1 MB). Free memory was 280.2 MB in the beginning and 603.7 MB in the end (delta: -323.5 MB). Peak memory consumption was 425.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:14:48,687 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 186.39 ms. Allocated memory is still 402.1 MB. Free memory was 358.6 MB in the beginning and 345.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.83 ms. Allocated memory is still 402.1 MB. Free memory was 345.2 MB in the beginning and 342.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 509.43 ms. Allocated memory is still 402.1 MB. Free memory was 342.6 MB in the beginning and 281.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 107094.91 ms. Allocated memory was 402.1 MB in the beginning and 824.2 MB in the end (delta: 422.1 MB). Free memory was 280.2 MB in the beginning and 603.7 MB in the end (delta: -323.5 MB). Peak memory consumption was 425.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_110 term size 110 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_110 term size 110: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-14-48-693.csv Received shutdown request...