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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:34:48,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:34:48,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:34:48,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:34:48,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:34:48,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:34:48,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:34:48,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:34:48,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:34:48,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:34:48,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:34:48,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:34:48,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:34:48,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:34:48,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:34:48,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:34:48,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:34:48,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:34:48,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:34:48,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:34:48,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:34:48,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:34:48,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:34:48,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:34:48,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:34:48,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:34:48,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:34:48,774 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:34:48,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:34:48,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:34:48,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:34:48,776 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:34:48,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:34:48,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:34:48,785 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:34:48,785 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:34:48,785 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:34:48,785 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:34:48,785 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:34:48,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:34:48,786 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:34:48,786 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:34:48,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:34:48,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:34:48,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:34:48,787 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:34:48,787 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:34:48,787 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:34:48,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:34:48,787 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:34:48,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:34:48,788 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:34:48,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:34:48,788 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:34:48,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:34:48,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:34:48,789 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:34:48,789 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:34:48,789 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:34:48,789 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:34:48,789 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:34:48,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:34:48,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:34:48,790 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:34:48,790 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:34:48,790 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:34:48,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:34:48,839 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:34:48,843 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:34:48,844 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:34:48,845 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:34:48,846 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-24 13:34:49,046 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:34:49,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:34:49,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:34:49,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:34:49,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:34:49,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e77406e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49, skipping insertion in model container [2018-01-24 13:34:49,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,075 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:34:49,121 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:34:49,263 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:34:49,296 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:34:49,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49 WrapperNode [2018-01-24 13:34:49,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:34:49,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:34:49,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:34:49,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:34:49,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (1/1) ... [2018-01-24 13:34:49,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:34:49,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:34:49,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:34:49,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:34:49,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (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-24 13:34:49,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:34:49,411 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:34:49,411 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-24 13:34:49,411 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect [2018-01-24 13:34:49,411 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 13:34:49,411 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-01-24 13:34:49,411 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-01-24 13:34:49,412 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:34:49,412 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:34:49,412 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 13:34:49,413 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure inspect [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-01-24 13:34:49,414 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-01-24 13:34:49,415 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-01-24 13:34:49,415 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:34:49,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:34:49,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:34:50,161 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:34:50,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:34:50 BoogieIcfgContainer [2018-01-24 13:34:50,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:34:50,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:34:50,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:34:50,165 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:34:50,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:34:49" (1/3) ... [2018-01-24 13:34:50,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fbe1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:34:50, skipping insertion in model container [2018-01-24 13:34:50,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:49" (2/3) ... [2018-01-24 13:34:50,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64fbe1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:34:50, skipping insertion in model container [2018-01-24 13:34:50,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:34:50" (3/3) ... [2018-01-24 13:34:50,168 INFO L105 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-01-24 13:34:50,175 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:34:50,181 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-01-24 13:34:50,239 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:34:50,239 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:34:50,239 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:34:50,239 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:34:50,239 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:34:50,239 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:34:50,239 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:34:50,239 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:34:50,240 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:34:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states. [2018-01-24 13:34:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 13:34:50,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:50,269 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 13:34:50,269 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-24 13:34:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 19743518, now seen corresponding path program 1 times [2018-01-24 13:34:50,274 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:50,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:50,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:50,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:50,315 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:50,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:50,488 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-24 13:34:50,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:50,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:34:50,491 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:50,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:34:50,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:34:50,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:34:50,507 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 3 states. [2018-01-24 13:34:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:50,797 INFO L93 Difference]: Finished difference Result 520 states and 695 transitions. [2018-01-24 13:34:50,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:34:50,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 13:34:50,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:50,813 INFO L225 Difference]: With dead ends: 520 [2018-01-24 13:34:50,813 INFO L226 Difference]: Without dead ends: 244 [2018-01-24 13:34:50,821 INFO L525 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-24 13:34:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-24 13:34:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-01-24 13:34:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-24 13:34:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-01-24 13:34:50,877 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 4 [2018-01-24 13:34:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:50,877 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-01-24 13:34:50,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:34:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-01-24 13:34:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 13:34:50,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:50,878 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 13:34:50,879 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-24 13:34:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 19743519, now seen corresponding path program 1 times [2018-01-24 13:34:50,879 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:50,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:50,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:50,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:50,881 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:50,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:50,959 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-24 13:34:50,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:50,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:34:50,960 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:50,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:34:50,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:34:50,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:34:50,962 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 3 states. [2018-01-24 13:34:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:51,117 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2018-01-24 13:34:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:34:51,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 13:34:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:51,122 INFO L225 Difference]: With dead ends: 247 [2018-01-24 13:34:51,122 INFO L226 Difference]: Without dead ends: 245 [2018-01-24 13:34:51,123 INFO L525 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-24 13:34:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-24 13:34:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-01-24 13:34:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-24 13:34:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 250 transitions. [2018-01-24 13:34:51,145 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 250 transitions. Word has length 4 [2018-01-24 13:34:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:51,145 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 250 transitions. [2018-01-24 13:34:51,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:34:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 250 transitions. [2018-01-24 13:34:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:34:51,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:51,146 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:51,147 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-24 13:34:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash -935456334, now seen corresponding path program 1 times [2018-01-24 13:34:51,147 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:51,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:51,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:51,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:51,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:51,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:51,222 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-24 13:34:51,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:51,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:34:51,223 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:51,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:34:51,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:34:51,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:34:51,224 INFO L87 Difference]: Start difference. First operand 241 states and 250 transitions. Second operand 4 states. [2018-01-24 13:34:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:51,369 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2018-01-24 13:34:51,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:34:51,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:34:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:51,371 INFO L225 Difference]: With dead ends: 241 [2018-01-24 13:34:51,371 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 13:34:51,372 INFO L525 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-24 13:34:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 13:34:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-01-24 13:34:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 13:34:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2018-01-24 13:34:51,389 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 16 [2018-01-24 13:34:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:51,390 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2018-01-24 13:34:51,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:34:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2018-01-24 13:34:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:34:51,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:51,391 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:51,391 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-24 13:34:51,391 INFO L82 PathProgramCache]: Analyzing trace with hash -935456333, now seen corresponding path program 1 times [2018-01-24 13:34:51,391 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:51,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:51,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:51,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:51,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:51,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:51,477 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-24 13:34:51,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:51,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:34:51,477 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:51,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:34:51,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:34:51,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:34:51,478 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand 4 states. [2018-01-24 13:34:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:51,636 INFO L93 Difference]: Finished difference Result 238 states and 247 transitions. [2018-01-24 13:34:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:34:51,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 13:34:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:51,639 INFO L225 Difference]: With dead ends: 238 [2018-01-24 13:34:51,639 INFO L226 Difference]: Without dead ends: 235 [2018-01-24 13:34:51,640 INFO L525 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-24 13:34:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-24 13:34:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-01-24 13:34:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-01-24 13:34:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2018-01-24 13:34:51,656 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 16 [2018-01-24 13:34:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:51,657 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2018-01-24 13:34:51,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:34:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2018-01-24 13:34:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:34:51,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:51,658 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:51,658 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-24 13:34:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730920, now seen corresponding path program 1 times [2018-01-24 13:34:51,658 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:51,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:51,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:51,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:51,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:51,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:51,768 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-24 13:34:51,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:51,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:34:51,769 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:51,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:34:51,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:34:51,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:51,770 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 7 states. [2018-01-24 13:34:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:52,062 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2018-01-24 13:34:52,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:34:52,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 13:34:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:52,064 INFO L225 Difference]: With dead ends: 244 [2018-01-24 13:34:52,064 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 13:34:52,064 INFO L525 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-24 13:34:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 13:34:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-01-24 13:34:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-24 13:34:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-01-24 13:34:52,081 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 19 [2018-01-24 13:34:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:52,082 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-01-24 13:34:52,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:34:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-01-24 13:34:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:34:52,082 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:52,082 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:52,082 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-24 13:34:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730921, now seen corresponding path program 1 times [2018-01-24 13:34:52,083 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:52,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:52,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:52,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:52,084 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:52,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:52,279 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-24 13:34:52,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:52,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:34:52,280 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:52,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:34:52,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:34:52,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:34:52,281 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 9 states. [2018-01-24 13:34:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:52,803 INFO L93 Difference]: Finished difference Result 242 states and 251 transitions. [2018-01-24 13:34:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:34:52,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 13:34:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:52,806 INFO L225 Difference]: With dead ends: 242 [2018-01-24 13:34:52,806 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 13:34:52,807 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:34:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 13:34:52,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-01-24 13:34:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 13:34:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 246 transitions. [2018-01-24 13:34:52,821 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 246 transitions. Word has length 19 [2018-01-24 13:34:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:52,822 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 246 transitions. [2018-01-24 13:34:52,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:34:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 246 transitions. [2018-01-24 13:34:52,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:34:52,822 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:52,823 INFO L322 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-24 13:34:52,823 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-24 13:34:52,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173164, now seen corresponding path program 1 times [2018-01-24 13:34:52,823 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:52,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:52,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:52,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:52,825 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:52,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:52,972 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-24 13:34:52,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:52,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:34:52,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:52,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:34:52,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:34:52,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:34:52,973 INFO L87 Difference]: Start difference. First operand 238 states and 246 transitions. Second operand 10 states. [2018-01-24 13:34:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:53,531 INFO L93 Difference]: Finished difference Result 265 states and 275 transitions. [2018-01-24 13:34:53,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:34:53,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 13:34:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:53,533 INFO L225 Difference]: With dead ends: 265 [2018-01-24 13:34:53,533 INFO L226 Difference]: Without dead ends: 264 [2018-01-24 13:34:53,534 INFO L525 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-24 13:34:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-24 13:34:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-01-24 13:34:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-24 13:34:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2018-01-24 13:34:53,547 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 22 [2018-01-24 13:34:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:53,548 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2018-01-24 13:34:53,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:34:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2018-01-24 13:34:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:34:53,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:53,549 INFO L322 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-24 13:34:53,549 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-24 13:34:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173165, now seen corresponding path program 1 times [2018-01-24 13:34:53,549 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:53,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:53,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:53,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:53,550 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:53,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:53,807 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-24 13:34:53,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:53,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:34:53,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:53,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:34:53,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:34:53,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:34:53,814 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand 11 states. [2018-01-24 13:34:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:54,660 INFO L93 Difference]: Finished difference Result 485 states and 501 transitions. [2018-01-24 13:34:54,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:34:54,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 13:34:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:54,663 INFO L225 Difference]: With dead ends: 485 [2018-01-24 13:34:54,663 INFO L226 Difference]: Without dead ends: 484 [2018-01-24 13:34:54,663 INFO L525 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-24 13:34:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-01-24 13:34:54,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2018-01-24 13:34:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-01-24 13:34:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 473 transitions. [2018-01-24 13:34:54,682 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 473 transitions. Word has length 22 [2018-01-24 13:34:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:54,682 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 473 transitions. [2018-01-24 13:34:54,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:34:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 473 transitions. [2018-01-24 13:34:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:34:54,683 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:54,683 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:54,684 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-24 13:34:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash -598304902, now seen corresponding path program 1 times [2018-01-24 13:34:54,684 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:54,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:54,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:54,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:54,685 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:54,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:54,820 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-24 13:34:54,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:54,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:34:54,821 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:54,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:34:54,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:34:54,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:54,822 INFO L87 Difference]: Start difference. First operand 400 states and 473 transitions. Second operand 7 states. [2018-01-24 13:34:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:55,340 INFO L93 Difference]: Finished difference Result 414 states and 487 transitions. [2018-01-24 13:34:55,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:34:55,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 13:34:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:55,343 INFO L225 Difference]: With dead ends: 414 [2018-01-24 13:34:55,343 INFO L226 Difference]: Without dead ends: 412 [2018-01-24 13:34:55,344 INFO L525 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-24 13:34:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-01-24 13:34:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 271. [2018-01-24 13:34:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-24 13:34:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 288 transitions. [2018-01-24 13:34:55,364 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 288 transitions. Word has length 23 [2018-01-24 13:34:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:55,365 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 288 transitions. [2018-01-24 13:34:55,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:34:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 288 transitions. [2018-01-24 13:34:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:34:55,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:55,365 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:55,365 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-24 13:34:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash -598304901, now seen corresponding path program 1 times [2018-01-24 13:34:55,366 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:55,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:55,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:55,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:55,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:55,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:55,506 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-24 13:34:55,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:55,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:34:55,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:55,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:34:55,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:34:55,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:34:55,507 INFO L87 Difference]: Start difference. First operand 271 states and 288 transitions. Second operand 8 states. [2018-01-24 13:34:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:55,842 INFO L93 Difference]: Finished difference Result 277 states and 288 transitions. [2018-01-24 13:34:55,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:34:55,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 13:34:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:55,844 INFO L225 Difference]: With dead ends: 277 [2018-01-24 13:34:55,845 INFO L226 Difference]: Without dead ends: 275 [2018-01-24 13:34:55,845 INFO L525 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-24 13:34:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-24 13:34:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-01-24 13:34:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-24 13:34:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 284 transitions. [2018-01-24 13:34:55,865 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 284 transitions. Word has length 23 [2018-01-24 13:34:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:55,865 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 284 transitions. [2018-01-24 13:34:55,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:34:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 284 transitions. [2018-01-24 13:34:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:34:55,866 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:55,866 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:55,866 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-24 13:34:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash 554606109, now seen corresponding path program 1 times [2018-01-24 13:34:55,867 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:55,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:55,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:55,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:55,868 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:55,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:34:55,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:55,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:34:55,921 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:55,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:34:55,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:34:55,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:34:55,922 INFO L87 Difference]: Start difference. First operand 271 states and 284 transitions. Second operand 5 states. [2018-01-24 13:34:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:56,202 INFO L93 Difference]: Finished difference Result 271 states and 284 transitions. [2018-01-24 13:34:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:34:56,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 13:34:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:56,204 INFO L225 Difference]: With dead ends: 271 [2018-01-24 13:34:56,204 INFO L226 Difference]: Without dead ends: 270 [2018-01-24 13:34:56,205 INFO L525 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-24 13:34:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-24 13:34:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-01-24 13:34:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 13:34:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 281 transitions. [2018-01-24 13:34:56,221 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 281 transitions. Word has length 25 [2018-01-24 13:34:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:56,221 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 281 transitions. [2018-01-24 13:34:56,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:34:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 281 transitions. [2018-01-24 13:34:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:34:56,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:56,222 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:56,222 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-24 13:34:56,223 INFO L82 PathProgramCache]: Analyzing trace with hash 554606110, now seen corresponding path program 1 times [2018-01-24 13:34:56,223 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:56,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:56,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:56,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:56,224 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:56,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:34:56,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:56,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:34:56,346 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:56,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:34:56,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:34:56,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:34:56,347 INFO L87 Difference]: Start difference. First operand 270 states and 281 transitions. Second operand 8 states. [2018-01-24 13:34:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:56,606 INFO L93 Difference]: Finished difference Result 273 states and 281 transitions. [2018-01-24 13:34:56,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:34:56,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 13:34:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:56,607 INFO L225 Difference]: With dead ends: 273 [2018-01-24 13:34:56,608 INFO L226 Difference]: Without dead ends: 272 [2018-01-24 13:34:56,608 INFO L525 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-24 13:34:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-24 13:34:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-01-24 13:34:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 13:34:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 279 transitions. [2018-01-24 13:34:56,621 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 279 transitions. Word has length 25 [2018-01-24 13:34:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:56,621 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 279 transitions. [2018-01-24 13:34:56,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:34:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 279 transitions. [2018-01-24 13:34:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 13:34:56,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:56,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:56,623 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-24 13:34:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658537, now seen corresponding path program 1 times [2018-01-24 13:34:56,624 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:56,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:56,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:56,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:56,625 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:56,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:56,929 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-24 13:34:56,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:56,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:34:56,930 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:56,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:34:56,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:34:56,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:34:56,931 INFO L87 Difference]: Start difference. First operand 270 states and 279 transitions. Second operand 11 states. [2018-01-24 13:34:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:57,381 INFO L93 Difference]: Finished difference Result 270 states and 279 transitions. [2018-01-24 13:34:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:34:57,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-01-24 13:34:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:57,383 INFO L225 Difference]: With dead ends: 270 [2018-01-24 13:34:57,383 INFO L226 Difference]: Without dead ends: 269 [2018-01-24 13:34:57,383 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:34:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-01-24 13:34:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-01-24 13:34:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-24 13:34:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 278 transitions. [2018-01-24 13:34:57,403 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 278 transitions. Word has length 48 [2018-01-24 13:34:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:57,403 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 278 transitions. [2018-01-24 13:34:57,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:34:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 278 transitions. [2018-01-24 13:34:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 13:34:57,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:57,405 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:57,405 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-24 13:34:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658536, now seen corresponding path program 1 times [2018-01-24 13:34:57,405 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:57,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:57,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:57,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:57,407 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:57,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:57,491 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-24 13:34:57,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:57,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:34:57,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:57,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:34:57,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:34:57,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:57,493 INFO L87 Difference]: Start difference. First operand 269 states and 278 transitions. Second operand 7 states. [2018-01-24 13:34:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:57,838 INFO L93 Difference]: Finished difference Result 269 states and 278 transitions. [2018-01-24 13:34:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:34:57,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-01-24 13:34:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:57,840 INFO L225 Difference]: With dead ends: 269 [2018-01-24 13:34:57,841 INFO L226 Difference]: Without dead ends: 264 [2018-01-24 13:34:57,841 INFO L525 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-24 13:34:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-24 13:34:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-01-24 13:34:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-24 13:34:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 273 transitions. [2018-01-24 13:34:57,859 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 273 transitions. Word has length 48 [2018-01-24 13:34:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:57,860 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 273 transitions. [2018-01-24 13:34:57,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:34:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 273 transitions. [2018-01-24 13:34:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 13:34:57,861 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:57,861 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:57,861 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-24 13:34:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash 652522709, now seen corresponding path program 1 times [2018-01-24 13:34:57,862 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:57,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:57,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:57,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:57,863 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:57,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:34:58,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:34:58,577 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:34:58,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:58,586 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:34:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:58,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:34:58,719 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-24 13:34:58,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:34:58,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:34:58,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:34:58,815 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-24 13:34:58,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:34:58,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:34:58,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-01-24 13:34:59,084 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-24 13:34:59,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,089 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-24 13:34:59,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-01-24 13:34:59,384 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-24 13:34:59,389 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-24 13:34:59,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,398 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-24 13:34:59,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-24 13:34:59,642 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-24 13:34:59,648 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-24 13:34:59,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-01-24 13:34:59,787 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-24 13:34:59,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:34:59,796 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-24 13:34:59,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,839 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-24 13:34:59,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-01-24 13:34:59,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:34:59,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:34:59,927 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-24 13:34:59,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:34:59,957 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-24 13:34:59,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-01-24 13:35:00,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:00,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:00,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:00,054 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-24 13:35:00,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:00,090 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-24 13:35:00,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:77 [2018-01-24 13:35:00,249 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-24 13:35:00,252 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-24 13:35:00,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:00,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:00,274 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-24 13:35:00,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:77 [2018-01-24 13:35:00,497 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-24 13:35:00,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:00,500 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-24 13:35:00,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:00,507 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-24 13:35:00,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:00,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:00,519 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-24 13:35:00,519 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:81, output treesize:28 [2018-01-24 13:35:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:00,661 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:35:00,687 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-24 13:35:00,694 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-24 13:35:00,705 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-24 13:35:00,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-01-24 13:35:00,977 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:00,978 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:107, output treesize:1 [2018-01-24 13:35:05,316 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2018-01-24 13:35:05,332 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 9 treesize of output 8 [2018-01-24 13:35:05,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,338 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:05,338 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:05,338 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:05,345 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 44 treesize of output 54 [2018-01-24 13:35:05,365 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-01-24 13:35:05,369 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:05,370 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 20 treesize of output 28 [2018-01-24 13:35:05,370 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,375 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,384 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:05,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-01-24 13:35:05,389 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:05,390 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 17 treesize of output 7 [2018-01-24 13:35:05,390 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,397 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 17 treesize of output 8 [2018-01-24 13:35:05,397 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,399 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:05,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:35:05,407 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:95, output treesize:21 [2018-01-24 13:35:39,117 WARN L146 SmtUtils]: Spent 25166ms on a formula simplification. DAG size of input: 76 DAG size of output 51 [2018-01-24 13:35:39,165 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-01-24 13:35:39,197 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 9 treesize of output 8 [2018-01-24 13:35:39,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:39,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 107 [2018-01-24 13:35:39,740 WARN L146 SmtUtils]: Spent 486ms on a formula simplification. DAG size of input: 250 DAG size of output 227 [2018-01-24 13:35:39,745 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-01-24 13:35:39,748 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:39,748 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 38 treesize of output 43 [2018-01-24 13:35:39,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:39,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:39,762 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2018-01-24 13:35:39,764 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:39,765 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 20 treesize of output 28 [2018-01-24 13:35:39,765 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:39,775 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:39,778 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2018-01-24 13:35:39,780 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:39,781 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 38 treesize of output 43 [2018-01-24 13:35:39,781 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:39,791 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:40,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2018-01-24 13:35:40,293 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:40,302 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 3 case distinctions, treesize of input 48 treesize of output 65 [2018-01-24 13:35:40,302 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-24 13:35:40,341 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:40,342 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 48 treesize of output 56 [2018-01-24 13:35:40,342 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:40,374 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:35:40,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2018-01-24 13:35:40,391 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:40,401 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 3 case distinctions, treesize of input 63 treesize of output 77 [2018-01-24 13:35:40,402 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-24 13:35:40,445 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:40,446 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 63 treesize of output 68 [2018-01-24 13:35:40,446 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:40,481 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:35:40,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 66 [2018-01-24 13:35:40,496 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:40,505 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 3 case distinctions, treesize of input 59 treesize of output 73 [2018-01-24 13:35:40,505 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-24 13:35:40,549 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:40,550 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 59 treesize of output 64 [2018-01-24 13:35:40,550 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:40,587 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:35:41,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2018-01-24 13:35:41,205 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:41,206 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 38 treesize of output 43 [2018-01-24 13:35:41,206 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:41,220 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:41,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 13:35:41,225 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:41,226 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 20 treesize of output 28 [2018-01-24 13:35:41,226 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:41,238 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:41,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2018-01-24 13:35:41,243 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:41,243 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 38 treesize of output 43 [2018-01-24 13:35:41,244 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:41,254 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:41,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 63 [2018-01-24 13:35:41,842 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:41,851 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 3 case distinctions, treesize of input 56 treesize of output 70 [2018-01-24 13:35:41,852 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-01-24 13:35:41,893 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:41,894 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 56 treesize of output 61 [2018-01-24 13:35:41,894 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:41,927 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:35:41,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-01-24 13:35:41,943 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:41,952 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 3 case distinctions, treesize of input 49 treesize of output 66 [2018-01-24 13:35:41,952 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-01-24 13:35:41,995 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:35:41,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2018-01-24 13:35:41,995 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:42,028 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:35:42,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2018-01-24 13:35:42,715 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_prenex_24 term size 36 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.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.computeBackwardSequence(IterativePredicateTransformer.java:386) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) 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.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) 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:368) 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:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) 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-24 13:35:42,718 INFO L168 Benchmark]: Toolchain (without parser) took 53671.38 ms. Allocated memory was 307.2 MB in the beginning and 651.7 MB in the end (delta: 344.5 MB). Free memory was 266.1 MB in the beginning and 606.0 MB in the end (delta: -339.9 MB). Peak memory consumption was 309.4 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:42,719 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:35:42,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.83 ms. Allocated memory is still 307.2 MB. Free memory was 265.1 MB in the beginning and 252.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:42,719 INFO L168 Benchmark]: Boogie Preprocessor took 53.52 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 249.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:42,720 INFO L168 Benchmark]: RCFGBuilder took 797.44 ms. Allocated memory is still 307.2 MB. Free memory was 249.1 MB in the beginning and 191.5 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:42,720 INFO L168 Benchmark]: TraceAbstraction took 52553.99 ms. Allocated memory was 307.2 MB in the beginning and 651.7 MB in the end (delta: 344.5 MB). Free memory was 191.5 MB in the beginning and 606.0 MB in the end (delta: -414.5 MB). Peak memory consumption was 234.8 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:42,722 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.17 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.83 ms. Allocated memory is still 307.2 MB. Free memory was 265.1 MB in the beginning and 252.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 53.52 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 249.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 797.44 ms. Allocated memory is still 307.2 MB. Free memory was 249.1 MB in the beginning and 191.5 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52553.99 ms. Allocated memory was 307.2 MB in the beginning and 651.7 MB in the end (delta: 344.5 MB). Free memory was 191.5 MB in the beginning and 606.0 MB in the end (delta: -414.5 MB). Peak memory consumption was 234.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_24 term size 36 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_24 term size 36: 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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-35-42-729.csv Received shutdown request...