java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:20:18,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:20:18,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:20:18,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:20:18,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:20:18,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:20:18,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:20:18,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:20:18,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:20:18,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:20:18,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:20:18,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:20:18,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:20:18,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:20:18,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:20:18,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:20:18,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:20:18,141 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:20:18,142 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:20:18,143 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:20:18,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:20:18,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:20:18,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:20:18,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:20:18,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:20:18,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:20:18,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:20:18,148 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:20:18,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:20:18,148 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:20:18,149 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:20:18,149 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:20:18,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:20:18,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:20:18,160 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:20:18,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:20:18,160 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:20:18,161 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:20:18,161 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:20:18,161 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:20:18,161 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:20:18,161 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:20:18,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:20:18,162 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:20:18,162 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:20:18,162 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:20:18,162 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:20:18,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:20:18,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:20:18,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:20:18,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:20:18,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:20:18,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:20:18,163 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:20:18,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:20:18,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:20:18,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:20:18,206 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:20:18,210 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:20:18,211 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:20:18,212 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:20:18,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i [2018-02-04 12:20:18,363 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:20:18,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:20:18,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:20:18,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:20:18,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:20:18,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7dd1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18, skipping insertion in model container [2018-02-04 12:20:18,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,387 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:20:18,418 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:20:18,505 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:20:18,526 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:20:18,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18 WrapperNode [2018-02-04 12:20:18,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:20:18,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:20:18,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:20:18,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:20:18,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... [2018-02-04 12:20:18,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:20:18,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:20:18,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:20:18,565 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:20:18,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:20:18,603 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:20:18,603 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:20:18,603 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-04 12:20:18,603 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-04 12:20:18,603 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-04 12:20:18,603 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-04 12:20:18,603 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-04 12:20:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-04 12:20:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-04 12:20:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-04 12:20:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-04 12:20:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-04 12:20:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-04 12:20:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:20:18,604 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:20:18,604 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:20:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-04 12:20:18,606 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-04 12:20:18,607 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-04 12:20:18,607 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-04 12:20:18,607 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:20:18,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:20:18,607 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:20:18,999 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:20:18,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:20:18 BoogieIcfgContainer [2018-02-04 12:20:19,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:20:19,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:20:19,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:20:19,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:20:19,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:20:18" (1/3) ... [2018-02-04 12:20:19,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be8fa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:20:19, skipping insertion in model container [2018-02-04 12:20:19,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:18" (2/3) ... [2018-02-04 12:20:19,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be8fa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:20:19, skipping insertion in model container [2018-02-04 12:20:19,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:20:18" (3/3) ... [2018-02-04 12:20:19,006 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0137_false-valid-deref.i [2018-02-04 12:20:19,019 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:20:19,026 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-04 12:20:19,063 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:20:19,064 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:20:19,064 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:20:19,064 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:20:19,064 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:20:19,064 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:20:19,064 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:20:19,065 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:20:19,065 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:20:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-02-04 12:20:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:20:19,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:19,088 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:20:19,089 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash 8574872, now seen corresponding path program 1 times [2018-02-04 12:20:19,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:19,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:19,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:19,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:19,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:19,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:19,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:20:19,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:20:19,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:20:19,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:19,252 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 3 states. [2018-02-04 12:20:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:19,379 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-04 12:20:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:20:19,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:20:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:19,388 INFO L225 Difference]: With dead ends: 189 [2018-02-04 12:20:19,388 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 12:20:19,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 12:20:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-02-04 12:20:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 12:20:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-02-04 12:20:19,421 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 4 [2018-02-04 12:20:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:19,421 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-02-04 12:20:19,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:20:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-02-04 12:20:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:20:19,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:19,422 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:20:19,422 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:19,422 INFO L82 PathProgramCache]: Analyzing trace with hash 8574873, now seen corresponding path program 1 times [2018-02-04 12:20:19,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:19,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:19,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:19,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:19,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:19,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:19,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:20:19,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:20:19,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:20:19,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:19,468 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 3 states. [2018-02-04 12:20:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:19,555 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2018-02-04 12:20:19,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:20:19,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:20:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:19,557 INFO L225 Difference]: With dead ends: 187 [2018-02-04 12:20:19,557 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 12:20:19,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 12:20:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-04 12:20:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 12:20:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2018-02-04 12:20:19,570 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 4 [2018-02-04 12:20:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:19,570 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2018-02-04 12:20:19,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:20:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2018-02-04 12:20:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:20:19,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:19,571 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:19,572 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065266, now seen corresponding path program 1 times [2018-02-04 12:20:19,572 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:19,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:19,573 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,573 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:19,573 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:19,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:19,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:19,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:20:19,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:20:19,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:20:19,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:20:19,625 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand 4 states. [2018-02-04 12:20:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:19,739 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-02-04 12:20:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:20:19,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:20:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:19,741 INFO L225 Difference]: With dead ends: 182 [2018-02-04 12:20:19,741 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 12:20:19,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:20:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 12:20:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 12:20:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 12:20:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-02-04 12:20:19,747 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 16 [2018-02-04 12:20:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:19,747 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-02-04 12:20:19,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:20:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-02-04 12:20:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:20:19,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:19,748 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:19,748 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:19,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065267, now seen corresponding path program 1 times [2018-02-04 12:20:19,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:19,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:19,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:19,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:19,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:19,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:19,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:20:19,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:20:19,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:20:19,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:20:19,819 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 4 states. [2018-02-04 12:20:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:19,926 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-02-04 12:20:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:20:19,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:20:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:19,927 INFO L225 Difference]: With dead ends: 181 [2018-02-04 12:20:19,927 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 12:20:19,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:20:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 12:20:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-02-04 12:20:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 12:20:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2018-02-04 12:20:19,935 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 16 [2018-02-04 12:20:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:19,935 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2018-02-04 12:20:19,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:20:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2018-02-04 12:20:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:20:19,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:19,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:19,936 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash -466429743, now seen corresponding path program 1 times [2018-02-04 12:20:19,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:19,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:19,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:19,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:19,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:20,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:20,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:20:20,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:20:20,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:20:20,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:20:20,015 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand 7 states. [2018-02-04 12:20:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:20,207 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-04 12:20:20,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:20:20,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 12:20:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:20,208 INFO L225 Difference]: With dead ends: 189 [2018-02-04 12:20:20,209 INFO L226 Difference]: Without dead ends: 189 [2018-02-04 12:20:20,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:20:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-04 12:20:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-02-04 12:20:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 12:20:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-02-04 12:20:20,214 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 19 [2018-02-04 12:20:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:20,215 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-02-04 12:20:20,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:20:20,215 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-02-04 12:20:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:20:20,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:20,215 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:20,215 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:20,215 INFO L82 PathProgramCache]: Analyzing trace with hash -466429742, now seen corresponding path program 1 times [2018-02-04 12:20:20,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:20,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:20,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:20,216 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:20,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:20,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:20,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:20,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:20:20,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:20:20,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:20:20,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:20:20,314 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 7 states. [2018-02-04 12:20:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:20,573 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-04 12:20:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:20:20,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 12:20:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:20,574 INFO L225 Difference]: With dead ends: 182 [2018-02-04 12:20:20,574 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 12:20:20,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:20:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 12:20:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 12:20:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 12:20:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-02-04 12:20:20,579 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 19 [2018-02-04 12:20:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:20,579 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-02-04 12:20:20,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:20:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-02-04 12:20:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:20:20,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:20,580 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:20,580 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060692, now seen corresponding path program 1 times [2018-02-04 12:20:20,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:20,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:20,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:20,581 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:20,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:20,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:20,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:20,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:20:20,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:20:20,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:20:20,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:20:20,684 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 10 states. [2018-02-04 12:20:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:20,995 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-02-04 12:20:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:20:20,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 12:20:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:20,997 INFO L225 Difference]: With dead ends: 208 [2018-02-04 12:20:20,997 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 12:20:20,997 INFO L554 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-02-04 12:20:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 12:20:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2018-02-04 12:20:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 12:20:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2018-02-04 12:20:21,001 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 22 [2018-02-04 12:20:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:21,001 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2018-02-04 12:20:21,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:20:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2018-02-04 12:20:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:20:21,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:21,002 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:21,002 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060691, now seen corresponding path program 1 times [2018-02-04 12:20:21,002 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:21,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:21,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:21,003 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:21,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:21,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:21,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:21,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:20:21,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:20:21,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:20:21,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:20:21,175 INFO L87 Difference]: Start difference. First operand 200 states and 219 transitions. Second operand 11 states. [2018-02-04 12:20:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:21,936 INFO L93 Difference]: Finished difference Result 372 states and 392 transitions. [2018-02-04 12:20:21,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:20:21,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 12:20:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:21,939 INFO L225 Difference]: With dead ends: 372 [2018-02-04 12:20:21,939 INFO L226 Difference]: Without dead ends: 372 [2018-02-04 12:20:21,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:20:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-04 12:20:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 296. [2018-02-04 12:20:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 12:20:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 362 transitions. [2018-02-04 12:20:21,955 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 362 transitions. Word has length 22 [2018-02-04 12:20:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:21,956 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 362 transitions. [2018-02-04 12:20:21,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:20:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 362 transitions. [2018-02-04 12:20:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:20:21,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:21,956 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:21,956 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824186, now seen corresponding path program 1 times [2018-02-04 12:20:21,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:21,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:21,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:21,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:21,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:21,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:21,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:21,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:20:21,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:20:21,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:20:21,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:20:21,999 INFO L87 Difference]: Start difference. First operand 296 states and 362 transitions. Second operand 7 states. [2018-02-04 12:20:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:22,238 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2018-02-04 12:20:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:20:22,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 12:20:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:22,240 INFO L225 Difference]: With dead ends: 308 [2018-02-04 12:20:22,240 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 12:20:22,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:20:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 12:20:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 211. [2018-02-04 12:20:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 12:20:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 230 transitions. [2018-02-04 12:20:22,248 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 230 transitions. Word has length 23 [2018-02-04 12:20:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:22,249 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 230 transitions. [2018-02-04 12:20:22,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:20:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 230 transitions. [2018-02-04 12:20:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:20:22,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:22,250 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:22,250 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824187, now seen corresponding path program 1 times [2018-02-04 12:20:22,250 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:22,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:22,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:22,251 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:22,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:22,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:22,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:20:22,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:20:22,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:20:22,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:20:22,330 INFO L87 Difference]: Start difference. First operand 211 states and 230 transitions. Second operand 8 states. [2018-02-04 12:20:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:22,543 INFO L93 Difference]: Finished difference Result 215 states and 226 transitions. [2018-02-04 12:20:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:20:22,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 12:20:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:22,544 INFO L225 Difference]: With dead ends: 215 [2018-02-04 12:20:22,544 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 12:20:22,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:20:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 12:20:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-02-04 12:20:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 12:20:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-02-04 12:20:22,548 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 23 [2018-02-04 12:20:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:22,548 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-02-04 12:20:22,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:20:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-02-04 12:20:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:20:22,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:22,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:22,549 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:22,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156317, now seen corresponding path program 1 times [2018-02-04 12:20:22,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:22,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:22,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,549 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:22,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:22,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:22,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:22,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:20:22,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:20:22,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:20:22,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:20:22,578 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 5 states. [2018-02-04 12:20:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:22,672 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-04 12:20:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:20:22,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 12:20:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:22,676 INFO L225 Difference]: With dead ends: 210 [2018-02-04 12:20:22,676 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 12:20:22,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:20:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 12:20:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-04 12:20:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 12:20:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-02-04 12:20:22,681 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 25 [2018-02-04 12:20:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:22,681 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-02-04 12:20:22,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:20:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-02-04 12:20:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:20:22,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:22,682 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:22,682 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156318, now seen corresponding path program 1 times [2018-02-04 12:20:22,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:22,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:22,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:22,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:22,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:22,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:22,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:20:22,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:20:22,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:20:22,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:20:22,744 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 8 states. [2018-02-04 12:20:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:22,875 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2018-02-04 12:20:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:20:22,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 12:20:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:22,876 INFO L225 Difference]: With dead ends: 212 [2018-02-04 12:20:22,877 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 12:20:22,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:20:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 12:20:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-02-04 12:20:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 12:20:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-02-04 12:20:22,880 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 25 [2018-02-04 12:20:22,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:22,880 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-02-04 12:20:22,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:20:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-02-04 12:20:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:20:22,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:22,881 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:22,881 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783090, now seen corresponding path program 1 times [2018-02-04 12:20:22,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:22,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:22,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,881 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:22,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:22,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:22,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:22,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:20:22,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:20:22,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:20:22,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:20:22,954 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 9 states. [2018-02-04 12:20:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:23,241 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-02-04 12:20:23,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:20:23,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 12:20:23,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:23,242 INFO L225 Difference]: With dead ends: 209 [2018-02-04 12:20:23,242 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 12:20:23,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:20:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 12:20:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-02-04 12:20:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 12:20:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 220 transitions. [2018-02-04 12:20:23,247 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 220 transitions. Word has length 41 [2018-02-04 12:20:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:23,248 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 220 transitions. [2018-02-04 12:20:23,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:20:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 220 transitions. [2018-02-04 12:20:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:20:23,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:23,249 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:23,249 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783091, now seen corresponding path program 1 times [2018-02-04 12:20:23,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:23,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:23,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:23,250 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:23,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:23,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:23,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:23,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:20:23,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:20:23,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:20:23,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:20:23,378 INFO L87 Difference]: Start difference. First operand 209 states and 220 transitions. Second operand 11 states. [2018-02-04 12:20:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:23,808 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-02-04 12:20:23,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:20:23,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 12:20:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:23,812 INFO L225 Difference]: With dead ends: 208 [2018-02-04 12:20:23,812 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 12:20:23,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:20:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 12:20:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 12:20:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 12:20:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions. [2018-02-04 12:20:23,817 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 41 [2018-02-04 12:20:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:23,818 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions. [2018-02-04 12:20:23,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:20:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions. [2018-02-04 12:20:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:20:23,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:23,819 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:23,819 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 856902849, now seen corresponding path program 1 times [2018-02-04 12:20:23,819 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:23,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:23,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:23,820 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:23,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:23,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:24,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:20:24,088 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:20:24,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:24,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:20:24,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:20:24,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:24,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:24,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-04 12:20:24,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:24,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:24,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:24,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2018-02-04 12:20:24,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-04 12:20:24,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-04 12:20:24,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:20:24,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:24,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-02-04 12:20:24,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 12:20:24,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:20:24,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:24,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:24,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-02-04 12:20:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:24,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:20:24,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2018-02-04 12:20:24,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 12:20:24,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 12:20:24,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:20:24,793 INFO L87 Difference]: Start difference. First operand 208 states and 219 transitions. Second operand 35 states. [2018-02-04 12:20:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:26,219 INFO L93 Difference]: Finished difference Result 299 states and 314 transitions. [2018-02-04 12:20:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:20:26,220 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-02-04 12:20:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:26,221 INFO L225 Difference]: With dead ends: 299 [2018-02-04 12:20:26,221 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 12:20:26,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=289, Invalid=1967, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:20:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 12:20:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 217. [2018-02-04 12:20:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 12:20:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 227 transitions. [2018-02-04 12:20:26,224 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 227 transitions. Word has length 48 [2018-02-04 12:20:26,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:26,225 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 227 transitions. [2018-02-04 12:20:26,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 12:20:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 227 transitions. [2018-02-04 12:20:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:20:26,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:26,225 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:26,225 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash 856902850, now seen corresponding path program 1 times [2018-02-04 12:20:26,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:26,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:26,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:26,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:26,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:26,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:26,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:20:26,577 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:20:26,584 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:26,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:20:26,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:20:26,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 12:20:26,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:20:26,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:26,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:20:26,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:26,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:26,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-02-04 12:20:26,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:26,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:26,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:20:26,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:20:26,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:26,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-02-04 12:20:27,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-04 12:20:27,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:20:27,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 12:20:27,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:20:27,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:27,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:36 [2018-02-04 12:20:27,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 12:20:27,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 12:20:27,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-04 12:20:27,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-02-04 12:20:27,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:27,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:27,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2018-02-04 12:20:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:27,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:20:27,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 36 [2018-02-04 12:20:27,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 12:20:27,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 12:20:27,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:20:27,281 INFO L87 Difference]: Start difference. First operand 217 states and 227 transitions. Second operand 37 states. [2018-02-04 12:20:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:29,653 INFO L93 Difference]: Finished difference Result 260 states and 273 transitions. [2018-02-04 12:20:29,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 12:20:29,654 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2018-02-04 12:20:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:29,655 INFO L225 Difference]: With dead ends: 260 [2018-02-04 12:20:29,655 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 12:20:29,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=425, Invalid=2881, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 12:20:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 12:20:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 194. [2018-02-04 12:20:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 12:20:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 203 transitions. [2018-02-04 12:20:29,661 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 203 transitions. Word has length 48 [2018-02-04 12:20:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:29,661 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 203 transitions. [2018-02-04 12:20:29,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 12:20:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 203 transitions. [2018-02-04 12:20:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:20:29,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:29,662 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:29,662 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377315, now seen corresponding path program 1 times [2018-02-04 12:20:29,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:29,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:29,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:29,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:29,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:29,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:29,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:29,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:20:29,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:20:29,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:20:29,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:29,702 INFO L87 Difference]: Start difference. First operand 194 states and 203 transitions. Second operand 3 states. [2018-02-04 12:20:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:29,763 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-02-04 12:20:29,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:20:29,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 12:20:29,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:29,764 INFO L225 Difference]: With dead ends: 188 [2018-02-04 12:20:29,764 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 12:20:29,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 12:20:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-04 12:20:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 12:20:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 197 transitions. [2018-02-04 12:20:29,766 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 197 transitions. Word has length 48 [2018-02-04 12:20:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:29,766 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 197 transitions. [2018-02-04 12:20:29,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:20:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 197 transitions. [2018-02-04 12:20:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:20:29,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:29,767 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:29,767 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:29,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377314, now seen corresponding path program 1 times [2018-02-04 12:20:29,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:29,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:29,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:29,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:29,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:29,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:29,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:29,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:20:29,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:20:29,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:20:29,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:29,794 INFO L87 Difference]: Start difference. First operand 188 states and 197 transitions. Second operand 3 states. [2018-02-04 12:20:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:29,852 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-02-04 12:20:29,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:20:29,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 12:20:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:29,854 INFO L225 Difference]: With dead ends: 182 [2018-02-04 12:20:29,854 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 12:20:29,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:20:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 12:20:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 12:20:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 12:20:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2018-02-04 12:20:29,858 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 48 [2018-02-04 12:20:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:29,858 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2018-02-04 12:20:29,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:20:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2018-02-04 12:20:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 12:20:29,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:29,859 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:29,859 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765471, now seen corresponding path program 1 times [2018-02-04 12:20:29,860 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:29,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:29,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:29,860 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:29,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:29,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:29,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:29,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:20:29,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:20:29,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:20:29,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:20:29,954 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 11 states. [2018-02-04 12:20:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:30,626 INFO L93 Difference]: Finished difference Result 266 states and 283 transitions. [2018-02-04 12:20:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:20:30,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-04 12:20:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:30,627 INFO L225 Difference]: With dead ends: 266 [2018-02-04 12:20:30,628 INFO L226 Difference]: Without dead ends: 266 [2018-02-04 12:20:30,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:20:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-04 12:20:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 188. [2018-02-04 12:20:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 12:20:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-02-04 12:20:30,632 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 55 [2018-02-04 12:20:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:30,632 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-02-04 12:20:30,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:20:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-02-04 12:20:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 12:20:30,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:30,633 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:30,633 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765472, now seen corresponding path program 1 times [2018-02-04 12:20:30,634 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:30,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:30,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:30,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:30,635 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:30,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:30,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:30,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:20:30,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:20:30,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:20:30,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:20:30,828 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 12 states. [2018-02-04 12:20:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:31,548 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-02-04 12:20:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:20:31,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-04 12:20:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:31,549 INFO L225 Difference]: With dead ends: 210 [2018-02-04 12:20:31,549 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 12:20:31,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:20:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 12:20:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2018-02-04 12:20:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 12:20:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2018-02-04 12:20:31,553 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 55 [2018-02-04 12:20:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:31,553 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2018-02-04 12:20:31,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:20:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2018-02-04 12:20:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 12:20:31,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:31,553 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:31,553 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -558928184, now seen corresponding path program 1 times [2018-02-04 12:20:31,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:31,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:31,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:31,554 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:31,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:31,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:31,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:31,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 12:20:31,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:20:31,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:20:31,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:20:31,706 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand 16 states. [2018-02-04 12:20:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:32,650 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-04 12:20:32,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 12:20:32,650 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-04 12:20:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:32,651 INFO L225 Difference]: With dead ends: 217 [2018-02-04 12:20:32,651 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 12:20:32,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:20:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 12:20:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2018-02-04 12:20:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-04 12:20:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2018-02-04 12:20:32,654 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 58 [2018-02-04 12:20:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:32,654 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2018-02-04 12:20:32,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:20:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2018-02-04 12:20:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 12:20:32,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:32,654 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:32,654 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:32,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1044324748, now seen corresponding path program 1 times [2018-02-04 12:20:32,655 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:32,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:32,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:32,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:32,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:32,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:32,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:20:32,908 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:20:32,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:32,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:20:33,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 12:20:33,072 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 11 treesize of output 3 [2018-02-04 12:20:33,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:33,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:33,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:33,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-02-04 12:20:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:33,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:20:33,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2018-02-04 12:20:33,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:20:33,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:20:33,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:20:33,119 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand 28 states. [2018-02-04 12:20:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:34,406 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2018-02-04 12:20:34,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 12:20:34,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-04 12:20:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:34,407 INFO L225 Difference]: With dead ends: 201 [2018-02-04 12:20:34,407 INFO L226 Difference]: Without dead ends: 189 [2018-02-04 12:20:34,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=3201, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 12:20:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-04 12:20:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2018-02-04 12:20:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 12:20:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-02-04 12:20:34,410 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 60 [2018-02-04 12:20:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:34,410 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-02-04 12:20:34,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:20:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-02-04 12:20:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 12:20:34,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:34,411 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:34,411 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017735, now seen corresponding path program 1 times [2018-02-04 12:20:34,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:34,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:34,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:34,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:34,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:34,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:20:34,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:34,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 12:20:34,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:20:34,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:20:34,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:20:34,657 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 18 states. [2018-02-04 12:20:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:35,244 INFO L93 Difference]: Finished difference Result 266 states and 284 transitions. [2018-02-04 12:20:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:20:35,244 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-04 12:20:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:35,245 INFO L225 Difference]: With dead ends: 266 [2018-02-04 12:20:35,245 INFO L226 Difference]: Without dead ends: 266 [2018-02-04 12:20:35,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:20:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-04 12:20:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2018-02-04 12:20:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 12:20:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2018-02-04 12:20:35,250 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 66 [2018-02-04 12:20:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:35,250 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2018-02-04 12:20:35,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:20:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2018-02-04 12:20:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 12:20:35,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:35,251 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:35,251 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017736, now seen corresponding path program 1 times [2018-02-04 12:20:35,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:35,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:35,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:35,252 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:35,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:35,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:20:35,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:35,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 12:20:35,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:20:35,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:20:35,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:20:35,582 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand 19 states. [2018-02-04 12:20:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:36,401 INFO L93 Difference]: Finished difference Result 250 states and 266 transitions. [2018-02-04 12:20:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:20:36,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-04 12:20:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:36,402 INFO L225 Difference]: With dead ends: 250 [2018-02-04 12:20:36,403 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 12:20:36,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:20:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 12:20:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 208. [2018-02-04 12:20:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 12:20:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-04 12:20:36,407 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 66 [2018-02-04 12:20:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:36,407 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-04 12:20:36,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:20:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-04 12:20:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 12:20:36,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:36,408 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:36,408 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:36,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017030, now seen corresponding path program 1 times [2018-02-04 12:20:36,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:36,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:36,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,409 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:36,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:36,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:20:36,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:36,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:20:36,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:20:36,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:20:36,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:20:36,460 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 5 states. [2018-02-04 12:20:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:36,548 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-02-04 12:20:36,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:20:36,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 12:20:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:36,549 INFO L225 Difference]: With dead ends: 214 [2018-02-04 12:20:36,549 INFO L226 Difference]: Without dead ends: 214 [2018-02-04 12:20:36,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:20:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-04 12:20:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-02-04 12:20:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 12:20:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 227 transitions. [2018-02-04 12:20:36,552 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 227 transitions. Word has length 67 [2018-02-04 12:20:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:36,553 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 227 transitions. [2018-02-04 12:20:36,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:20:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 227 transitions. [2018-02-04 12:20:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 12:20:36,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:36,554 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:36,554 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017031, now seen corresponding path program 1 times [2018-02-04 12:20:36,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:36,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:36,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:36,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:36,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:20:36,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:36,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:20:36,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:20:36,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:20:36,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:20:36,640 INFO L87 Difference]: Start difference. First operand 212 states and 227 transitions. Second operand 5 states. [2018-02-04 12:20:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:36,744 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-02-04 12:20:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:20:36,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 12:20:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:36,745 INFO L225 Difference]: With dead ends: 218 [2018-02-04 12:20:36,745 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 12:20:36,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:20:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 12:20:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2018-02-04 12:20:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 12:20:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 226 transitions. [2018-02-04 12:20:36,748 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 226 transitions. Word has length 67 [2018-02-04 12:20:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:36,748 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 226 transitions. [2018-02-04 12:20:36,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:20:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2018-02-04 12:20:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 12:20:36,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:36,749 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:36,749 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash 48096554, now seen corresponding path program 1 times [2018-02-04 12:20:36,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:36,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:36,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:36,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:36,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 12:20:36,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:36,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:20:36,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:20:36,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:20:36,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:20:36,798 INFO L87 Difference]: Start difference. First operand 212 states and 226 transitions. Second operand 5 states. [2018-02-04 12:20:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:36,813 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-02-04 12:20:36,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:20:36,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-04 12:20:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:36,815 INFO L225 Difference]: With dead ends: 220 [2018-02-04 12:20:36,815 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 12:20:36,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:20:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 12:20:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-04 12:20:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 12:20:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 234 transitions. [2018-02-04 12:20:36,819 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 234 transitions. Word has length 68 [2018-02-04 12:20:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:36,819 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 234 transitions. [2018-02-04 12:20:36,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:20:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 234 transitions. [2018-02-04 12:20:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:20:36,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:36,820 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:36,820 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1255988233, now seen corresponding path program 1 times [2018-02-04 12:20:36,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:36,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:36,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,821 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:36,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:36,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:20:36,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:36,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:20:36,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:20:36,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:20:36,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:20:36,984 INFO L87 Difference]: Start difference. First operand 220 states and 234 transitions. Second operand 11 states. [2018-02-04 12:20:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:37,345 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-04 12:20:37,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:20:37,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-02-04 12:20:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:37,347 INFO L225 Difference]: With dead ends: 229 [2018-02-04 12:20:37,347 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 12:20:37,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:20:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 12:20:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-02-04 12:20:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 12:20:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-02-04 12:20:37,350 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 70 [2018-02-04 12:20:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:37,350 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-02-04 12:20:37,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:20:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-02-04 12:20:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:20:37,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:37,350 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:37,350 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1255988232, now seen corresponding path program 1 times [2018-02-04 12:20:37,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:37,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:37,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:37,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:37,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:37,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:20:37,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:20:37,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:20:37,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:20:37,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:20:37,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:20:37,745 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 14 states. [2018-02-04 12:20:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:20:38,275 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-04 12:20:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:20:38,275 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-02-04 12:20:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:20:38,276 INFO L225 Difference]: With dead ends: 229 [2018-02-04 12:20:38,276 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 12:20:38,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:20:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 12:20:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-02-04 12:20:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 12:20:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 237 transitions. [2018-02-04 12:20:38,279 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 237 transitions. Word has length 70 [2018-02-04 12:20:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:20:38,279 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 237 transitions. [2018-02-04 12:20:38,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:20:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 237 transitions. [2018-02-04 12:20:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 12:20:38,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:20:38,280 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:20:38,280 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:20:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 593824277, now seen corresponding path program 1 times [2018-02-04 12:20:38,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:20:38,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:20:38,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:38,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:38,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:20:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:38,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:20:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:20:38,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:20:38,895 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:20:38,900 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:20:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:20:38,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:20:38,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:20:38,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:20:39,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:20:39,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:39,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 12:20:39,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 12:20:39,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:20:39,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 12:20:39,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:20:39,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 12:20:39,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 12:20:39,123 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,127 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-02-04 12:20:39,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 12:20:39,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 12:20:39,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:20:39,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:39,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:12 [2018-02-04 12:20:39,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:20:39,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:39,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:39,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:20:39,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-02-04 12:20:39,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:20:39,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:39,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 12:20:39,534 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 28 treesize of output 38 [2018-02-04 12:20:39,545 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 29 treesize of output 28 [2018-02-04 12:20:39,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,564 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 2 case distinctions, treesize of input 24 treesize of output 37 [2018-02-04 12:20:39,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:20:39,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:20:39,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:20:39,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:39,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,591 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:20:39,602 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:47, output treesize:78 [2018-02-04 12:20:39,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:39,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:39,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:39,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:228, output treesize:99 [2018-02-04 12:20:39,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 12:20:39,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-02-04 12:20:39,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,917 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 30 treesize of output 22 [2018-02-04 12:20:39,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,929 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:120, output treesize:72 [2018-02-04 12:20:39,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:39,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 12:20:39,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:39,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:70 [2018-02-04 12:20:40,046 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 60 treesize of output 60 [2018-02-04 12:20:40,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:40,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-02-04 12:20:40,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:20:40,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:84 [2018-02-04 12:20:40,154 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 69 treesize of output 67 [2018-02-04 12:20:40,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:40,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:20:40,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-02-04 12:20:40,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:40,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 12:20:40,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:40,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:102 [2018-02-04 12:20:40,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-02-04 12:20:40,351 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 44 treesize of output 31 [2018-02-04 12:20:40,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:40,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 12:20:40,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:20:40,389 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:118, output treesize:79 [2018-02-04 12:20:40,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2018-02-04 12:20:40,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 12:20:40,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:40,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 12:20:40,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:20:40,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 12:20:40,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:20:40,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:5 [2018-02-04 12:20:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:20:40,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:20:40,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29] total 56 [2018-02-04 12:20:40,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 12:20:40,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 12:20:40,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3002, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 12:20:40,703 INFO L87 Difference]: Start difference. First operand 223 states and 237 transitions. Second operand 57 states. [2018-02-04 12:21:53,215 WARN L146 SmtUtils]: Spent 4083ms on a formula simplification. DAG size of input: 101 DAG size of output 62 [2018-02-04 12:21:53,728 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 81 DAG size of output 61 [2018-02-04 12:22:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:22:00,428 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-02-04 12:22:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 12:22:00,428 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 77 [2018-02-04 12:22:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:22:00,429 INFO L225 Difference]: With dead ends: 413 [2018-02-04 12:22:00,429 INFO L226 Difference]: Without dead ends: 413 [2018-02-04 12:22:00,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4109 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=1404, Invalid=14089, Unknown=7, NotChecked=0, Total=15500 [2018-02-04 12:22:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-04 12:22:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 234. [2018-02-04 12:22:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 12:22:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 252 transitions. [2018-02-04 12:22:00,437 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 252 transitions. Word has length 77 [2018-02-04 12:22:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:22:00,438 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 252 transitions. [2018-02-04 12:22:00,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 12:22:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 252 transitions. [2018-02-04 12:22:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 12:22:00,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:22:00,439 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:22:00,439 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 12:22:00,439 INFO L82 PathProgramCache]: Analyzing trace with hash 593824278, now seen corresponding path program 1 times [2018-02-04 12:22:00,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:22:00,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:22:00,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:00,440 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:22:00,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:22:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 12:22:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 12:22:00,514 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 12:22:00,536 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 12:22:00,537 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 12:22:00,538 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 12:22:00,538 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 12:22:00,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:22:00 BoogieIcfgContainer [2018-02-04 12:22:00,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:22:00,550 INFO L168 Benchmark]: Toolchain (without parser) took 102186.38 ms. Allocated memory was 401.1 MB in the beginning and 1.0 GB in the end (delta: 604.5 MB). Free memory was 354.9 MB in the beginning and 894.4 MB in the end (delta: -539.5 MB). Peak memory consumption was 65.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:22:00,551 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 401.1 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:22:00,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.91 ms. Allocated memory is still 401.1 MB. Free memory was 354.9 MB in the beginning and 341.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:22:00,552 INFO L168 Benchmark]: Boogie Preprocessor took 29.44 ms. Allocated memory is still 401.1 MB. Free memory was 341.7 MB in the beginning and 339.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:22:00,552 INFO L168 Benchmark]: RCFGBuilder took 434.91 ms. Allocated memory is still 401.1 MB. Free memory was 339.1 MB in the beginning and 292.7 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 5.3 GB. [2018-02-04 12:22:00,552 INFO L168 Benchmark]: TraceAbstraction took 101548.99 ms. Allocated memory was 401.1 MB in the beginning and 1.0 GB in the end (delta: 604.5 MB). Free memory was 292.7 MB in the beginning and 894.4 MB in the end (delta: -601.7 MB). Peak memory consumption was 2.8 MB. Max. memory is 5.3 GB. [2018-02-04 12:22:00,553 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.18 ms. Allocated memory is still 401.1 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.91 ms. Allocated memory is still 401.1 MB. Free memory was 354.9 MB in the beginning and 341.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.44 ms. Allocated memory is still 401.1 MB. Free memory was 341.7 MB in the beginning and 339.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 434.91 ms. Allocated memory is still 401.1 MB. Free memory was 339.1 MB in the beginning and 292.7 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 101548.99 ms. Allocated memory was 401.1 MB in the beginning and 1.0 GB in the end (delta: 604.5 MB). Free memory was 292.7 MB in the beginning and 894.4 MB in the end (delta: -601.7 MB). Peak memory consumption was 2.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: IVAL [\old(gl_list)=null, \old(gl_list)=null, gl_list={29:17}] [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={22:0}] [L721] CALL gl_read() VAL [gl_list={22:0}] [L672] CALL gl_insert(__VERIFIER_nondet_int()) VAL [\old(value)=0, gl_list={22:0}] [L663] EXPR, FCALL malloc(sizeof *node) VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, value=0] [L663] struct node *node = malloc(sizeof *node); VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L664] COND FALSE !(!node) VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L666] FCALL node->value = value VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L667] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={22:0}, head={22:0}, new={20:4}] [L643] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={22:0}, new={20:4}, new={20:4}] [L643] CALL __list_add(new, head, head->next) VAL [gl_list={22:0}, new={20:4}, next={22:0}, prev={22:0}] [L631] FCALL next->prev = new VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L632] FCALL new->next = next VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L633] FCALL new->prev = prev VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L634] RET, FCALL prev->next = new VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L643] __list_add(new, head, head->next) VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={22:0}, new={20:4}, new={20:4}] [L667] FCALL list_add(&node->linkage, &gl_list) VAL [__VERIFIER_nondet_int()=0, gl_list={22:0}] [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() VAL [gl_list={22:0}] [L722] CALL gl_sort() VAL [gl_list={22:0}] [L709] CALL list_empty(&gl_list) VAL [gl_list={22:0}, head={22:0}] [L625] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={20:4}] [L625] RET return head->next == head; [L709] list_empty(&gl_list) VAL [gl_list={22:0}, list_empty(&gl_list)=0] [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; VAL [dst={18:0}, gl_list={22:0}] [L712] struct list_head *max_pos; VAL [dst={18:0}, gl_list={22:0}] [L713] CALL gl_seek_max() VAL [gl_list={22:0}] [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; VAL [gl_list={22:0}, pos={0:0}] [L692] CALL list_empty(&gl_list) VAL [gl_list={22:0}, head={22:0}] [L625] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={20:4}] [L625] RET return head->next == head; [L692] list_empty(&gl_list) VAL [gl_list={22:0}, list_empty(&gl_list)=0, pos={0:0}] [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next VAL [gl_list={22:0}, gl_list.next={20:4}, pos={0:0}] [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) VAL [gl_list={22:0}, head={20:4}] [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [entry={20:0}, gl_list={22:0}, head={20:4}, head={20:4}] [L686] EXPR, FCALL entry->value VAL [entry={20:0}, entry->value=0, gl_list={22:0}, head={20:4}, head={20:4}] [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) VAL [gl_list={22:0}, pos={20:4}, val_from_node(max_pos)=0] [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next VAL [(max_pos)->next={22:0}, gl_list={22:0}, max=0, pos={20:4}] [L698] pos = (max_pos)->next [L698] COND TRUE pos != (max_pos) VAL [gl_list={22:0}, max=0, pos={22:0}, pos={20:4}] [L699] CALL val_from_node(pos) VAL [gl_list={22:0}, head={22:0}] [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [entry={22:-4}, gl_list={22:0}, head={22:0}, head={22:0}] [L686] FCALL entry->value VAL [entry={22:-4}, gl_list={22:0}, head={22:0}, head={22:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 188 locations, 63 error locations. UNSAFE Result, 101.4s OverallTime, 31 OverallIterations, 2 TraceHistogramMax, 93.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4007 SDtfs, 6055 SDslu, 18586 SDs, 0 SdLazy, 26982 SolverSat, 1506 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 65.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 870 GetRequests, 253 SyntacticMatches, 19 SemanticMatches, 598 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6775 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 784 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1581 NumberOfCodeBlocks, 1581 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1470 ConstructedInterpolants, 69 QuantifiedInterpolants, 931626 SizeOfPredicates, 92 NumberOfNonLiveVariables, 1301 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 64/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-22-00-559.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-22-00-559.csv Received shutdown request...