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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:45:41,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:45:41,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:45:41,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:45:41,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:45:41,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:45:41,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:45:41,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:45:41,834 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:45:41,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:45:41,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:45:41,835 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:45:41,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:45:41,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:45:41,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:45:41,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:45:41,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:45:41,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:45:41,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:45:41,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:45:41,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:45:41,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:45:41,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:45:41,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:45:41,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:45:41,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:45:41,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:45:41,850 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:45:41,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:45:41,850 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:45:41,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:45:41,851 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:45:41,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:45:41,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:45:41,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:45:41,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:45:41,860 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:45:41,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:45:41,861 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:45:41,862 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:45:41,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:45:41,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:45:41,862 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:45:41,862 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:45:41,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:45:41,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:45:41,862 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:45:41,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:45:41,863 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:45:41,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:45:41,895 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:45:41,897 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:45:41,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:45:41,898 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:45:41,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i [2018-02-04 17:45:42,021 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:45:42,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:45:42,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:45:42,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:45:42,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:45:42,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ca7b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42, skipping insertion in model container [2018-02-04 17:45:42,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,041 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:45:42,069 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:45:42,166 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:45:42,185 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:45:42,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42 WrapperNode [2018-02-04 17:45:42,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:45:42,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:45:42,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:45:42,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:45:42,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (1/1) ... [2018-02-04 17:45:42,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:45:42,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:45:42,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:45:42,226 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:45:42,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (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 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-04 17:45:42,262 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-04 17:45:42,263 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-04 17:45:42,263 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-04 17:45:42,263 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-04 17:45:42,263 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 17:45:42,263 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:45:42,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:45:42,666 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:45:42,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:45:42 BoogieIcfgContainer [2018-02-04 17:45:42,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:45:42,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:45:42,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:45:42,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:45:42,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:45:42" (1/3) ... [2018-02-04 17:45:42,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786facd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:45:42, skipping insertion in model container [2018-02-04 17:45:42,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:45:42" (2/3) ... [2018-02-04 17:45:42,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786facd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:45:42, skipping insertion in model container [2018-02-04 17:45:42,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:45:42" (3/3) ... [2018-02-04 17:45:42,672 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0137_false-valid-deref.i [2018-02-04 17:45:42,677 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:45:42,681 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-04 17:45:42,714 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:45:42,714 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:45:42,714 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:45:42,714 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:45:42,714 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:45:42,714 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:45:42,714 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:45:42,714 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:45:42,715 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:45:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-02-04 17:45:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 17:45:42,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:42,735 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 17:45:42,736 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 8574872, now seen corresponding path program 1 times [2018-02-04 17:45:42,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:42,742 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:42,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:42,775 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:42,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:42,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:42,857 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 17:45:42,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:42,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:45:42,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:45:42,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:45:42,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:45:42,870 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 3 states. [2018-02-04 17:45:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:43,080 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-04 17:45:43,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:45:43,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 17:45:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:43,089 INFO L225 Difference]: With dead ends: 189 [2018-02-04 17:45:43,089 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 17:45:43,091 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 17:45:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 17:45:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-02-04 17:45:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 17:45:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-02-04 17:45:43,121 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 4 [2018-02-04 17:45:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:43,121 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-02-04 17:45:43,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:45:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-02-04 17:45:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 17:45:43,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:43,122 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 17:45:43,122 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash 8574873, now seen corresponding path program 1 times [2018-02-04 17:45:43,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:43,122 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:43,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,123 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:43,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:43,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:43,168 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 17:45:43,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:43,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:45:43,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:45:43,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:45:43,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:45:43,169 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 3 states. [2018-02-04 17:45:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:43,281 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2018-02-04 17:45:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:45:43,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 17:45:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:43,283 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:45:43,283 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:45:43,283 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 17:45:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:45:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-04 17:45:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 17:45:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2018-02-04 17:45:43,295 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 4 [2018-02-04 17:45:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:43,295 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2018-02-04 17:45:43,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:45:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2018-02-04 17:45:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:45:43,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:43,296 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:43,296 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065266, now seen corresponding path program 1 times [2018-02-04 17:45:43,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:43,297 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:43,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,298 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:43,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:43,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:43,357 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 17:45:43,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:43,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:45:43,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:45:43,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:45:43,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:45:43,358 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand 4 states. [2018-02-04 17:45:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:43,465 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-02-04 17:45:43,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:45:43,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:45:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:43,466 INFO L225 Difference]: With dead ends: 182 [2018-02-04 17:45:43,466 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 17:45:43,466 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 17:45:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 17:45:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 17:45:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 17:45:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-02-04 17:45:43,474 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 16 [2018-02-04 17:45:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:43,474 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-02-04 17:45:43,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:45:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-02-04 17:45:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:45:43,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:43,474 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:43,474 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:43,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065267, now seen corresponding path program 1 times [2018-02-04 17:45:43,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:43,475 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:43,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:43,475 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:43,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:43,543 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 17:45:43,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:43,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:45:43,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:45:43,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:45:43,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:45:43,544 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 4 states. [2018-02-04 17:45:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:43,651 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-02-04 17:45:43,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:45:43,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:45:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:43,652 INFO L225 Difference]: With dead ends: 181 [2018-02-04 17:45:43,653 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 17:45:43,653 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 17:45:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 17:45:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-02-04 17:45:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 17:45:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2018-02-04 17:45:43,660 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 16 [2018-02-04 17:45:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:43,660 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2018-02-04 17:45:43,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:45:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2018-02-04 17:45:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:45:43,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:43,661 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 17:45:43,661 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -466429743, now seen corresponding path program 1 times [2018-02-04 17:45:43,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:43,661 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:43,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:43,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:43,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:43,687 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:43,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:43,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:43,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:43,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:43,755 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 17:45:43,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:43,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:43,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:45:43,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-02-04 17:45:43,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:43,789 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 17:45:43,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:45:43,799 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 17:45:43,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:43,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:45:43,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:45:43,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:45:43,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:45:43,801 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand 5 states. [2018-02-04 17:45:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:43,995 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-04 17:45:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:45:43,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 17:45:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:43,997 INFO L225 Difference]: With dead ends: 189 [2018-02-04 17:45:43,997 INFO L226 Difference]: Without dead ends: 189 [2018-02-04 17:45:43,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:45:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-04 17:45:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-02-04 17:45:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 17:45:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-02-04 17:45:44,003 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 19 [2018-02-04 17:45:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:44,003 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-02-04 17:45:44,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:45:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-02-04 17:45:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:45:44,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:44,004 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 17:45:44,004 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -466429742, now seen corresponding path program 1 times [2018-02-04 17:45:44,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:44,005 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:44,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:44,006 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:44,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:44,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:44,025 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:44,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:44,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:44,026 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:44,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:44,063 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 17:45:44,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,068 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 17:45:44,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:45:44,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:44,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:44,084 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 17:45:44,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:44,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 17:45:44,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:44,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 17:45:44,125 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 17:45:44,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:44,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:45:44,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:45:44,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:45:44,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:45:44,126 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 6 states. [2018-02-04 17:45:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:44,517 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2018-02-04 17:45:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:45:44,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:45:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:44,518 INFO L225 Difference]: With dead ends: 228 [2018-02-04 17:45:44,519 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 17:45:44,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:45:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 17:45:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 206. [2018-02-04 17:45:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 17:45:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 229 transitions. [2018-02-04 17:45:44,525 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 229 transitions. Word has length 19 [2018-02-04 17:45:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:44,525 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 229 transitions. [2018-02-04 17:45:44,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:45:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 229 transitions. [2018-02-04 17:45:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:45:44,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:44,526 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 17:45:44,526 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:44,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060692, now seen corresponding path program 1 times [2018-02-04 17:45:44,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:44,527 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:44,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:44,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:44,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:44,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:44,546 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:44,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:44,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:44,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:44,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:44,590 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 17:45:44,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:45:44,600 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 17:45:44,601 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 17:45:44,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:45:44,615 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 17:45:44,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:44,617 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 17:45:44,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 17:45:44,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:44,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:44,646 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 17:45:44,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-02-04 17:45:44,677 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 17:45:44,679 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 17:45:44,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:44,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:34 [2018-02-04 17:45:44,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 17:45:44,745 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:45:44,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:44,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 17:45:44,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:44,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:44,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:15 [2018-02-04 17:45:44,794 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 17:45:44,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:44,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:45:44,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:45:44,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:45:44,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:45:44,796 INFO L87 Difference]: Start difference. First operand 206 states and 229 transitions. Second operand 13 states. [2018-02-04 17:45:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:45,433 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2018-02-04 17:45:45,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:45:45,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-02-04 17:45:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:45,435 INFO L225 Difference]: With dead ends: 247 [2018-02-04 17:45:45,436 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 17:45:45,436 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:45:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 17:45:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2018-02-04 17:45:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 17:45:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 256 transitions. [2018-02-04 17:45:45,442 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 256 transitions. Word has length 22 [2018-02-04 17:45:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:45,443 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 256 transitions. [2018-02-04 17:45:45,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:45:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2018-02-04 17:45:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:45:45,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:45,444 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 17:45:45,447 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060691, now seen corresponding path program 1 times [2018-02-04 17:45:45,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:45,447 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:45,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:45,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:45,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:45,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:45,466 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:45,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:45,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:45,467 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:45,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:45,507 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 17:45:45,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,514 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 17:45:45,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:45:45,538 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 17:45:45,540 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 17:45:45,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,552 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 17:45:45,555 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 17:45:45,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-04 17:45:45,575 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 17:45:45,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,578 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 17:45:45,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,593 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 17:45:45,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,598 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 17:45:45,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-04 17:45:45,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 17:45:45,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,656 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:45:45,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:46 [2018-02-04 17:45:45,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,709 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 17:45:45,712 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 17:45:45,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,738 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 17:45:45,741 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 17:45:45,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,755 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 1 xjuncts. [2018-02-04 17:45:45,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:46 [2018-02-04 17:45:45,832 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 24 treesize of output 18 [2018-02-04 17:45:45,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,837 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:45:45,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 17:45:45,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,858 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 24 treesize of output 18 [2018-02-04 17:45:45,860 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:45:45,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:45,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 17:45:45,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:45,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:45,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:17 [2018-02-04 17:45:45,927 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 17:45:45,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:45,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:45:45,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:45:45,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:45:45,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:45:45,929 INFO L87 Difference]: Start difference. First operand 224 states and 256 transitions. Second operand 13 states. [2018-02-04 17:45:46,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:46,837 INFO L93 Difference]: Finished difference Result 246 states and 271 transitions. [2018-02-04 17:45:46,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:45:46,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-02-04 17:45:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:46,838 INFO L225 Difference]: With dead ends: 246 [2018-02-04 17:45:46,838 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 17:45:46,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:45:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 17:45:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 224. [2018-02-04 17:45:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 17:45:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 255 transitions. [2018-02-04 17:45:46,845 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 255 transitions. Word has length 22 [2018-02-04 17:45:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:46,845 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 255 transitions. [2018-02-04 17:45:46,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:45:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 255 transitions. [2018-02-04 17:45:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:45:46,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:46,846 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 17:45:46,846 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:46,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824186, now seen corresponding path program 1 times [2018-02-04 17:45:46,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:46,847 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:46,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:46,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:46,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:46,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:46,896 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 17:45:46,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:46,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:45:46,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:45:46,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:45:46,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:45:46,898 INFO L87 Difference]: Start difference. First operand 224 states and 255 transitions. Second operand 7 states. [2018-02-04 17:45:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:47,084 INFO L93 Difference]: Finished difference Result 229 states and 250 transitions. [2018-02-04 17:45:47,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:45:47,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 17:45:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:47,085 INFO L225 Difference]: With dead ends: 229 [2018-02-04 17:45:47,085 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 17:45:47,086 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 17:45:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 17:45:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-02-04 17:45:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 17:45:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 250 transitions. [2018-02-04 17:45:47,091 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 250 transitions. Word has length 23 [2018-02-04 17:45:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:47,091 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 250 transitions. [2018-02-04 17:45:47,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:45:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 250 transitions. [2018-02-04 17:45:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:45:47,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:47,092 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 17:45:47,092 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824187, now seen corresponding path program 1 times [2018-02-04 17:45:47,092 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:47,092 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:47,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,093 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:47,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:47,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:47,165 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 17:45:47,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:47,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:45:47,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:45:47,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:45:47,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:45:47,166 INFO L87 Difference]: Start difference. First operand 223 states and 250 transitions. Second operand 8 states. [2018-02-04 17:45:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:47,338 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-02-04 17:45:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:45:47,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 17:45:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:47,339 INFO L225 Difference]: With dead ends: 227 [2018-02-04 17:45:47,339 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:45:47,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 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 17:45:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:45:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-02-04 17:45:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 17:45:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 246 transitions. [2018-02-04 17:45:47,344 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 246 transitions. Word has length 23 [2018-02-04 17:45:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:47,345 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 246 transitions. [2018-02-04 17:45:47,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:45:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 246 transitions. [2018-02-04 17:45:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:45:47,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:47,345 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 17:45:47,345 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:47,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156317, now seen corresponding path program 1 times [2018-02-04 17:45:47,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:47,346 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:47,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:47,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:47,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:47,379 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 17:45:47,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:47,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:45:47,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:45:47,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:45:47,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:45:47,380 INFO L87 Difference]: Start difference. First operand 223 states and 246 transitions. Second operand 5 states. [2018-02-04 17:45:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:47,464 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2018-02-04 17:45:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:45:47,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 17:45:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:47,465 INFO L225 Difference]: With dead ends: 222 [2018-02-04 17:45:47,465 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 17:45:47,465 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 17:45:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 17:45:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-04 17:45:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 17:45:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2018-02-04 17:45:47,469 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 25 [2018-02-04 17:45:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:47,469 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2018-02-04 17:45:47,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:45:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2018-02-04 17:45:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:45:47,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:47,470 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 17:45:47,470 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156318, now seen corresponding path program 1 times [2018-02-04 17:45:47,470 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:47,470 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:47,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,471 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:47,471 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:47,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:47,549 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 17:45:47,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:47,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:45:47,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:45:47,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:45:47,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:45:47,550 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand 8 states. [2018-02-04 17:45:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:47,721 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2018-02-04 17:45:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:45:47,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 17:45:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:47,722 INFO L225 Difference]: With dead ends: 224 [2018-02-04 17:45:47,722 INFO L226 Difference]: Without dead ends: 224 [2018-02-04 17:45:47,723 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 17:45:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-04 17:45:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-02-04 17:45:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 17:45:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 241 transitions. [2018-02-04 17:45:47,729 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 241 transitions. Word has length 25 [2018-02-04 17:45:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:47,729 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 241 transitions. [2018-02-04 17:45:47,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:45:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 241 transitions. [2018-02-04 17:45:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 17:45:47,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:47,730 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] [2018-02-04 17:45:47,731 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783090, now seen corresponding path program 1 times [2018-02-04 17:45:47,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:47,731 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:47,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,732 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:47,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:47,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:47,816 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 17:45:47,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:47,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:45:47,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:45:47,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:45:47,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:45:47,817 INFO L87 Difference]: Start difference. First operand 222 states and 241 transitions. Second operand 9 states. [2018-02-04 17:45:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:48,092 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-02-04 17:45:48,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:45:48,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 17:45:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:48,093 INFO L225 Difference]: With dead ends: 221 [2018-02-04 17:45:48,093 INFO L226 Difference]: Without dead ends: 221 [2018-02-04 17:45:48,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:45:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-04 17:45:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-02-04 17:45:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 17:45:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 239 transitions. [2018-02-04 17:45:48,097 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 239 transitions. Word has length 41 [2018-02-04 17:45:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:48,097 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 239 transitions. [2018-02-04 17:45:48,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:45:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 239 transitions. [2018-02-04 17:45:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 17:45:48,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:48,097 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] [2018-02-04 17:45:48,097 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783091, now seen corresponding path program 1 times [2018-02-04 17:45:48,098 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:48,098 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:48,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:48,098 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:48,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:48,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:48,208 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 17:45:48,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:48,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:45:48,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:45:48,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:45:48,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:45:48,209 INFO L87 Difference]: Start difference. First operand 221 states and 239 transitions. Second operand 11 states. [2018-02-04 17:45:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:48,497 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2018-02-04 17:45:48,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:45:48,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 17:45:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:48,499 INFO L225 Difference]: With dead ends: 218 [2018-02-04 17:45:48,499 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 17:45:48,499 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 17:45:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 17:45:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-04 17:45:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 17:45:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 235 transitions. [2018-02-04 17:45:48,504 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 235 transitions. Word has length 41 [2018-02-04 17:45:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:48,505 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 235 transitions. [2018-02-04 17:45:48,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:45:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 235 transitions. [2018-02-04 17:45:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:45:48,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:48,506 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] [2018-02-04 17:45:48,506 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash 856902849, now seen corresponding path program 1 times [2018-02-04 17:45:48,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:48,506 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:48,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:48,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:48,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:48,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:48,527 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:48,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:48,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:48,528 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:48,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:48,579 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 17:45:48,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:45:48,668 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 17:45:48,670 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 17:45:48,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,680 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 17:45:48,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-02-04 17:45:48,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:48,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:48,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:48,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-02-04 17:45:48,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,776 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 17:45:48,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:41 [2018-02-04 17:45:48,834 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 33 treesize of output 34 [2018-02-04 17:45:48,840 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 17:45:48,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,855 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 17:45:48,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:41 [2018-02-04 17:45:48,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 17:45:48,942 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:45:48,943 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 13 [2018-02-04 17:45:48,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:48,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:48,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:24 [2018-02-04 17:45:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:49,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:45:49,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 17:45:49,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:45:49,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:45:49,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:45:49,058 INFO L87 Difference]: Start difference. First operand 218 states and 235 transitions. Second operand 20 states. [2018-02-04 17:45:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:52,236 INFO L93 Difference]: Finished difference Result 304 states and 326 transitions. [2018-02-04 17:45:52,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:45:52,236 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-02-04 17:45:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:52,237 INFO L225 Difference]: With dead ends: 304 [2018-02-04 17:45:52,238 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 17:45:52,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:45:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 17:45:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 218. [2018-02-04 17:45:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 17:45:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 234 transitions. [2018-02-04 17:45:52,244 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 234 transitions. Word has length 48 [2018-02-04 17:45:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:52,244 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 234 transitions. [2018-02-04 17:45:52,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:45:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 234 transitions. [2018-02-04 17:45:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:45:52,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:52,246 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] [2018-02-04 17:45:52,246 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash 856902850, now seen corresponding path program 1 times [2018-02-04 17:45:52,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:52,250 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:52,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:52,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:52,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:52,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:52,282 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:52,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:52,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:52,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:52,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:52,359 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 17:45:52,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:45:52,419 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 17:45:52,422 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 17:45:52,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,437 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 17:45:52,439 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 17:45:52,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,454 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 17:45:52,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2018-02-04 17:45:52,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 15 [2018-02-04 17:45:52,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:52,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:52,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:45:52,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:52,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-02-04 17:45:52,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 17:45:52,615 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 17:45:52,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 17:45:52,636 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 17:45:52,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:52,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:35 [2018-02-04 17:45:52,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 17:45:52,700 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:45:52,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 17:45:52,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 17:45:52,715 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:45:52,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 17:45:52,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:52,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:45:52,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:52, output treesize:14 [2018-02-04 17:45:52,771 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 17:45:52,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:45:52,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:45:52,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:45:52,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:45:52,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:45:52,773 INFO L87 Difference]: Start difference. First operand 218 states and 234 transitions. Second operand 19 states. [2018-02-04 17:45:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:54,139 INFO L93 Difference]: Finished difference Result 276 states and 289 transitions. [2018-02-04 17:45:54,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:45:54,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-04 17:45:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:54,140 INFO L225 Difference]: With dead ends: 276 [2018-02-04 17:45:54,140 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 17:45:54,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:45:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 17:45:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 200. [2018-02-04 17:45:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 17:45:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 213 transitions. [2018-02-04 17:45:54,148 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 213 transitions. Word has length 48 [2018-02-04 17:45:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:54,148 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 213 transitions. [2018-02-04 17:45:54,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:45:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 213 transitions. [2018-02-04 17:45:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:45:54,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:54,149 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 17:45:54,149 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:54,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377315, now seen corresponding path program 1 times [2018-02-04 17:45:54,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:54,149 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:54,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:54,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:54,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:54,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:54,189 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 17:45:54,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:54,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:45:54,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:45:54,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:45:54,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:45:54,190 INFO L87 Difference]: Start difference. First operand 200 states and 213 transitions. Second operand 3 states. [2018-02-04 17:45:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:54,294 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2018-02-04 17:45:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:45:54,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 17:45:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:54,296 INFO L225 Difference]: With dead ends: 194 [2018-02-04 17:45:54,296 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 17:45:54,296 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 17:45:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 17:45:54,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-02-04 17:45:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 17:45:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2018-02-04 17:45:54,301 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 48 [2018-02-04 17:45:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:54,301 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2018-02-04 17:45:54,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:45:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2018-02-04 17:45:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:45:54,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:54,302 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 17:45:54,306 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377314, now seen corresponding path program 1 times [2018-02-04 17:45:54,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:54,307 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:54,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:54,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:54,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:54,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:54,347 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 17:45:54,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:54,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:45:54,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:45:54,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:45:54,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:45:54,348 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand 3 states. [2018-02-04 17:45:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:54,403 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2018-02-04 17:45:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:45:54,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 17:45:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:54,405 INFO L225 Difference]: With dead ends: 188 [2018-02-04 17:45:54,405 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 17:45:54,405 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 17:45:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 17:45:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-04 17:45:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 17:45:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-02-04 17:45:54,409 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 48 [2018-02-04 17:45:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:54,409 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-02-04 17:45:54,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:45:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-02-04 17:45:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 17:45:54,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:54,410 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] [2018-02-04 17:45:54,410 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765471, now seen corresponding path program 1 times [2018-02-04 17:45:54,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:54,410 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:54,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:54,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:54,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:54,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:54,546 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 17:45:54,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:54,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:45:54,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:45:54,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:45:54,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:45:54,546 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 11 states. [2018-02-04 17:45:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:55,145 INFO L93 Difference]: Finished difference Result 276 states and 297 transitions. [2018-02-04 17:45:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:45:55,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-04 17:45:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:55,146 INFO L225 Difference]: With dead ends: 276 [2018-02-04 17:45:55,146 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 17:45:55,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:45:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 17:45:55,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 190. [2018-02-04 17:45:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 17:45:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2018-02-04 17:45:55,149 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 55 [2018-02-04 17:45:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:55,149 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2018-02-04 17:45:55,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:45:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2018-02-04 17:45:55,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 17:45:55,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:55,150 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] [2018-02-04 17:45:55,150 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765472, now seen corresponding path program 1 times [2018-02-04 17:45:55,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:55,150 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:55,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:55,151 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:55,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:55,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:55,299 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 17:45:55,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:55,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:45:55,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:45:55,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:45:55,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:45:55,300 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand 12 states. [2018-02-04 17:45:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:55,978 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-02-04 17:45:55,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:45:55,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-04 17:45:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:55,979 INFO L225 Difference]: With dead ends: 220 [2018-02-04 17:45:55,979 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 17:45:55,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:45:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 17:45:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2018-02-04 17:45:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 17:45:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2018-02-04 17:45:55,982 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 55 [2018-02-04 17:45:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:55,982 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2018-02-04 17:45:55,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:45:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2018-02-04 17:45:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 17:45:55,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:55,983 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] [2018-02-04 17:45:55,983 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:55,983 INFO L82 PathProgramCache]: Analyzing trace with hash -558928184, now seen corresponding path program 1 times [2018-02-04 17:45:55,983 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:55,983 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:55,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:55,984 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:55,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:55,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:56,149 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 17:45:56,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:56,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 17:45:56,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:45:56,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:45:56,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:45:56,150 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand 16 states. [2018-02-04 17:45:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:57,291 INFO L93 Difference]: Finished difference Result 230 states and 250 transitions. [2018-02-04 17:45:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:45:57,291 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-04 17:45:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:57,292 INFO L225 Difference]: With dead ends: 230 [2018-02-04 17:45:57,292 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 17:45:57,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:45:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 17:45:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 193. [2018-02-04 17:45:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 17:45:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2018-02-04 17:45:57,295 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 58 [2018-02-04 17:45:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:57,296 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2018-02-04 17:45:57,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:45:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2018-02-04 17:45:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 17:45:57,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:57,296 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:57,296 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, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:57,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1044324748, now seen corresponding path program 1 times [2018-02-04 17:45:57,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:57,296 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:57,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:57,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:57,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:57,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:57,309 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:57,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:57,309 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:57,310 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:57,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:57,348 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 17:45:57,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:45:57,360 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 17:45:57,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 17:45:57,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:57,382 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:45:57,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,384 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 17:45:57,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:45:57,419 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 17:45:57,420 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 17:45:57,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,423 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 17:45:57,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-02-04 17:45:57,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:57,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:57,459 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 17:45:57,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-02-04 17:45:57,478 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 15 treesize of output 8 [2018-02-04 17:45:57,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,488 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 8 treesize of output 6 [2018-02-04 17:45:57,491 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-02-04 17:45:57,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,493 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 17:45:57,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2018-02-04 17:45:57,504 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 25 treesize of output 19 [2018-02-04 17:45:57,505 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 17:45:57,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-02-04 17:45:57,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:57,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-02-04 17:45:57,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:57,559 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 2 xjuncts. [2018-02-04 17:45:57,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-02-04 17:45:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:45:57,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:45:57,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:45:57,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:45:57,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:45:57,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:45:57,587 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand 17 states. [2018-02-04 17:45:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:58,819 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-02-04 17:45:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:45:58,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-02-04 17:45:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:58,820 INFO L225 Difference]: With dead ends: 239 [2018-02-04 17:45:58,820 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 17:45:58,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:45:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 17:45:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2018-02-04 17:45:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 17:45:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 207 transitions. [2018-02-04 17:45:58,824 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 207 transitions. Word has length 60 [2018-02-04 17:45:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:58,825 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 207 transitions. [2018-02-04 17:45:58,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:45:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 207 transitions. [2018-02-04 17:45:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 17:45:58,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:58,826 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:58,826 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1264430060, now seen corresponding path program 1 times [2018-02-04 17:45:58,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:58,826 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:58,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:58,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:58,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 17:45:59,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:45:59,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 17:45:59,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:45:59,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:45:59,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:45:59,061 INFO L87 Difference]: Start difference. First operand 195 states and 207 transitions. Second operand 17 states. [2018-02-04 17:45:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:45:59,746 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2018-02-04 17:45:59,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:45:59,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-04 17:45:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:45:59,746 INFO L225 Difference]: With dead ends: 189 [2018-02-04 17:45:59,746 INFO L226 Difference]: Without dead ends: 189 [2018-02-04 17:45:59,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:45:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-04 17:45:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2018-02-04 17:45:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 17:45:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-02-04 17:45:59,749 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 63 [2018-02-04 17:45:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:45:59,749 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-02-04 17:45:59,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:45:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-02-04 17:45:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 17:45:59,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:45:59,750 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:45:59,750 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:45:59,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017735, now seen corresponding path program 1 times [2018-02-04 17:45:59,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:45:59,751 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:45:59,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:59,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:59,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:45:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:59,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:45:59,769 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:45:59,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:45:59,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:45:59,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:45:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:45:59,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:45:59,831 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 17:45:59,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:45:59,835 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 17:45:59,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 17:45:59,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,851 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:45:59,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,852 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 17:45:59,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:45:59,880 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 17:45:59,881 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 17:45:59,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,885 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 17:45:59,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-02-04 17:45:59,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:45:59,943 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 17:45:59,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:45:59,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:23 [2018-02-04 17:46:00,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:00,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:00,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:00,051 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-02-04 17:46:00,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:40 [2018-02-04 17:46:00,073 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 37 treesize of output 38 [2018-02-04 17:46:00,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:00,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-02-04 17:46:00,109 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 46 treesize of output 45 [2018-02-04 17:46:00,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:00,111 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 16 treesize of output 23 [2018-02-04 17:46:00,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,128 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 17:46:00,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:56 [2018-02-04 17:46:00,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-02-04 17:46:00,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:00,183 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 17:46:00,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,190 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 17:46:00,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:00,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:00,198 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:28 [2018-02-04 17:46:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:00,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:46:00,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 17:46:00,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:46:00,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:46:00,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:46:00,296 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 20 states. [2018-02-04 17:46:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:01,686 INFO L93 Difference]: Finished difference Result 274 states and 294 transitions. [2018-02-04 17:46:01,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:46:01,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-02-04 17:46:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:01,687 INFO L225 Difference]: With dead ends: 274 [2018-02-04 17:46:01,687 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 17:46:01,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:46:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 17:46:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 208. [2018-02-04 17:46:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 17:46:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2018-02-04 17:46:01,692 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 66 [2018-02-04 17:46:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:01,692 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2018-02-04 17:46:01,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:46:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2018-02-04 17:46:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 17:46:01,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:01,693 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:01,694 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:46:01,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017736, now seen corresponding path program 1 times [2018-02-04 17:46:01,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:01,694 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:01,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:01,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:01,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:01,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:01,726 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:46:01,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:01,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:01,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:01,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:01,817 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 17:46:01,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:01,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:01,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:46:01,845 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 17:46:01,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:01,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:01,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 17:46:01,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:01,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:46:01,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,025 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 17:46:02,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:46:02,178 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 17:46:02,181 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 17:46:02,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,194 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 17:46:02,196 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 17:46:02,196 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,207 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 17:46:02,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:36 [2018-02-04 17:46:02,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 17:46:02,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,335 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 17:46:02,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:48 [2018-02-04 17:46:02,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-02-04 17:46:02,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 33 [2018-02-04 17:46:02,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:02,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2018-02-04 17:46:02,513 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-04 17:46:02,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:02,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,535 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 17:46:02,537 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 17:46:02,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:02,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:57 [2018-02-04 17:46:02,590 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-02-04 17:46:02,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,593 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 17:46:02,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-02-04 17:46:02,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,619 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 16 treesize of output 23 [2018-02-04 17:46:02,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:02,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:75 [2018-02-04 17:46:02,700 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 41 treesize of output 35 [2018-02-04 17:46:02,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,705 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 17:46:02,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,720 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:02,720 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 13 [2018-02-04 17:46:02,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-02-04 17:46:02,743 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:02,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 17:46:02,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:02,767 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 17:46:02,767 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:02,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:02,839 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:14 [2018-02-04 17:46:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:03,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:46:03,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 17:46:03,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:46:03,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:46:03,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:46:03,165 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand 23 states. [2018-02-04 17:46:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:05,662 INFO L93 Difference]: Finished difference Result 258 states and 277 transitions. [2018-02-04 17:46:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:46:05,662 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-02-04 17:46:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:05,663 INFO L225 Difference]: With dead ends: 258 [2018-02-04 17:46:05,663 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 17:46:05,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 17:46:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 17:46:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 208. [2018-02-04 17:46:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 17:46:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-04 17:46:05,668 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 66 [2018-02-04 17:46:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:05,668 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-04 17:46:05,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:46:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-04 17:46:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 17:46:05,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:05,669 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:05,669 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:46:05,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017030, now seen corresponding path program 1 times [2018-02-04 17:46:05,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:05,669 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:05,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:05,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:05,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:05,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:05,687 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:46:05,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:05,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:05,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:05,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:05,732 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 17:46:05,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:46:05,738 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 17:46:05,739 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 17:46:05,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-02-04 17:46:05,752 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 17:46:05,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:05,755 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 17:46:05,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-02-04 17:46:05,805 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 24 treesize of output 18 [2018-02-04 17:46:05,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:05,807 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 18 treesize of output 10 [2018-02-04 17:46:05,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:05,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2018-02-04 17:46:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:05,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:46:05,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:46:05,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:46:05,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:46:05,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:46:05,826 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 7 states. [2018-02-04 17:46:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:06,200 INFO L93 Difference]: Finished difference Result 230 states and 242 transitions. [2018-02-04 17:46:06,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:46:06,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-02-04 17:46:06,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:06,201 INFO L225 Difference]: With dead ends: 230 [2018-02-04 17:46:06,201 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 17:46:06,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:46:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 17:46:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2018-02-04 17:46:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 17:46:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 227 transitions. [2018-02-04 17:46:06,205 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 227 transitions. Word has length 67 [2018-02-04 17:46:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:06,205 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 227 transitions. [2018-02-04 17:46:06,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:46:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 227 transitions. [2018-02-04 17:46:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 17:46:06,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:06,206 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:06,206 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:46:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017031, now seen corresponding path program 1 times [2018-02-04 17:46:06,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:06,207 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:06,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:06,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:06,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:06,237 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:46:06,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:06,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:06,238 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:06,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:06,284 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 17:46:06,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:46:06,292 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 17:46:06,294 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 17:46:06,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,301 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 17:46:06,303 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 17:46:06,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-02-04 17:46:06,319 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 17:46:06,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:06,323 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 17:46:06,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,337 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 17:46:06,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:06,340 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 17:46:06,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-04 17:46:06,377 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 22 treesize of output 16 [2018-02-04 17:46:06,378 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 16 treesize of output 3 [2018-02-04 17:46:06,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,384 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 22 treesize of output 16 [2018-02-04 17:46:06,385 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 16 treesize of output 3 [2018-02-04 17:46:06,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:9 [2018-02-04 17:46:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:06,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:46:06,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:46:06,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:46:06,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:46:06,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:46:06,397 INFO L87 Difference]: Start difference. First operand 212 states and 227 transitions. Second operand 7 states. [2018-02-04 17:46:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:06,581 INFO L93 Difference]: Finished difference Result 234 states and 246 transitions. [2018-02-04 17:46:06,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:46:06,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-02-04 17:46:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:06,583 INFO L225 Difference]: With dead ends: 234 [2018-02-04 17:46:06,583 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 17:46:06,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:46:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 17:46:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 212. [2018-02-04 17:46:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 17:46:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 226 transitions. [2018-02-04 17:46:06,587 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 226 transitions. Word has length 67 [2018-02-04 17:46:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:06,587 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 226 transitions. [2018-02-04 17:46:06,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:46:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2018-02-04 17:46:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 17:46:06,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:06,588 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:06,588 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:46:06,588 INFO L82 PathProgramCache]: Analyzing trace with hash 48096554, now seen corresponding path program 1 times [2018-02-04 17:46:06,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:06,589 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:06,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:06,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:06,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 17:46:06,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:46:06,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:46:06,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:46:06,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:46:06,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:46:06,643 INFO L87 Difference]: Start difference. First operand 212 states and 226 transitions. Second operand 5 states. [2018-02-04 17:46:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:06,657 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-02-04 17:46:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:46:06,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-04 17:46:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:06,657 INFO L225 Difference]: With dead ends: 220 [2018-02-04 17:46:06,658 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 17:46:06,658 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 17:46:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 17:46:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-04 17:46:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 17:46:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 234 transitions. [2018-02-04 17:46:06,660 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 234 transitions. Word has length 68 [2018-02-04 17:46:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:06,660 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 234 transitions. [2018-02-04 17:46:06,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:46:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 234 transitions. [2018-02-04 17:46:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 17:46:06,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:06,661 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:46:06,661 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:46:06,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1255988233, now seen corresponding path program 1 times [2018-02-04 17:46:06,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:06,661 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:06,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:06,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:06,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:06,674 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:46:06,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:06,675 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:06,675 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:06,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:06,709 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 17:46:06,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:46:06,718 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 17:46:06,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 17:46:06,767 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 17:46:06,769 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 17:46:06,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,775 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 17:46:06,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-02-04 17:46:06,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:06,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:06,841 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 17:46:06,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,849 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 17:46:06,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:23 [2018-02-04 17:46:06,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:06,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:06,874 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 17:46:06,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,904 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 17:46:06,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2018-02-04 17:46:06,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 17:46:06,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:46:06,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,939 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 17:46:06,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-04 17:46:06,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-04 17:46:06,960 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 14 treesize of output 15 [2018-02-04 17:46:06,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:06,968 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 17:46:06,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-02-04 17:46:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:07,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:46:07,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:46:07,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:46:07,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:46:07,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:46:07,257 INFO L87 Difference]: Start difference. First operand 220 states and 234 transitions. Second operand 20 states. [2018-02-04 17:46:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:46:16,892 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2018-02-04 17:46:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:46:16,892 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-04 17:46:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:46:16,893 INFO L225 Difference]: With dead ends: 262 [2018-02-04 17:46:16,893 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 17:46:16,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1327, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 17:46:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 17:46:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 216. [2018-02-04 17:46:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 17:46:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 229 transitions. [2018-02-04 17:46:16,899 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 229 transitions. Word has length 70 [2018-02-04 17:46:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:46:16,900 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 229 transitions. [2018-02-04 17:46:16,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:46:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 229 transitions. [2018-02-04 17:46:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 17:46:16,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:46:16,900 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:16,900 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:46:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash 593824277, now seen corresponding path program 1 times [2018-02-04 17:46:16,901 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:46:16,901 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:46:16,901 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:16,901 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:16,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:46:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:16,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:46:16,928 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:46:16,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:46:16,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:46:16,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:46:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:46:17,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:46:17,045 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 17:46:17,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:46:17,057 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 17:46:17,058 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 17:46:17,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,069 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 17:46:17,071 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 17:46:17,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-02-04 17:46:17,090 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 17:46:17,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:17,093 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 17:46:17,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,113 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 17:46:17,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:17,116 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 17:46:17,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-02-04 17:46:17,151 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 17:46:17,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,163 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 17:46:17,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:17,166 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 17:46:17,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,177 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 17:46:17,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:17,180 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 17:46:17,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,187 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:50, output treesize:13 [2018-02-04 17:46:17,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:17,260 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:46:17,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,275 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 15 treesize of output 12 [2018-02-04 17:46:17,278 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 17:46:17,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,298 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 15 treesize of output 12 [2018-02-04 17:46:17,300 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 17:46:17,300 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:17,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:17,313 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:51, output treesize:15 [2018-02-04 17:46:17,822 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 17:46:17,845 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 17:46:17,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:17,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:18,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:18,041 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:285, output treesize:543 [2018-02-04 17:46:18,565 WARN L146 SmtUtils]: Spent 379ms on a formula simplification. DAG size of input: 114 DAG size of output 71 [2018-02-04 17:46:18,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:18,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:18,574 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 17:46:18,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:18,668 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 363 treesize of output 311 [2018-02-04 17:46:18,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 8 treesize of output 7 [2018-02-04 17:46:18,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:18,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:18,708 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:18,737 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 306 treesize of output 231 [2018-02-04 17:46:18,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:18,809 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:18,811 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:18,831 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 2 case distinctions, treesize of input 215 treesize of output 256 [2018-02-04 17:46:18,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:18,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:18,835 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:18,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:18,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 265 [2018-02-04 17:46:18,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:19,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,091 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 1 case distinctions, treesize of input 230 treesize of output 248 [2018-02-04 17:46:19,096 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-02-04 17:46:19,111 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-02-04 17:46:19,111 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,122 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 235 [2018-02-04 17:46:19,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 246 [2018-02-04 17:46:19,182 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,277 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:19,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 219 [2018-02-04 17:46:19,278 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,323 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:46:19,380 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:46:19,401 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 241 treesize of output 241 [2018-02-04 17:46:19,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-04 17:46:19,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,416 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-02-04 17:46:19,416 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,430 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,462 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 231 treesize of output 238 [2018-02-04 17:46:19,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,467 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:19,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 57 [2018-02-04 17:46:19,473 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,496 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,515 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,523 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 239 treesize of output 255 [2018-02-04 17:46:19,529 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-02-04 17:46:19,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,538 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-02-04 17:46:19,539 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,553 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,582 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 222 treesize of output 235 [2018-02-04 17:46:19,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,592 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:19,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,618 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 84 [2018-02-04 17:46:19,619 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:19,676 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:19,733 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:19,764 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 1 case distinctions, treesize of input 232 treesize of output 234 [2018-02-04 17:46:19,769 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-02-04 17:46:19,798 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-02-04 17:46:19,799 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,809 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:19,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:19,876 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 3 case distinctions, treesize of input 231 treesize of output 236 [2018-02-04 17:46:19,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 247 [2018-02-04 17:46:19,884 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:20,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:20,008 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:20,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 242 [2018-02-04 17:46:20,009 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:20,070 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:46:20,145 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:46:20,411 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-02-04 17:46:20,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-02-04 17:46:21,047 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 246 treesize of output 200 [2018-02-04 17:46:21,049 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 14 treesize of output 13 [2018-02-04 17:46:21,049 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,079 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 142 treesize of output 99 [2018-02-04 17:46:21,110 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,114 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 32 treesize of output 84 [2018-02-04 17:46:21,114 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,137 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 90 treesize of output 119 [2018-02-04 17:46:21,141 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 17:46:21,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,153 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 89 [2018-02-04 17:46:21,154 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,162 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,179 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 105 treesize of output 124 [2018-02-04 17:46:21,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,193 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,207 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 53 treesize of output 130 [2018-02-04 17:46:21,208 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,249 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,287 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,322 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,366 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,372 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 260 treesize of output 214 [2018-02-04 17:46:21,374 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 14 treesize of output 13 [2018-02-04 17:46:21,375 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,401 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 135 treesize of output 102 [2018-02-04 17:46:21,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,438 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2018-02-04 17:46:21,439 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,458 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 66 treesize of output 95 [2018-02-04 17:46:21,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 17:46:21,465 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,466 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-02-04 17:46:21,466 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,473 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,487 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 81 treesize of output 100 [2018-02-04 17:46:21,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,495 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,498 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,509 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 53 treesize of output 129 [2018-02-04 17:46:21,510 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,549 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,576 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,603 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,640 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,651 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 248 treesize of output 202 [2018-02-04 17:46:21,654 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 14 treesize of output 13 [2018-02-04 17:46:21,654 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,681 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 135 treesize of output 102 [2018-02-04 17:46:21,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,704 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2018-02-04 17:46:21,705 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,729 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 69 treesize of output 98 [2018-02-04 17:46:21,733 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 17:46:21,735 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-02-04 17:46:21,737 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,744 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,764 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 81 treesize of output 100 [2018-02-04 17:46:21,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,771 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,784 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 106 [2018-02-04 17:46:21,785 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,823 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,855 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:21,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 107 [2018-02-04 17:46:21,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 17:46:21,872 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:21,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 71 [2018-02-04 17:46:21,874 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,879 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:21,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 154 [2018-02-04 17:46:21,902 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 26 treesize of output 38 [2018-02-04 17:46:21,902 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,913 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,920 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:21,959 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 17:46:22,008 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 17:46:22,015 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 240 treesize of output 204 [2018-02-04 17:46:22,018 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 11 [2018-02-04 17:46:22,018 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,044 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 141 treesize of output 91 [2018-02-04 17:46:22,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,073 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2018-02-04 17:46:22,074 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 102 [2018-02-04 17:46:22,098 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-02-04 17:46:22,101 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-02-04 17:46:22,102 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,108 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 106 [2018-02-04 17:46:22,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,126 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,139 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 140 [2018-02-04 17:46:22,140 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,210 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,237 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,270 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,312 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,320 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 252 treesize of output 206 [2018-02-04 17:46:22,322 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 14 treesize of output 13 [2018-02-04 17:46:22,322 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,353 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 135 treesize of output 102 [2018-02-04 17:46:22,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,381 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2018-02-04 17:46:22,382 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,401 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 66 treesize of output 95 [2018-02-04 17:46:22,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 17:46:22,408 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-02-04 17:46:22,410 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,417 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,436 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 81 treesize of output 100 [2018-02-04 17:46:22,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,442 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,447 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,459 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 129 [2018-02-04 17:46:22,460 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,507 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,532 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,556 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,600 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,607 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 259 treesize of output 213 [2018-02-04 17:46:22,609 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 14 treesize of output 13 [2018-02-04 17:46:22,609 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,637 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 135 treesize of output 102 [2018-02-04 17:46:22,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,668 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2018-02-04 17:46:22,668 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,689 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 66 treesize of output 95 [2018-02-04 17:46:22,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 17:46:22,697 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-02-04 17:46:22,699 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,707 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,722 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 81 treesize of output 100 [2018-02-04 17:46:22,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:22,729 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,732 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:22,803 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 129 [2018-02-04 17:46:22,804 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,844 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,869 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,894 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,930 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:22,941 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 250 treesize of output 204 [2018-02-04 17:46:22,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 17:46:22,944 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:22,979 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 142 treesize of output 99 [2018-02-04 17:46:23,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,009 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:23,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,012 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 32 treesize of output 84 [2018-02-04 17:46:23,012 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,045 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 93 treesize of output 122 [2018-02-04 17:46:23,048 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 17:46:23,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,056 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 89 [2018-02-04 17:46:23,056 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,073 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,089 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 105 treesize of output 124 [2018-02-04 17:46:23,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,095 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:23,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,108 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 53 treesize of output 130 [2018-02-04 17:46:23,109 INFO L267 ElimStorePlain]: Start of recursive call 97: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:23,149 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:23,186 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:23,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 131 [2018-02-04 17:46:23,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 17:46:23,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,206 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 72 [2018-02-04 17:46:23,207 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,213 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 178 [2018-02-04 17:46:23,240 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 26 treesize of output 38 [2018-02-04 17:46:23,240 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,256 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,267 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,327 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 17:46:23,390 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 17:46:23,399 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 242 treesize of output 212 [2018-02-04 17:46:23,402 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 11 [2018-02-04 17:46:23,403 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,451 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 158 treesize of output 103 [2018-02-04 17:46:23,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,473 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:23,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,484 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 34 treesize of output 94 [2018-02-04 17:46:23,484 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 132 [2018-02-04 17:46:23,521 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 17:46:23,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,526 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2018-02-04 17:46:23,526 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,533 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:23,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 132 [2018-02-04 17:46:23,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,581 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:23,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:23,597 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 188 [2018-02-04 17:46:23,599 INFO L267 ElimStorePlain]: Start of recursive call 111: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:23,655 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:23,694 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:23,732 INFO L267 ElimStorePlain]: Start of recursive call 105: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:23,778 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:24,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 24 xjuncts. [2018-02-04 17:46:24,593 INFO L202 ElimStorePlain]: Needed 111 recursive calls to eliminate 9 variables, input treesize:580, output treesize:5019 [2018-02-04 17:46:25,091 WARN L146 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 428 DAG size of output 103 [2018-02-04 17:46:25,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 167 [2018-02-04 17:46:25,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:25,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,644 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 211 [2018-02-04 17:46:25,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:25,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,765 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 247 [2018-02-04 17:46:25,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:25,908 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:25,910 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 208 [2018-02-04 17:46:25,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:26,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 17:46:26,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:720, output treesize:748 [2018-02-04 17:46:26,204 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 244 treesize of output 290 [2018-02-04 17:46:26,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 325 treesize of output 322 [2018-02-04 17:46:26,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:26,360 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:26,361 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 238 treesize of output 239 [2018-02-04 17:46:26,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:26,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:46:26,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:26,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 211 treesize of output 265 [2018-02-04 17:46:26,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 306 treesize of output 303 [2018-02-04 17:46:26,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:26,970 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:26,970 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 201 treesize of output 206 [2018-02-04 17:46:26,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:27,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:46:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:27,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:27,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:27,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 266 [2018-02-04 17:46:27,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-02-04 17:46:27,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:27,517 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:27,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:27,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:27,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:27,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 221 [2018-02-04 17:46:27,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 17:46:27,889 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:27,916 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:28,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 248 [2018-02-04 17:46:28,207 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 26 treesize of output 24 [2018-02-04 17:46:28,207 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:28,245 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:28,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 187 [2018-02-04 17:46:28,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 17:46:28,511 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:28,534 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:28,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 317 [2018-02-04 17:46:28,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:46:28,781 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:28,810 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:28,812 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:28,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 261 [2018-02-04 17:46:28,829 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 106 [2018-02-04 17:46:28,830 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:28,859 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:29,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 318 [2018-02-04 17:46:29,093 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 112 [2018-02-04 17:46:29,093 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:46:29,130 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:29,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 386 [2018-02-04 17:46:29,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-04 17:46:29,145 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:29,181 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:29,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 8 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-02-04 17:46:29,401 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 9 variables, input treesize:836, output treesize:1267 [2018-02-04 17:46:29,666 WARN L143 SmtUtils]: Spent 167ms on a formula simplification that was a NOOP. DAG size: 168 [2018-02-04 17:46:29,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:29,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 249 [2018-02-04 17:46:29,705 INFO L477 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-04 17:46:29,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:29,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:30,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:30,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:30,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:30,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 279 [2018-02-04 17:46:30,902 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 62 [2018-02-04 17:46:30,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:30,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:31,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:31,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:31,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:31,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:31,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:31,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:31,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 336 [2018-02-04 17:46:31,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:31,868 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 186 [2018-02-04 17:46:31,868 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:31,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:32,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:32,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 279 treesize of output 412 [2018-02-04 17:46:32,707 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 76 [2018-02-04 17:46:32,707 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:32,766 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:33,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 359 [2018-02-04 17:46:33,403 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 74 [2018-02-04 17:46:33,404 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:33,449 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:33,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:33,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 288 [2018-02-04 17:46:33,987 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 111 [2018-02-04 17:46:33,989 INFO L267 ElimStorePlain]: Start of recursive call 13: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-02-04 17:46:34,035 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:34,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 317 [2018-02-04 17:46:34,501 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 111 [2018-02-04 17:46:34,503 INFO L267 ElimStorePlain]: Start of recursive call 15: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-02-04 17:46:34,555 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:34,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 398 [2018-02-04 17:46:34,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:34,946 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 49 treesize of output 83 [2018-02-04 17:46:34,946 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:34,981 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:35,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 292 [2018-02-04 17:46:35,316 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2018-02-04 17:46:35,317 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:35,354 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:35,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 285 [2018-02-04 17:46:35,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,672 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 150 [2018-02-04 17:46:35,673 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:35,713 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:35,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 355 [2018-02-04 17:46:35,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:35,967 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 101 treesize of output 125 [2018-02-04 17:46:35,967 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:35,990 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:36,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:36,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:36,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:36,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:36,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:36,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:36,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 205 [2018-02-04 17:46:36,205 INFO L477 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-04 17:46:36,206 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:36,238 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:36,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-02-04 17:46:36,414 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 18 variables, input treesize:1579, output treesize:1357 [2018-02-04 17:46:36,690 WARN L143 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 215 [2018-02-04 17:46:37,000 WARN L143 SmtUtils]: Spent 152ms on a formula simplification that was a NOOP. DAG size: 218 [2018-02-04 17:46:37,294 WARN L143 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 217 [2018-02-04 17:46:37,591 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:37,592 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 302 [2018-02-04 17:46:37,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,606 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 40 [2018-02-04 17:46:37,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:37,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,650 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 40 treesize of output 32 [2018-02-04 17:46:37,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:37,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-02-04 17:46:37,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:37,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:37,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:37,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 277 [2018-02-04 17:46:37,900 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 273 treesize of output 328 [2018-02-04 17:46:37,900 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-02-04 17:46:37,910 INFO L267 ElimStorePlain]: Start of recursive call 7: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 15 xjuncts. [2018-02-04 17:46:38,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 171 [2018-02-04 17:46:38,065 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:38,129 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 179 treesize of output 172 [2018-02-04 17:46:38,130 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:38,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 156 [2018-02-04 17:46:38,190 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:38,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,249 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 165 [2018-02-04 17:46:38,249 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:38,302 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 141 treesize of output 131 [2018-02-04 17:46:38,303 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:38,352 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 161 treesize of output 151 [2018-02-04 17:46:38,353 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:38,398 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:38,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 218 [2018-02-04 17:46:38,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,621 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 220 [2018-02-04 17:46:38,624 INFO L267 ElimStorePlain]: Start of recursive call 15: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-02-04 17:46:38,724 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 155 treesize of output 148 [2018-02-04 17:46:38,724 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:38,773 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 129 treesize of output 117 [2018-02-04 17:46:38,774 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:38,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:38,820 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:38,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 117 treesize of output 93 [2018-02-04 17:46:38,821 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:38,868 INFO L267 ElimStorePlain]: Start of recursive call 14: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 160 [2018-02-04 17:46:39,066 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 71 [2018-02-04 17:46:39,068 INFO L267 ElimStorePlain]: Start of recursive call 20: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-02-04 17:46:39,098 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:39,099 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 3 [2018-02-04 17:46:39,099 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,111 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 11 treesize of output 1 [2018-02-04 17:46:39,112 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,121 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 170 [2018-02-04 17:46:39,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,310 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 91 [2018-02-04 17:46:39,320 INFO L267 ElimStorePlain]: Start of recursive call 24: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 15 xjuncts. [2018-02-04 17:46:39,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-02-04 17:46:39,597 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 65 [2018-02-04 17:46:39,600 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-02-04 17:46:39,606 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 73 [2018-02-04 17:46:39,615 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:39,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 69 [2018-02-04 17:46:39,624 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:39,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-02-04 17:46:39,627 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,638 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 45 treesize of output 35 [2018-02-04 17:46:39,638 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 65 [2018-02-04 17:46:39,645 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:39,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 69 [2018-02-04 17:46:39,654 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:39,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-02-04 17:46:39,658 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,659 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 51 treesize of output 41 [2018-02-04 17:46:39,660 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:39,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-02-04 17:46:39,663 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 59 [2018-02-04 17:46:39,672 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:39,674 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 55 treesize of output 45 [2018-02-04 17:46:39,674 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:39,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 73 [2018-02-04 17:46:39,683 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,064 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 79 [2018-02-04 17:46:40,076 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 3 xjuncts. [2018-02-04 17:46:40,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,078 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 83 [2018-02-04 17:46:40,087 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,092 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 85 [2018-02-04 17:46:40,099 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,102 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-02-04 17:46:40,102 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:40,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,105 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2018-02-04 17:46:40,105 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:40,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,108 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 79 [2018-02-04 17:46:40,117 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,119 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 83 [2018-02-04 17:46:40,129 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,134 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 93 [2018-02-04 17:46:40,146 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 3 xjuncts. [2018-02-04 17:46:40,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,151 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 89 [2018-02-04 17:46:40,162 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 3 xjuncts. [2018-02-04 17:46:40,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,165 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 71 [2018-02-04 17:46:40,174 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,178 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 89 [2018-02-04 17:46:40,188 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,190 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-02-04 17:46:40,191 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:40,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,194 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 97 [2018-02-04 17:46:40,206 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 3 xjuncts. [2018-02-04 17:46:40,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,209 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 79 [2018-02-04 17:46:40,218 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-02-04 17:46:40,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:40,221 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:40,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 87 [2018-02-04 17:46:40,234 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 3 xjuncts. [2018-02-04 17:46:41,113 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: 21 dim-0 vars, and 21 xjuncts. [2018-02-04 17:46:41,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:41,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:41,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:41,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:41,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:41,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 213 [2018-02-04 17:46:41,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:41,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:41,749 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-04 17:46:41,750 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:41,774 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 63 treesize of output 47 [2018-02-04 17:46:41,774 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:41,787 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 16 treesize of output 3 [2018-02-04 17:46:41,788 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:41,802 INFO L267 ElimStorePlain]: Start of recursive call 55: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:46:42,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-2 vars, End of recursive call: 78 dim-0 vars, and 27 xjuncts. [2018-02-04 17:46:42,459 INFO L202 ElimStorePlain]: Needed 58 recursive calls to eliminate 18 variables, input treesize:1343, output treesize:2822 [2018-02-04 17:46:43,031 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 961 DAG size of output 207 [2018-02-04 17:46:43,686 WARN L143 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 201 [2018-02-04 17:46:44,379 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 422 DAG size of output 76 [2018-02-04 17:46:44,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 97 [2018-02-04 17:46:44,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,390 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:44,404 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 69 [2018-02-04 17:46:44,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-02-04 17:46:44,427 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 11 treesize of output 1 [2018-02-04 17:46:44,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:44,435 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-02-04 17:46:44,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:44,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:44,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2018-02-04 17:46:44,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,474 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:46:44,481 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 33 [2018-02-04 17:46:44,481 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:44,499 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 11 treesize of output 1 [2018-02-04 17:46:44,499 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:46:44,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:46:44,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-02-04 17:46:44,516 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:44,525 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:46:44,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 17:46:44,541 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:205, output treesize:57 [2018-02-04 17:46:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:46:44,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:46:44,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 17:46:44,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:46:44,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:46:44,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1206, Unknown=24, NotChecked=0, Total=1332 [2018-02-04 17:46:44,974 INFO L87 Difference]: Start difference. First operand 216 states and 229 transitions. Second operand 37 states. [2018-02-04 17:46:48,282 WARN L146 SmtUtils]: Spent 875ms on a formula simplification. DAG size of input: 155 DAG size of output 153 [2018-02-04 17:46:48,809 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 114 DAG size of output 110 [2018-02-04 17:46:49,102 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 116 DAG size of output 112 [2018-02-04 17:46:49,387 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 116 DAG size of output 116 [2018-02-04 17:46:49,696 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 123 DAG size of output 114 [2018-02-04 17:46:49,988 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 123 DAG size of output 121 [2018-02-04 17:46:50,545 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 125 DAG size of output 121 [2018-02-04 17:46:53,679 WARN L146 SmtUtils]: Spent 2864ms on a formula simplification. DAG size of input: 276 DAG size of output 263 [2018-02-04 17:46:54,199 WARN L146 SmtUtils]: Spent 323ms on a formula simplification. DAG size of input: 226 DAG size of output 222 [2018-02-04 17:46:54,723 WARN L146 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 228 DAG size of output 224 [2018-02-04 17:46:55,261 WARN L146 SmtUtils]: Spent 388ms on a formula simplification. DAG size of input: 237 DAG size of output 226 [2018-02-04 17:46:56,361 WARN L146 SmtUtils]: Spent 626ms on a formula simplification. DAG size of input: 399 DAG size of output 381 [2018-02-04 17:46:57,129 WARN L146 SmtUtils]: Spent 543ms on a formula simplification. DAG size of input: 399 DAG size of output 381 [2018-02-04 17:46:57,640 WARN L146 SmtUtils]: Spent 356ms on a formula simplification. DAG size of input: 240 DAG size of output 225 [2018-02-04 17:46:58,309 WARN L146 SmtUtils]: Spent 483ms on a formula simplification. DAG size of input: 416 DAG size of output 232 [2018-02-04 17:46:59,163 WARN L146 SmtUtils]: Spent 631ms on a formula simplification. DAG size of input: 424 DAG size of output 233 [2018-02-04 17:46:59,805 WARN L146 SmtUtils]: Spent 404ms on a formula simplification. DAG size of input: 288 DAG size of output 272 [2018-02-04 17:47:00,428 WARN L146 SmtUtils]: Spent 417ms on a formula simplification. DAG size of input: 302 DAG size of output 275 [2018-02-04 17:47:01,029 WARN L146 SmtUtils]: Spent 419ms on a formula simplification. DAG size of input: 302 DAG size of output 275 [2018-02-04 17:47:02,906 WARN L146 SmtUtils]: Spent 561ms on a formula simplification. DAG size of input: 240 DAG size of output 225 [2018-02-04 17:47:04,320 WARN L146 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 393 DAG size of output 226 [2018-02-04 17:47:05,229 WARN L146 SmtUtils]: Spent 589ms on a formula simplification. DAG size of input: 415 DAG size of output 230 [2018-02-04 17:47:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:47:07,684 INFO L93 Difference]: Finished difference Result 333 states and 360 transitions. [2018-02-04 17:47:07,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:47:07,685 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 77 [2018-02-04 17:47:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:47:07,686 INFO L225 Difference]: With dead ends: 333 [2018-02-04 17:47:07,686 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 17:47:07,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=462, Invalid=5126, Unknown=112, NotChecked=0, Total=5700 [2018-02-04 17:47:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 17:47:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 284. [2018-02-04 17:47:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-04 17:47:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 310 transitions. [2018-02-04 17:47:07,694 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 310 transitions. Word has length 77 [2018-02-04 17:47:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:47:07,694 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 310 transitions. [2018-02-04 17:47:07,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:47:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 310 transitions. [2018-02-04 17:47:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 17:47:07,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:47:07,695 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:47:07,695 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 17:47:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash 593824278, now seen corresponding path program 1 times [2018-02-04 17:47:07,695 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:47:07,696 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:47:07,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:07,696 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:47:07,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:47:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:47:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:47:07,768 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:47:07,788 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 17:47:07,789 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 17:47:07,790 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 17:47:07,790 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 17:47:07,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:47:07 BoogieIcfgContainer [2018-02-04 17:47:07,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:47:07,803 INFO L168 Benchmark]: Toolchain (without parser) took 85781.13 ms. Allocated memory was 403.7 MB in the beginning and 965.7 MB in the end (delta: 562.0 MB). Free memory was 360.2 MB in the beginning and 479.7 MB in the end (delta: -119.5 MB). Peak memory consumption was 442.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:47:07,804 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:47:07,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.28 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 348.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:47:07,804 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 ms. Allocated memory is still 403.7 MB. Free memory was 348.1 MB in the beginning and 346.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:47:07,805 INFO L168 Benchmark]: RCFGBuilder took 440.66 ms. Allocated memory is still 403.7 MB. Free memory was 346.8 MB in the beginning and 300.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:47:07,805 INFO L168 Benchmark]: TraceAbstraction took 85135.36 ms. Allocated memory was 403.7 MB in the beginning and 965.7 MB in the end (delta: 562.0 MB). Free memory was 299.0 MB in the beginning and 479.7 MB in the end (delta: -180.8 MB). Peak memory consumption was 381.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:47:07,806 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.10 ms. Allocated memory is still 403.7 MB. Free memory is still 366.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.28 ms. Allocated memory is still 403.7 MB. Free memory was 360.2 MB in the beginning and 348.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.90 ms. Allocated memory is still 403.7 MB. Free memory was 348.1 MB in the beginning and 346.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 440.66 ms. Allocated memory is still 403.7 MB. Free memory was 346.8 MB in the beginning and 300.3 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 85135.36 ms. Allocated memory was 403.7 MB in the beginning and 965.7 MB in the end (delta: 562.0 MB). Free memory was 299.0 MB in the beginning and 479.7 MB in the end (delta: -180.8 MB). Peak memory consumption was 381.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: IVAL [\old(gl_list)=null, \old(gl_list)=null, gl_list={29:17}] [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={22:0}] [L721] CALL gl_read() VAL [gl_list={22:0}] [L672] CALL gl_insert(__VERIFIER_nondet_int()) VAL [\old(value)=0, gl_list={22:0}] [L663] EXPR, FCALL malloc(sizeof *node) VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, value=0] [L663] struct node *node = malloc(sizeof *node); VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L664] COND FALSE !(!node) VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L666] FCALL node->value = value VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L667] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={22:0}, head={22:0}, new={20:4}] [L643] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={22:0}, new={20:4}, new={20:4}] [L643] CALL __list_add(new, head, head->next) VAL [gl_list={22:0}, new={20:4}, next={22:0}, prev={22:0}] [L631] FCALL next->prev = new VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L632] FCALL new->next = next VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L633] FCALL new->prev = prev VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L634] RET, FCALL prev->next = new VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L643] __list_add(new, head, head->next) VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={22:0}, new={20:4}, new={20:4}] [L667] FCALL list_add(&node->linkage, &gl_list) VAL [__VERIFIER_nondet_int()=0, gl_list={22:0}] [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() VAL [gl_list={22:0}] [L722] CALL gl_sort() VAL [gl_list={22:0}] [L709] CALL list_empty(&gl_list) VAL [gl_list={22:0}, head={22:0}] [L625] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={20:4}] [L625] RET return head->next == head; [L709] list_empty(&gl_list) VAL [gl_list={22:0}, list_empty(&gl_list)=0] [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; VAL [dst={18:0}, gl_list={22:0}] [L712] struct list_head *max_pos; VAL [dst={18:0}, gl_list={22:0}] [L713] CALL gl_seek_max() VAL [gl_list={22:0}] [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; VAL [gl_list={22:0}, pos={0:0}] [L692] CALL list_empty(&gl_list) VAL [gl_list={22:0}, head={22:0}] [L625] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={20:4}] [L625] RET return head->next == head; [L692] list_empty(&gl_list) VAL [gl_list={22:0}, list_empty(&gl_list)=0, pos={0:0}] [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next VAL [gl_list={22:0}, gl_list.next={20:4}, pos={0:0}] [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) VAL [gl_list={22:0}, head={20:4}] [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [entry={20:0}, gl_list={22:0}, head={20:4}, head={20:4}] [L686] EXPR, FCALL entry->value VAL [entry={20:0}, entry->value=0, gl_list={22:0}, head={20:4}, head={20:4}] [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) VAL [gl_list={22:0}, pos={20:4}, val_from_node(max_pos)=0] [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next VAL [(max_pos)->next={22:0}, gl_list={22:0}, max=0, pos={20:4}] [L698] pos = (max_pos)->next [L698] COND TRUE pos != (max_pos) VAL [gl_list={22:0}, max=0, pos={22:0}, pos={20:4}] [L699] CALL val_from_node(pos) VAL [gl_list={22:0}, head={22:0}] [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [entry={22:-4}, gl_list={22:0}, head={22:0}, head={22:0}] [L686] FCALL entry->value VAL [entry={22:-4}, gl_list={22:0}, head={22:0}, head={22:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 188 locations, 63 error locations. UNSAFE Result, 85.0s OverallTime, 31 OverallIterations, 2 TraceHistogramMax, 49.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3943 SDtfs, 6430 SDslu, 14195 SDs, 0 SdLazy, 25172 SolverSat, 1383 SolverUnsat, 205 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 489 SyntacticMatches, 13 SemanticMatches, 550 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 27.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 711 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 33.8s InterpolantComputationTime, 1992 NumberOfCodeBlocks, 1992 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1234 ConstructedInterpolants, 287 QuantifiedInterpolants, 3597137 SizeOfPredicates, 242 NumberOfNonLiveVariables, 3625 ConjunctsInSsa, 704 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 36/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-47-07-812.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-47-07-812.csv Received shutdown request...