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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:21:08,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:21:08,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:21:08,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:21:08,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:21:08,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:21:08,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:21:08,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:21:08,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:21:08,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:21:08,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:21:08,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:21:08,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:21:08,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:21:08,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:21:08,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:21:08,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:21:08,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:21:08,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:21:08,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:21:08,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:21:08,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:21:08,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:21:08,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:21:08,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:21:08,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:21:08,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:21:08,053 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:21:08,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:21:08,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:21:08,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:21:08,054 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:21:08,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:21:08,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:21:08,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:21:08,064 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:21:08,064 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:21:08,064 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:21:08,064 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:21:08,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:21:08,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:21:08,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:21:08,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:21:08,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:21:08,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:21:08,065 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:21:08,066 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:21:08,066 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:21:08,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:21:08,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:21:08,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:21:08,066 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:21:08,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:21:08,066 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:21:08,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:21:08,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:21:08,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:21:08,067 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:21:08,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:21:08,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:21:08,068 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:21:08,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:21:08,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:21:08,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:21:08,069 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:21:08,069 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:21:08,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:21:08,111 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:21:08,114 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:21:08,115 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:21:08,116 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:21:08,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:21:08,298 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:21:08,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:21:08,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:21:08,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:21:08,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:21:08,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245a4720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08, skipping insertion in model container [2018-01-30 00:21:08,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,323 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:21:08,369 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:21:08,504 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:21:08,536 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:21:08,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08 WrapperNode [2018-01-30 00:21:08,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:21:08,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:21:08,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:21:08,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:21:08,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... [2018-01-30 00:21:08,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:21:08,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:21:08,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:21:08,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:21:08,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (1/1) ... No working directory specified, using /storage/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-01-30 00:21:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:21:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:21:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-30 00:21:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect [2018-01-30 00:21:08,668 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-30 00:21:08,669 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-01-30 00:21:08,669 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-01-30 00:21:08,669 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-01-30 00:21:08,669 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-01-30 00:21:08,669 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-01-30 00:21:08,669 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-01-30 00:21:08,670 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-01-30 00:21:08,670 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-01-30 00:21:08,670 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-01-30 00:21:08,670 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:21:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:21:08,670 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:21:08,671 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:21:08,671 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:21:08,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:21:08,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:21:08,671 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:21:08,671 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:21:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:21:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-30 00:21:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:21:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-30 00:21:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure inspect [2018-01-30 00:21:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-30 00:21:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-01-30 00:21:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-01-30 00:21:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-01-30 00:21:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-01-30 00:21:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-01-30 00:21:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-01-30 00:21:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-01-30 00:21:08,674 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-01-30 00:21:08,674 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-01-30 00:21:08,674 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:21:08,674 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:21:08,674 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:21:09,455 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:21:09,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:21:09 BoogieIcfgContainer [2018-01-30 00:21:09,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:21:09,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:21:09,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:21:09,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:21:09,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:21:08" (1/3) ... [2018-01-30 00:21:09,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469cef92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:21:09, skipping insertion in model container [2018-01-30 00:21:09,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:21:08" (2/3) ... [2018-01-30 00:21:09,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469cef92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:21:09, skipping insertion in model container [2018-01-30 00:21:09,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:21:09" (3/3) ... [2018-01-30 00:21:09,501 INFO L107 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:21:09,509 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:21:09,517 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-01-30 00:21:09,572 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:21:09,573 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:21:09,573 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:21:09,573 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:21:09,573 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:21:09,573 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:21:09,573 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:21:09,573 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:21:09,574 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:21:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states. [2018-01-30 00:21:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:21:09,605 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:09,606 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:21:09,606 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash 662658123, now seen corresponding path program 1 times [2018-01-30 00:21:09,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:09,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:09,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:09,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:09,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:09,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:09,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:09,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:21:09,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:21:09,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:21:09,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:21:09,898 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 3 states. [2018-01-30 00:21:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:10,123 INFO L93 Difference]: Finished difference Result 627 states and 802 transitions. [2018-01-30 00:21:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:21:10,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:21:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:10,139 INFO L225 Difference]: With dead ends: 627 [2018-01-30 00:21:10,140 INFO L226 Difference]: Without dead ends: 285 [2018-01-30 00:21:10,146 INFO L553 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-01-30 00:21:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-30 00:21:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2018-01-30 00:21:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-30 00:21:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 293 transitions. [2018-01-30 00:21:10,198 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 293 transitions. Word has length 5 [2018-01-30 00:21:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:10,198 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 293 transitions. [2018-01-30 00:21:10,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:21:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 293 transitions. [2018-01-30 00:21:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 00:21:10,199 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:10,199 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 00:21:10,199 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash 662658124, now seen corresponding path program 1 times [2018-01-30 00:21:10,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:10,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:10,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:10,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:10,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:10,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:10,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:10,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:21:10,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:21:10,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:21:10,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:21:10,262 INFO L87 Difference]: Start difference. First operand 284 states and 293 transitions. Second operand 3 states. [2018-01-30 00:21:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:10,429 INFO L93 Difference]: Finished difference Result 289 states and 299 transitions. [2018-01-30 00:21:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:21:10,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-30 00:21:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:10,436 INFO L225 Difference]: With dead ends: 289 [2018-01-30 00:21:10,436 INFO L226 Difference]: Without dead ends: 287 [2018-01-30 00:21:10,438 INFO L553 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-01-30 00:21:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-30 00:21:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 282. [2018-01-30 00:21:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-30 00:21:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 291 transitions. [2018-01-30 00:21:10,464 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 291 transitions. Word has length 5 [2018-01-30 00:21:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:10,464 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 291 transitions. [2018-01-30 00:21:10,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:21:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 291 transitions. [2018-01-30 00:21:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:21:10,465 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:10,466 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:10,466 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash -157460622, now seen corresponding path program 1 times [2018-01-30 00:21:10,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:10,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:10,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:10,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:10,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:10,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:10,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:10,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:21:10,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:21:10,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:21:10,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:21:10,535 INFO L87 Difference]: Start difference. First operand 282 states and 291 transitions. Second operand 4 states. [2018-01-30 00:21:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:10,692 INFO L93 Difference]: Finished difference Result 282 states and 291 transitions. [2018-01-30 00:21:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:21:10,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-30 00:21:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:10,695 INFO L225 Difference]: With dead ends: 282 [2018-01-30 00:21:10,695 INFO L226 Difference]: Without dead ends: 279 [2018-01-30 00:21:10,696 INFO L553 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-01-30 00:21:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-01-30 00:21:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-01-30 00:21:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-01-30 00:21:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 288 transitions. [2018-01-30 00:21:10,713 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 288 transitions. Word has length 18 [2018-01-30 00:21:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:10,713 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 288 transitions. [2018-01-30 00:21:10,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:21:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 288 transitions. [2018-01-30 00:21:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:21:10,714 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:10,714 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:10,715 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:10,715 INFO L82 PathProgramCache]: Analyzing trace with hash -157460621, now seen corresponding path program 1 times [2018-01-30 00:21:10,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:10,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:10,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:10,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:10,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:10,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:10,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:10,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:21:10,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:21:10,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:21:10,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:21:10,823 INFO L87 Difference]: Start difference. First operand 279 states and 288 transitions. Second operand 4 states. [2018-01-30 00:21:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:11,020 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2018-01-30 00:21:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:21:11,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-30 00:21:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:11,022 INFO L225 Difference]: With dead ends: 279 [2018-01-30 00:21:11,022 INFO L226 Difference]: Without dead ends: 276 [2018-01-30 00:21:11,023 INFO L553 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-01-30 00:21:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-01-30 00:21:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-01-30 00:21:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-01-30 00:21:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 285 transitions. [2018-01-30 00:21:11,037 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 285 transitions. Word has length 18 [2018-01-30 00:21:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:11,037 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 285 transitions. [2018-01-30 00:21:11,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:21:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 285 transitions. [2018-01-30 00:21:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:21:11,038 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:11,038 INFO L350 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-01-30 00:21:11,038 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash 831673222, now seen corresponding path program 1 times [2018-01-30 00:21:11,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:11,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:11,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:11,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:11,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:11,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:11,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:11,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:21:11,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:21:11,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:21:11,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:21:11,160 INFO L87 Difference]: Start difference. First operand 276 states and 285 transitions. Second operand 7 states. [2018-01-30 00:21:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:11,458 INFO L93 Difference]: Finished difference Result 286 states and 294 transitions. [2018-01-30 00:21:11,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:21:11,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-30 00:21:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:11,460 INFO L225 Difference]: With dead ends: 286 [2018-01-30 00:21:11,460 INFO L226 Difference]: Without dead ends: 285 [2018-01-30 00:21:11,461 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:21:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-30 00:21:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2018-01-30 00:21:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-30 00:21:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 293 transitions. [2018-01-30 00:21:11,473 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 293 transitions. Word has length 22 [2018-01-30 00:21:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:11,474 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 293 transitions. [2018-01-30 00:21:11,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:21:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 293 transitions. [2018-01-30 00:21:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:21:11,475 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:11,475 INFO L350 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-01-30 00:21:11,475 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash 831673223, now seen corresponding path program 1 times [2018-01-30 00:21:11,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:11,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:11,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:11,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:11,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:11,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:11,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:11,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:21:11,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:21:11,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:21:11,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:21:11,577 INFO L87 Difference]: Start difference. First operand 283 states and 293 transitions. Second operand 7 states. [2018-01-30 00:21:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:11,972 INFO L93 Difference]: Finished difference Result 284 states and 293 transitions. [2018-01-30 00:21:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:21:11,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-30 00:21:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:11,974 INFO L225 Difference]: With dead ends: 284 [2018-01-30 00:21:11,974 INFO L226 Difference]: Without dead ends: 280 [2018-01-30 00:21:11,975 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:21:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-01-30 00:21:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-01-30 00:21:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-30 00:21:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 288 transitions. [2018-01-30 00:21:11,988 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 288 transitions. Word has length 22 [2018-01-30 00:21:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:11,989 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 288 transitions. [2018-01-30 00:21:11,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:21:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 288 transitions. [2018-01-30 00:21:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:21:11,990 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:11,990 INFO L350 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] [2018-01-30 00:21:11,990 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:11,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1539411259, now seen corresponding path program 1 times [2018-01-30 00:21:11,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:11,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:11,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:11,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:11,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:12,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:12,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:12,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:21:12,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:21:12,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:21:12,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:21:12,154 INFO L87 Difference]: Start difference. First operand 280 states and 288 transitions. Second operand 10 states. [2018-01-30 00:21:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:12,609 INFO L93 Difference]: Finished difference Result 311 states and 321 transitions. [2018-01-30 00:21:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:21:12,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-30 00:21:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:12,611 INFO L225 Difference]: With dead ends: 311 [2018-01-30 00:21:12,612 INFO L226 Difference]: Without dead ends: 310 [2018-01-30 00:21:12,612 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:21:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-01-30 00:21:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2018-01-30 00:21:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-30 00:21:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 319 transitions. [2018-01-30 00:21:12,628 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 319 transitions. Word has length 27 [2018-01-30 00:21:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:12,629 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 319 transitions. [2018-01-30 00:21:12,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:21:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 319 transitions. [2018-01-30 00:21:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:21:12,630 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:12,630 INFO L350 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] [2018-01-30 00:21:12,630 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1539411258, now seen corresponding path program 1 times [2018-01-30 00:21:12,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:12,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:12,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:12,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:12,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:12,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:12,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:12,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:21:12,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:21:12,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:21:12,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:21:12,943 INFO L87 Difference]: Start difference. First operand 302 states and 319 transitions. Second operand 11 states. [2018-01-30 00:21:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:13,884 INFO L93 Difference]: Finished difference Result 571 states and 587 transitions. [2018-01-30 00:21:13,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:21:13,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-30 00:21:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:13,887 INFO L225 Difference]: With dead ends: 571 [2018-01-30 00:21:13,887 INFO L226 Difference]: Without dead ends: 570 [2018-01-30 00:21:13,888 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:21:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-01-30 00:21:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 482. [2018-01-30 00:21:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-01-30 00:21:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 555 transitions. [2018-01-30 00:21:13,911 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 555 transitions. Word has length 27 [2018-01-30 00:21:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:13,911 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 555 transitions. [2018-01-30 00:21:13,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:21:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 555 transitions. [2018-01-30 00:21:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:21:13,912 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:13,912 INFO L350 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] [2018-01-30 00:21:13,912 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash -477108797, now seen corresponding path program 1 times [2018-01-30 00:21:13,913 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:13,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:13,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:13,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:13,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:13,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:14,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:14,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:21:14,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:21:14,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:21:14,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:21:14,062 INFO L87 Difference]: Start difference. First operand 482 states and 555 transitions. Second operand 7 states. [2018-01-30 00:21:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:14,511 INFO L93 Difference]: Finished difference Result 498 states and 571 transitions. [2018-01-30 00:21:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:21:14,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-30 00:21:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:14,547 INFO L225 Difference]: With dead ends: 498 [2018-01-30 00:21:14,547 INFO L226 Difference]: Without dead ends: 496 [2018-01-30 00:21:14,547 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:21:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-01-30 00:21:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 319. [2018-01-30 00:21:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-30 00:21:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 336 transitions. [2018-01-30 00:21:14,565 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 336 transitions. Word has length 28 [2018-01-30 00:21:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:14,565 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 336 transitions. [2018-01-30 00:21:14,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:21:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 336 transitions. [2018-01-30 00:21:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:21:14,566 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:14,566 INFO L350 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] [2018-01-30 00:21:14,566 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash -477108796, now seen corresponding path program 1 times [2018-01-30 00:21:14,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:14,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:14,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:14,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:14,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:14,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:14,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:14,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:21:14,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:21:14,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:21:14,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:21:14,717 INFO L87 Difference]: Start difference. First operand 319 states and 336 transitions. Second operand 8 states. [2018-01-30 00:21:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:15,139 INFO L93 Difference]: Finished difference Result 325 states and 336 transitions. [2018-01-30 00:21:15,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:21:15,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-30 00:21:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:15,145 INFO L225 Difference]: With dead ends: 325 [2018-01-30 00:21:15,145 INFO L226 Difference]: Without dead ends: 323 [2018-01-30 00:21:15,145 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:21:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-01-30 00:21:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-01-30 00:21:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-30 00:21:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 332 transitions. [2018-01-30 00:21:15,161 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 332 transitions. Word has length 28 [2018-01-30 00:21:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:15,161 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 332 transitions. [2018-01-30 00:21:15,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:21:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 332 transitions. [2018-01-30 00:21:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:21:15,162 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:15,163 INFO L350 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] [2018-01-30 00:21:15,163 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1059946086, now seen corresponding path program 1 times [2018-01-30 00:21:15,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:15,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:15,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:15,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:15,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:15,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:15,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:15,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:21:15,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:21:15,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:21:15,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:21:15,221 INFO L87 Difference]: Start difference. First operand 319 states and 332 transitions. Second operand 5 states. [2018-01-30 00:21:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:15,464 INFO L93 Difference]: Finished difference Result 319 states and 332 transitions. [2018-01-30 00:21:15,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:21:15,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-30 00:21:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:15,466 INFO L225 Difference]: With dead ends: 319 [2018-01-30 00:21:15,466 INFO L226 Difference]: Without dead ends: 318 [2018-01-30 00:21:15,467 INFO L553 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-01-30 00:21:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-01-30 00:21:15,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-01-30 00:21:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-01-30 00:21:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 329 transitions. [2018-01-30 00:21:15,488 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 329 transitions. Word has length 30 [2018-01-30 00:21:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:15,488 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 329 transitions. [2018-01-30 00:21:15,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:21:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 329 transitions. [2018-01-30 00:21:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:21:15,489 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:15,489 INFO L350 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] [2018-01-30 00:21:15,489 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1059946087, now seen corresponding path program 1 times [2018-01-30 00:21:15,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:15,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:15,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:15,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:15,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:15,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:15,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:15,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:21:15,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:21:15,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:21:15,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:21:15,614 INFO L87 Difference]: Start difference. First operand 318 states and 329 transitions. Second operand 8 states. [2018-01-30 00:21:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:15,918 INFO L93 Difference]: Finished difference Result 321 states and 329 transitions. [2018-01-30 00:21:15,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:21:15,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-01-30 00:21:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:15,920 INFO L225 Difference]: With dead ends: 321 [2018-01-30 00:21:15,920 INFO L226 Difference]: Without dead ends: 320 [2018-01-30 00:21:15,921 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:21:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-01-30 00:21:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2018-01-30 00:21:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-01-30 00:21:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 327 transitions. [2018-01-30 00:21:15,938 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 327 transitions. Word has length 30 [2018-01-30 00:21:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:15,938 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 327 transitions. [2018-01-30 00:21:15,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:21:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 327 transitions. [2018-01-30 00:21:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:21:15,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:15,940 INFO L350 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] [2018-01-30 00:21:15,940 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1490281982, now seen corresponding path program 1 times [2018-01-30 00:21:15,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:15,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:15,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:15,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:15,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:15,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:16,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:16,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:21:16,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:21:16,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:21:16,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:21:16,033 INFO L87 Difference]: Start difference. First operand 318 states and 327 transitions. Second operand 7 states. [2018-01-30 00:21:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:16,313 INFO L93 Difference]: Finished difference Result 318 states and 327 transitions. [2018-01-30 00:21:16,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:21:16,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-01-30 00:21:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:16,315 INFO L225 Difference]: With dead ends: 318 [2018-01-30 00:21:16,315 INFO L226 Difference]: Without dead ends: 313 [2018-01-30 00:21:16,315 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:21:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-30 00:21:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-01-30 00:21:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-01-30 00:21:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 322 transitions. [2018-01-30 00:21:16,331 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 322 transitions. Word has length 54 [2018-01-30 00:21:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:16,332 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 322 transitions. [2018-01-30 00:21:16,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:21:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 322 transitions. [2018-01-30 00:21:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:21:16,333 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:16,333 INFO L350 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] [2018-01-30 00:21:16,334 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1490281983, now seen corresponding path program 1 times [2018-01-30 00:21:16,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:16,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:16,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:16,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:16,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:16,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:16,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:16,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:21:16,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:21:16,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:21:16,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:21:16,553 INFO L87 Difference]: Start difference. First operand 313 states and 322 transitions. Second operand 11 states. [2018-01-30 00:21:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:16,981 INFO L93 Difference]: Finished difference Result 313 states and 322 transitions. [2018-01-30 00:21:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:21:16,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-01-30 00:21:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:16,983 INFO L225 Difference]: With dead ends: 313 [2018-01-30 00:21:16,983 INFO L226 Difference]: Without dead ends: 312 [2018-01-30 00:21:16,983 INFO L553 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-01-30 00:21:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-30 00:21:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-01-30 00:21:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-01-30 00:21:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 321 transitions. [2018-01-30 00:21:16,999 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 321 transitions. Word has length 54 [2018-01-30 00:21:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:17,000 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 321 transitions. [2018-01-30 00:21:17,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:21:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 321 transitions. [2018-01-30 00:21:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:21:17,001 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:17,001 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:17,001 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:17,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1268603462, now seen corresponding path program 1 times [2018-01-30 00:21:17,002 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:17,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:17,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:17,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:17,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:17,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:17,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:17,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:17,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-30 00:21:17,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:21:17,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:21:17,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:21:17,710 INFO L87 Difference]: Start difference. First operand 312 states and 321 transitions. Second operand 23 states. [2018-01-30 00:21:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:20,951 INFO L93 Difference]: Finished difference Result 354 states and 370 transitions. [2018-01-30 00:21:20,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-30 00:21:20,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-01-30 00:21:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:20,952 INFO L225 Difference]: With dead ends: 354 [2018-01-30 00:21:20,952 INFO L226 Difference]: Without dead ends: 352 [2018-01-30 00:21:20,953 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=338, Invalid=1824, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 00:21:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-01-30 00:21:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 310. [2018-01-30 00:21:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-01-30 00:21:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 319 transitions. [2018-01-30 00:21:20,973 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 319 transitions. Word has length 59 [2018-01-30 00:21:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:20,973 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 319 transitions. [2018-01-30 00:21:20,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:21:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 319 transitions. [2018-01-30 00:21:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:21:20,974 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:20,974 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:20,975 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:20,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2136169383, now seen corresponding path program 1 times [2018-01-30 00:21:20,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:20,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:20,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:20,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:20,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:21,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:21,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:21:21,550 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:21:21,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:21,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:21:21,685 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-01-30 00:21:21,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:21,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:21,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 00:21:21,744 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-01-30 00:21:21,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:21,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:21,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-01-30 00:21:21,923 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-01-30 00:21:21,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:21,929 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-01-30 00:21:21,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-01-30 00:21:22,341 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-01-30 00:21:22,343 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-01-30 00:21:22,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,361 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-01-30 00:21:22,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-30 00:21:22,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-01-30 00:21:22,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-30 00:21:22,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-01-30 00:21:22,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 58 [2018-01-30 00:21:22,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:22,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 69 [2018-01-30 00:21:22,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,683 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-01-30 00:21:22,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-01-30 00:21:22,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:22,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:22,732 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-01-30 00:21:22,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,740 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-01-30 00:21:22,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-01-30 00:21:22,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:22,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:22,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:22,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-01-30 00:21:22,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,818 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-01-30 00:21:22,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:77 [2018-01-30 00:21:22,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2018-01-30 00:21:22,961 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-01-30 00:21:22,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:22,990 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-01-30 00:21:22,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:77 [2018-01-30 00:21:23,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-01-30 00:21:23,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:23,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 19 treesize of output 8 [2018-01-30 00:21:23,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:23,173 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-01-30 00:21:23,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:23,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:23,182 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-01-30 00:21:23,182 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:81, output treesize:28 [2018-01-30 00:21:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:23,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:21:23,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2018-01-30 00:21:23,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-30 00:21:23,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-30 00:21:23,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2343, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 00:21:23,345 INFO L87 Difference]: Start difference. First operand 310 states and 319 transitions. Second operand 51 states. [2018-01-30 00:21:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:30,463 INFO L93 Difference]: Finished difference Result 526 states and 548 transitions. [2018-01-30 00:21:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-30 00:21:30,463 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 62 [2018-01-30 00:21:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:30,466 INFO L225 Difference]: With dead ends: 526 [2018-01-30 00:21:30,466 INFO L226 Difference]: Without dead ends: 525 [2018-01-30 00:21:30,468 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1097, Invalid=7833, Unknown=0, NotChecked=0, Total=8930 [2018-01-30 00:21:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-01-30 00:21:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 439. [2018-01-30 00:21:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-01-30 00:21:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 479 transitions. [2018-01-30 00:21:30,496 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 479 transitions. Word has length 62 [2018-01-30 00:21:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:30,496 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 479 transitions. [2018-01-30 00:21:30,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-30 00:21:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 479 transitions. [2018-01-30 00:21:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-30 00:21:30,497 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:30,497 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:30,497 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2136169382, now seen corresponding path program 1 times [2018-01-30 00:21:30,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:30,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:30,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:30,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:30,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:30,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:31,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:21:31,121 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:21:31,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:31,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:21:31,175 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-01-30 00:21:31,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 00:21:31,208 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-01-30 00:21:31,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-01-30 00:21:31,235 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-01-30 00:21:31,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-30 00:21:31,313 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-01-30 00:21:31,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,316 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-01-30 00:21:31,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-01-30 00:21:31,560 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-01-30 00:21:31,562 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-01-30 00:21:31,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,574 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-01-30 00:21:31,576 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-01-30 00:21:31,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,585 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-01-30 00:21:31,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-01-30 00:21:31,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 49 [2018-01-30 00:21:31,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-30 00:21:31,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2018-01-30 00:21:31,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-01-30 00:21:31,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:31,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-01-30 00:21:31,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 127 [2018-01-30 00:21:31,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:31,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:31,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:31,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 150 [2018-01-30 00:21:31,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:21:31,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:21:32,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 146 [2018-01-30 00:21:32,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 115 [2018-01-30 00:21:32,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 135 [2018-01-30 00:21:32,074 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,159 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,173 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:153, output treesize:137 [2018-01-30 00:21:32,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,242 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-01-30 00:21:32,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:136 [2018-01-30 00:21:32,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-01-30 00:21:32,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,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, 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-01-30 00:21:32,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:147, output treesize:132 [2018-01-30 00:21:32,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 134 [2018-01-30 00:21:32,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2018-01-30 00:21:32,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 124 [2018-01-30 00:21:32,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-30 00:21:32,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-30 00:21:32,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 106 [2018-01-30 00:21:32,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 80 [2018-01-30 00:21:32,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 153 [2018-01-30 00:21:32,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 159 [2018-01-30 00:21:32,828 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-30 00:21:32,916 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 132 treesize of output 120 [2018-01-30 00:21:32,917 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-30 00:21:32,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 106 [2018-01-30 00:21:32,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:21:32,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 80 [2018-01-30 00:21:32,973 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:32,984 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-30 00:21:33,030 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:162, output treesize:291 [2018-01-30 00:21:33,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-01-30 00:21:33,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2018-01-30 00:21:33,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 29 [2018-01-30 00:21:33,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-01-30 00:21:33,458 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 29 treesize of output 16 [2018-01-30 00:21:33,458 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-30 00:21:33,466 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,471 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-01-30 00:21:33,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2018-01-30 00:21:33,506 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 29 [2018-01-30 00:21:33,587 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,635 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-01-30 00:21:33,751 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 29 treesize of output 16 [2018-01-30 00:21:33,752 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-30 00:21:33,810 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,836 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:21:33,928 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:181, output treesize:12 [2018-01-30 00:21:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:34,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:21:34,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2018-01-30 00:21:34,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-30 00:21:34,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-30 00:21:34,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2375, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 00:21:34,116 INFO L87 Difference]: Start difference. First operand 439 states and 479 transitions. Second operand 51 states. [2018-01-30 00:21:36,149 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 83 DAG size of output 74 [2018-01-30 00:21:36,367 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 114 DAG size of output 78 [2018-01-30 00:21:36,590 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 121 DAG size of output 87 [2018-01-30 00:21:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:41,944 INFO L93 Difference]: Finished difference Result 525 states and 547 transitions. [2018-01-30 00:21:41,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-30 00:21:41,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 62 [2018-01-30 00:21:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:41,949 INFO L225 Difference]: With dead ends: 525 [2018-01-30 00:21:41,949 INFO L226 Difference]: Without dead ends: 524 [2018-01-30 00:21:41,951 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=890, Invalid=6420, Unknown=0, NotChecked=0, Total=7310 [2018-01-30 00:21:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-01-30 00:21:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 408. [2018-01-30 00:21:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-01-30 00:21:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 447 transitions. [2018-01-30 00:21:41,989 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 447 transitions. Word has length 62 [2018-01-30 00:21:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:41,989 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 447 transitions. [2018-01-30 00:21:41,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-30 00:21:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 447 transitions. [2018-01-30 00:21:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-30 00:21:41,990 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:41,991 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:41,991 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash 316393920, now seen corresponding path program 1 times [2018-01-30 00:21:41,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:41,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:41,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:41,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:41,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:42,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:43,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:43,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-01-30 00:21:43,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:21:43,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:21:43,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:21:43,071 INFO L87 Difference]: Start difference. First operand 408 states and 447 transitions. Second operand 29 states. [2018-01-30 00:21:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:47,237 INFO L93 Difference]: Finished difference Result 659 states and 719 transitions. [2018-01-30 00:21:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 00:21:47,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-01-30 00:21:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:47,240 INFO L225 Difference]: With dead ends: 659 [2018-01-30 00:21:47,240 INFO L226 Difference]: Without dead ends: 658 [2018-01-30 00:21:47,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=393, Invalid=2913, Unknown=0, NotChecked=0, Total=3306 [2018-01-30 00:21:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-01-30 00:21:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 567. [2018-01-30 00:21:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-01-30 00:21:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 647 transitions. [2018-01-30 00:21:47,290 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 647 transitions. Word has length 70 [2018-01-30 00:21:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:47,290 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 647 transitions. [2018-01-30 00:21:47,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:21:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 647 transitions. [2018-01-30 00:21:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-30 00:21:47,291 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:47,292 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:47,292 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 316393921, now seen corresponding path program 1 times [2018-01-30 00:21:47,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:47,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:47,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:47,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:47,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:47,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:48,255 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 56 DAG size of output 45 [2018-01-30 00:21:48,402 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 69 DAG size of output 64 [2018-01-30 00:21:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:48,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:48,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-30 00:21:48,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:21:48,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:21:48,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:21:48,990 INFO L87 Difference]: Start difference. First operand 567 states and 647 transitions. Second operand 27 states. [2018-01-30 00:21:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:53,786 INFO L93 Difference]: Finished difference Result 679 states and 740 transitions. [2018-01-30 00:21:53,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:21:53,786 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 70 [2018-01-30 00:21:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:53,789 INFO L225 Difference]: With dead ends: 679 [2018-01-30 00:21:53,789 INFO L226 Difference]: Without dead ends: 676 [2018-01-30 00:21:53,790 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=434, Invalid=2988, Unknown=0, NotChecked=0, Total=3422 [2018-01-30 00:21:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-01-30 00:21:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 567. [2018-01-30 00:21:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-01-30 00:21:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 644 transitions. [2018-01-30 00:21:53,823 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 644 transitions. Word has length 70 [2018-01-30 00:21:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:53,824 INFO L432 AbstractCegarLoop]: Abstraction has 567 states and 644 transitions. [2018-01-30 00:21:53,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:21:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 644 transitions. [2018-01-30 00:21:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 00:21:53,824 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:53,825 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:53,825 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1490026881, now seen corresponding path program 1 times [2018-01-30 00:21:53,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:53,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:53,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:53,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:53,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:53,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:53,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:53,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:21:53,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:21:53,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:21:53,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:21:53,884 INFO L87 Difference]: Start difference. First operand 567 states and 644 transitions. Second operand 4 states. [2018-01-30 00:21:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:21:54,050 INFO L93 Difference]: Finished difference Result 567 states and 644 transitions. [2018-01-30 00:21:54,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:21:54,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-01-30 00:21:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:21:54,052 INFO L225 Difference]: With dead ends: 567 [2018-01-30 00:21:54,052 INFO L226 Difference]: Without dead ends: 561 [2018-01-30 00:21:54,053 INFO L553 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-01-30 00:21:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-01-30 00:21:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2018-01-30 00:21:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-01-30 00:21:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 626 transitions. [2018-01-30 00:21:54,082 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 626 transitions. Word has length 84 [2018-01-30 00:21:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:21:54,083 INFO L432 AbstractCegarLoop]: Abstraction has 561 states and 626 transitions. [2018-01-30 00:21:54,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:21:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 626 transitions. [2018-01-30 00:21:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 00:21:54,083 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:21:54,083 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:21:54,084 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:21:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1490026880, now seen corresponding path program 1 times [2018-01-30 00:21:54,084 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:21:54,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:21:54,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:54,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:21:54,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:21:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:21:54,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:21:54,926 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 75 DAG size of output 66 [2018-01-30 00:21:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:21:55,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:21:55,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-01-30 00:21:55,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-30 00:21:55,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-30 00:21:55,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2018-01-30 00:21:55,567 INFO L87 Difference]: Start difference. First operand 561 states and 626 transitions. Second operand 30 states. [2018-01-30 00:21:56,262 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 65 DAG size of output 52 [2018-01-30 00:21:57,498 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 76 DAG size of output 63 [2018-01-30 00:22:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:22:00,574 INFO L93 Difference]: Finished difference Result 664 states and 719 transitions. [2018-01-30 00:22:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 00:22:00,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2018-01-30 00:22:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:22:00,576 INFO L225 Difference]: With dead ends: 664 [2018-01-30 00:22:00,576 INFO L226 Difference]: Without dead ends: 658 [2018-01-30 00:22:00,577 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=493, Invalid=3667, Unknown=0, NotChecked=0, Total=4160 [2018-01-30 00:22:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-01-30 00:22:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 561. [2018-01-30 00:22:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-01-30 00:22:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 620 transitions. [2018-01-30 00:22:00,617 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 620 transitions. Word has length 84 [2018-01-30 00:22:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:22:00,617 INFO L432 AbstractCegarLoop]: Abstraction has 561 states and 620 transitions. [2018-01-30 00:22:00,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-30 00:22:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 620 transitions. [2018-01-30 00:22:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 00:22:00,618 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:22:00,618 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-30 00:22:00,618 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-30 00:22:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash -293215316, now seen corresponding path program 1 times [2018-01-30 00:22:00,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:22:00,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:22:00,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:00,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:00,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:22:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:00,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:22:01,704 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 26 DAG size of output 24 [2018-01-30 00:22:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:22:03,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:22:03,741 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:22:03,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:22:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:22:03,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:22:03,808 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-01-30 00:22:03,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 00:22:03,857 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-01-30 00:22:03,858 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-01-30 00:22:03,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-30 00:22:03,906 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-01-30 00:22:03,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:03,908 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-01-30 00:22:03,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-30 00:22:03,964 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-01-30 00:22:03,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,971 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-01-30 00:22:03,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:03,973 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-01-30 00:22:03,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:03,978 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-01-30 00:22:05,071 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:05,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:05,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:05,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:146, output treesize:275 [2018-01-30 00:22:05,878 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-01-30 00:22:05,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:05,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:05,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-01-30 00:22:06,968 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-01-30 00:22:06,971 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-01-30 00:22:06,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:06,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:06,985 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-01-30 00:22:06,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:93 [2018-01-30 00:22:07,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:07,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:07,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:07,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:186, output treesize:323 [2018-01-30 00:22:07,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 586 treesize of output 582 [2018-01-30 00:22:07,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 586 [2018-01-30 00:22:07,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:07,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:07,885 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-01-30 00:22:07,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:622, output treesize:618 [2018-01-30 00:22:08,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 870 treesize of output 776 [2018-01-30 00:22:08,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:08,343 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 869 treesize of output 886 [2018-01-30 00:22:08,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:08,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:09,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:09,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:883, output treesize:879 [2018-01-30 00:22:09,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:09,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:09,606 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-01-30 00:22:09,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:11,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:11,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:40183, output treesize:40177 [2018-01-30 00:22:14,745 WARN L143 SmtUtils]: Spent 809ms on a formula simplification that was a NOOP. DAG size: 91 [2018-01-30 00:22:20,857 WARN L146 SmtUtils]: Spent 6090ms on a formula simplification. DAG size of input: 141 DAG size of output 95 [2018-01-30 00:22:20,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:21,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:21,045 INFO L303 Elim1Store]: Index analysis took 187 ms [2018-01-30 00:22:21,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:22:21,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:22,705 INFO L303 Elim1Store]: Index analysis took 404 ms [2018-01-30 00:22:22,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28284 treesize of output 18824 [2018-01-30 00:22:22,740 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-01-30 00:22:22,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:23,616 INFO L303 Elim1Store]: Index analysis took 483 ms [2018-01-30 00:22:23,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18819 treesize of output 7583 [2018-01-30 00:22:26,237 WARN L146 SmtUtils]: Spent 2618ms on a formula simplification. DAG size of input: 113 DAG size of output 77 [2018-01-30 00:22:26,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:26,419 INFO L303 Elim1Store]: Index analysis took 181 ms [2018-01-30 00:22:26,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 5356 treesize of output 5081 [2018-01-30 00:22:26,834 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-30 00:22:28,949 INFO L303 Elim1Store]: Index analysis took 207 ms [2018-01-30 00:22:28,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5064 treesize of output 3155 [2018-01-30 00:22:29,089 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-01-30 00:22:29,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-01-30 00:22:29,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:29,288 INFO L303 Elim1Store]: Index analysis took 192 ms [2018-01-30 00:22:29,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 36 [2018-01-30 00:22:29,294 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-30 00:22:29,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:29,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-01-30 00:22:29,736 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:30,208 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-30 00:22:30,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:30,961 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-01-30 00:22:30,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3152 treesize of output 1980 [2018-01-30 00:22:36,932 WARN L146 SmtUtils]: Spent 5968ms on a formula simplification. DAG size of input: 106 DAG size of output 99 [2018-01-30 00:22:36,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:36,980 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 50 [2018-01-30 00:22:36,981 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:38,256 INFO L303 Elim1Store]: Index analysis took 138 ms [2018-01-30 00:22:38,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1773 treesize of output 1159 [2018-01-30 00:22:39,312 WARN L146 SmtUtils]: Spent 1019ms on a formula simplification. DAG size of input: 131 DAG size of output 69 [2018-01-30 00:22:39,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:39,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:39,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:39,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 594 treesize of output 536 [2018-01-30 00:22:39,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:39,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:39,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:39,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:39,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 515 [2018-01-30 00:22:39,376 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:39,492 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:22:39,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 389 [2018-01-30 00:22:40,489 WARN L143 SmtUtils]: Spent 734ms on a formula simplification that was a NOOP. DAG size: 84 [2018-01-30 00:22:40,492 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-30 00:22:40,492 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-30 00:22:40,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:40,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:40,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:40,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:40,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:40,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:40,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:40,657 INFO L303 Elim1Store]: Index analysis took 163 ms [2018-01-30 00:22:40,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 322 treesize of output 365 [2018-01-30 00:22:40,815 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 16 xjuncts. [2018-01-30 00:22:41,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 244 [2018-01-30 00:22:41,820 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 76 DAG size of output 66 [2018-01-30 00:22:41,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:41,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:41,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:41,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:41,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 229 [2018-01-30 00:22:41,956 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-01-30 00:22:42,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 177 [2018-01-30 00:22:42,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,313 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:22:42,360 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-01-30 00:22:42,372 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 191 [2018-01-30 00:22:42,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,448 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:22:42,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 230 [2018-01-30 00:22:42,485 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-01-30 00:22:42,683 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:22:42,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,752 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:22:42,753 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 138 treesize of output 141 [2018-01-30 00:22:42,792 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 50 treesize of output 74 [2018-01-30 00:22:42,793 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:22:42,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,845 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:22:42,845 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 125 treesize of output 139 [2018-01-30 00:22:42,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,867 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:22:42,878 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:22:42,940 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_53 term size 85 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 00:22:42,944 INFO L168 Benchmark]: Toolchain (without parser) took 94645.60 ms. Allocated memory was 304.1 MB in the beginning and 928.5 MB in the end (delta: 624.4 MB). Free memory was 263.0 MB in the beginning and 641.6 MB in the end (delta: -378.7 MB). Peak memory consumption was 620.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:22:42,945 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.1 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:22:42,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.10 ms. Allocated memory is still 304.1 MB. Free memory was 262.0 MB in the beginning and 248.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:22:42,945 INFO L168 Benchmark]: Boogie Preprocessor took 56.28 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 246.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:22:42,945 INFO L168 Benchmark]: RCFGBuilder took 886.42 ms. Allocated memory was 304.1 MB in the beginning and 326.1 MB in the end (delta: 22.0 MB). Free memory was 246.0 MB in the beginning and 289.2 MB in the end (delta: -43.3 MB). Peak memory consumption was 71.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:22:42,946 INFO L168 Benchmark]: TraceAbstraction took 93449.11 ms. Allocated memory was 326.1 MB in the beginning and 928.5 MB in the end (delta: 602.4 MB). Free memory was 287.7 MB in the beginning and 641.6 MB in the end (delta: -353.9 MB). Peak memory consumption was 623.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:22:42,948 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 304.1 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.10 ms. Allocated memory is still 304.1 MB. Free memory was 262.0 MB in the beginning and 248.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 56.28 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 246.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 886.42 ms. Allocated memory was 304.1 MB in the beginning and 326.1 MB in the end (delta: 22.0 MB). Free memory was 246.0 MB in the beginning and 289.2 MB in the end (delta: -43.3 MB). Peak memory consumption was 71.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 93449.11 ms. Allocated memory was 326.1 MB in the beginning and 928.5 MB in the end (delta: 602.4 MB). Free memory was 287.7 MB in the beginning and 641.6 MB in the end (delta: -353.9 MB). Peak memory consumption was 623.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_53 term size 85 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_53 term size 85: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-22-42-956.csv Received shutdown request...