java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:00:13,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:00:13,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:00:13,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:00:13,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:00:13,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:00:13,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:00:13,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:00:13,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:00:13,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:00:13,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:00:13,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:00:13,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:00:13,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:00:13,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:00:13,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:00:13,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:00:13,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:00:13,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:00:13,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:00:13,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:00:13,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:00:13,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:00:13,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:00:13,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:00:13,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:00:13,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:00:13,118 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:00:13,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:00:13,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:00:13,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:00:13,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:00:13,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:00:13,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:00:13,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:00:13,129 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:00:13,129 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:00:13,129 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:00:13,130 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:00:13,130 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:00:13,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:00:13,130 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:00:13,131 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:00:13,131 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:00:13,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:00:13,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:00:13,131 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:00:13,131 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:00:13,131 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:00:13,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:00:13,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:00:13,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:00:13,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:00:13,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:00:13,132 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:00:13,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:00:13,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:00:13,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:00:13,133 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:00:13,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:00:13,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:00:13,134 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:00:13,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:00:13,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:00:13,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:00:13,134 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:00:13,135 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:00:13,135 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:00:13,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:00:13,178 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:00:13,181 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:00:13,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:00:13,182 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:00:13,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-01-24 17:00:13,338 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:00:13,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:00:13,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:00:13,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:00:13,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:00:13,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428be157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13, skipping insertion in model container [2018-01-24 17:00:13,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,364 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:00:13,403 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:00:13,526 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:00:13,551 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:00:13,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13 WrapperNode [2018-01-24 17:00:13,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:00:13,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:00:13,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:00:13,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:00:13,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... [2018-01-24 17:00:13,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:00:13,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:00:13,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:00:13,608 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:00:13,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:00:13,671 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:00:13,671 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:00:13,671 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 17:00:13,672 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-24 17:00:13,672 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-24 17:00:13,672 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-24 17:00:13,672 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-24 17:00:13,672 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-24 17:00:13,672 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-24 17:00:13,672 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-24 17:00:13,673 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:00:13,673 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:00:13,673 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:00:13,673 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:00:13,673 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:00:13,673 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:00:13,674 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:00:13,674 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:00:13,674 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:00:13,674 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 17:00:13,674 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:00:13,674 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 17:00:13,675 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-24 17:00:13,675 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-24 17:00:13,675 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-24 17:00:13,675 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-24 17:00:13,675 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-24 17:00:13,675 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-24 17:00:13,676 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-24 17:00:13,676 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:00:13,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:00:13,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:00:14,101 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:00:14,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:00:14 BoogieIcfgContainer [2018-01-24 17:00:14,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:00:14,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:00:14,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:00:14,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:00:14,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:00:13" (1/3) ... [2018-01-24 17:00:14,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d8e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:00:14, skipping insertion in model container [2018-01-24 17:00:14,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:00:13" (2/3) ... [2018-01-24 17:00:14,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d8e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:00:14, skipping insertion in model container [2018-01-24 17:00:14,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:00:14" (3/3) ... [2018-01-24 17:00:14,108 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_true-valid-memsafety.i [2018-01-24 17:00:14,114 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:00:14,121 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-24 17:00:14,160 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:00:14,160 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:00:14,160 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:00:14,160 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:00:14,160 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:00:14,161 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:00:14,161 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:00:14,161 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:00:14,162 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:00:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-01-24 17:00:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 17:00:14,186 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:14,186 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:14,187 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311652, now seen corresponding path program 1 times [2018-01-24 17:00:14,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:14,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:14,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:14,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:14,232 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:14,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:14,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:14,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:00:14,380 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:14,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:00:14,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:00:14,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:00:14,400 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2018-01-24 17:00:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:14,591 INFO L93 Difference]: Finished difference Result 226 states and 257 transitions. [2018-01-24 17:00:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:00:14,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 17:00:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:14,600 INFO L225 Difference]: With dead ends: 226 [2018-01-24 17:00:14,600 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 17:00:14,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:00:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 17:00:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-24 17:00:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 17:00:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-24 17:00:14,644 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 7 [2018-01-24 17:00:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:14,645 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-24 17:00:14,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:00:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-24 17:00:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 17:00:14,646 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:14,646 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:14,646 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:14,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311651, now seen corresponding path program 1 times [2018-01-24 17:00:14,647 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:14,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:14,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:14,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:14,648 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:14,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:14,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:14,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:00:14,713 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:14,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:00:14,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:00:14,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:00:14,715 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 3 states. [2018-01-24 17:00:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:14,848 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-24 17:00:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:00:14,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 17:00:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:14,851 INFO L225 Difference]: With dead ends: 115 [2018-01-24 17:00:14,851 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 17:00:14,852 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:00:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 17:00:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 17:00:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 17:00:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-24 17:00:14,866 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 7 [2018-01-24 17:00:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:14,867 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-24 17:00:14,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:00:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-24 17:00:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:00:14,867 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:14,867 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:14,867 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -491558478, now seen corresponding path program 1 times [2018-01-24 17:00:14,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:14,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:14,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:14,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:14,869 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:14,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:14,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:14,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:00:14,948 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:14,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:00:14,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:00:14,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:00:14,949 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-24 17:00:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:15,237 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-01-24 17:00:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:00:15,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:00:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:15,241 INFO L225 Difference]: With dead ends: 123 [2018-01-24 17:00:15,241 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 17:00:15,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:00:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 17:00:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-01-24 17:00:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 17:00:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-01-24 17:00:15,255 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 19 [2018-01-24 17:00:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:15,255 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-01-24 17:00:15,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:00:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-01-24 17:00:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:00:15,256 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:15,256 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:15,256 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -491558477, now seen corresponding path program 1 times [2018-01-24 17:00:15,257 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:15,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:15,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,258 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:15,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:15,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:15,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:00:15,405 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:15,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:00:15,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:00:15,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:00:15,406 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 6 states. [2018-01-24 17:00:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:15,568 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-01-24 17:00:15,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:00:15,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:00:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:15,570 INFO L225 Difference]: With dead ends: 119 [2018-01-24 17:00:15,570 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 17:00:15,570 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:00:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 17:00:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-01-24 17:00:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 17:00:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-24 17:00:15,582 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 19 [2018-01-24 17:00:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:15,582 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-24 17:00:15,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:00:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-24 17:00:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:00:15,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:15,583 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:15,583 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:15,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309148, now seen corresponding path program 1 times [2018-01-24 17:00:15,584 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:15,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:15,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:15,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:15,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:15,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:00:15,665 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:15,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:00:15,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:00:15,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:00:15,666 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 4 states. [2018-01-24 17:00:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:15,781 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-24 17:00:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:00:15,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 17:00:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:15,782 INFO L225 Difference]: With dead ends: 115 [2018-01-24 17:00:15,782 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 17:00:15,783 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:00:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 17:00:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 17:00:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 17:00:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-01-24 17:00:15,791 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 27 [2018-01-24 17:00:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:15,792 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-01-24 17:00:15,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:00:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-01-24 17:00:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:00:15,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:15,793 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:15,794 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309147, now seen corresponding path program 1 times [2018-01-24 17:00:15,794 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:15,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:15,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,796 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:15,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:15,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:15,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:00:15,897 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:15,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:00:15,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:00:15,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:00:15,898 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 4 states. [2018-01-24 17:00:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:15,961 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-24 17:00:15,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:00:15,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 17:00:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:15,963 INFO L225 Difference]: With dead ends: 114 [2018-01-24 17:00:15,963 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 17:00:15,963 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:00:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 17:00:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 17:00:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 17:00:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-24 17:00:15,972 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 27 [2018-01-24 17:00:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:15,973 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-24 17:00:15,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:00:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-24 17:00:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 17:00:15,974 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:15,974 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:15,974 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:15,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2044398882, now seen corresponding path program 1 times [2018-01-24 17:00:15,974 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:15,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:15,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:15,975 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:16,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:16,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:16,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:00:16,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:16,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:00:16,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:00:16,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:00:16,130 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 9 states. [2018-01-24 17:00:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:16,392 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-01-24 17:00:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:00:16,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 17:00:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:16,394 INFO L225 Difference]: With dead ends: 121 [2018-01-24 17:00:16,394 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 17:00:16,394 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:00:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 17:00:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-01-24 17:00:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 17:00:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-01-24 17:00:16,402 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-01-24 17:00:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:16,402 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-01-24 17:00:16,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:00:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-01-24 17:00:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 17:00:16,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:16,404 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:16,404 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2044398883, now seen corresponding path program 1 times [2018-01-24 17:00:16,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:16,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:16,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:16,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:16,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:16,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:16,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:16,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 17:00:16,971 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:16,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:00:16,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:00:16,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:00:16,972 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 11 states. [2018-01-24 17:00:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:17,379 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-01-24 17:00:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:00:17,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 17:00:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:17,380 INFO L225 Difference]: With dead ends: 142 [2018-01-24 17:00:17,381 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 17:00:17,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:00:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 17:00:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-01-24 17:00:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 17:00:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-01-24 17:00:17,389 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 30 [2018-01-24 17:00:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:17,389 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-01-24 17:00:17,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:00:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-01-24 17:00:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:00:17,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:17,390 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:17,390 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2050970924, now seen corresponding path program 1 times [2018-01-24 17:00:17,391 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:17,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:17,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:17,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:17,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:17,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:17,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:17,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:00:17,483 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:17,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:00:17,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:00:17,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:00:17,484 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 5 states. [2018-01-24 17:00:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:17,636 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-24 17:00:17,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:00:17,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 17:00:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:17,637 INFO L225 Difference]: With dead ends: 139 [2018-01-24 17:00:17,637 INFO L226 Difference]: Without dead ends: 138 [2018-01-24 17:00:17,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:00:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-24 17:00:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-24 17:00:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 17:00:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2018-01-24 17:00:17,648 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 33 [2018-01-24 17:00:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:17,649 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2018-01-24 17:00:17,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:00:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-01-24 17:00:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 17:00:17,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:17,650 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:17,650 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:17,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2050970925, now seen corresponding path program 1 times [2018-01-24 17:00:17,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:17,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:17,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:17,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:17,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:17,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:17,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:17,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 17:00:17,830 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:17,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:00:17,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:00:17,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:00:17,831 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 13 states. [2018-01-24 17:00:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:18,086 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2018-01-24 17:00:18,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:00:18,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 17:00:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:18,088 INFO L225 Difference]: With dead ends: 153 [2018-01-24 17:00:18,088 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 17:00:18,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-24 17:00:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 17:00:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2018-01-24 17:00:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-24 17:00:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-01-24 17:00:18,097 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 33 [2018-01-24 17:00:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:18,098 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-01-24 17:00:18,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:00:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-01-24 17:00:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:00:18,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:18,099 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:18,099 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash -844410822, now seen corresponding path program 1 times [2018-01-24 17:00:18,099 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:18,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:18,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:18,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:18,101 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:18,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:18,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:18,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:00:18,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:18,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:00:18,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:00:18,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:00:18,173 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 7 states. [2018-01-24 17:00:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:18,343 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-01-24 17:00:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:00:18,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 17:00:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:18,346 INFO L225 Difference]: With dead ends: 151 [2018-01-24 17:00:18,346 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 17:00:18,347 INFO L525 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-01-24 17:00:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 17:00:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-01-24 17:00:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 17:00:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-01-24 17:00:18,357 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 34 [2018-01-24 17:00:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:18,358 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-01-24 17:00:18,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:00:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-01-24 17:00:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:00:18,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:18,359 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:18,359 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash -844410821, now seen corresponding path program 1 times [2018-01-24 17:00:18,359 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:18,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:18,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:18,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:18,361 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:18,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:18,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:18,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:00:18,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:18,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:00:18,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:00:18,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:00:18,551 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 8 states. [2018-01-24 17:00:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:18,881 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-01-24 17:00:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:00:18,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-24 17:00:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:18,882 INFO L225 Difference]: With dead ends: 149 [2018-01-24 17:00:18,883 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 17:00:18,883 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:00:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 17:00:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2018-01-24 17:00:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 17:00:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-01-24 17:00:18,898 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 34 [2018-01-24 17:00:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:18,898 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-01-24 17:00:18,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:00:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-01-24 17:00:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 17:00:18,899 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:18,900 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:18,900 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash 270018269, now seen corresponding path program 1 times [2018-01-24 17:00:18,901 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:18,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:18,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:18,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:18,902 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:18,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:19,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:19,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 17:00:19,219 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:19,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:00:19,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:00:19,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:00:19,220 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 17 states. [2018-01-24 17:00:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:19,701 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2018-01-24 17:00:19,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 17:00:19,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 17:00:19,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:19,703 INFO L225 Difference]: With dead ends: 178 [2018-01-24 17:00:19,704 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 17:00:19,704 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 17:00:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 17:00:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-01-24 17:00:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-24 17:00:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2018-01-24 17:00:19,721 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 36 [2018-01-24 17:00:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:19,722 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2018-01-24 17:00:19,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:00:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2018-01-24 17:00:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 17:00:19,723 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:19,723 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:00:19,723 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:19,723 INFO L82 PathProgramCache]: Analyzing trace with hash 270018270, now seen corresponding path program 1 times [2018-01-24 17:00:19,723 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:19,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:19,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:19,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:19,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:19,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:20,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:00:20,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 17:00:20,218 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:20,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:00:20,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:00:20,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:00:20,219 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand 17 states. [2018-01-24 17:00:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:20,877 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2018-01-24 17:00:20,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 17:00:20,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 17:00:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:20,879 INFO L225 Difference]: With dead ends: 182 [2018-01-24 17:00:20,879 INFO L226 Difference]: Without dead ends: 181 [2018-01-24 17:00:20,880 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 17:00:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-24 17:00:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-01-24 17:00:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 17:00:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-01-24 17:00:20,894 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 36 [2018-01-24 17:00:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:20,894 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-01-24 17:00:20,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:00:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-01-24 17:00:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 17:00:20,896 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:20,896 INFO L322 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] [2018-01-24 17:00:20,896 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2076004954, now seen corresponding path program 1 times [2018-01-24 17:00:20,896 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:20,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:20,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:20,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:20,897 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:20,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:21,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:00:21,078 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:00:21,078 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-24 17:00:21,080 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [13], [14], [15], [16], [21], [23], [27], [55], [56], [57], [59], [65], [68], [71], [77], [78], [79], [82], [92], [93], [97], [98], [128], [129], [130], [134], [147], [148], [149], [154], [163], [164], [165], [166], [167], [171], [172], [177], [179], [180], [181], [185], [186], [187] [2018-01-24 17:00:21,123 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:00:21,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:00:21,525 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:00:21,527 INFO L268 AbstractInterpreter]: Visited 49 different actions 79 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-24 17:00:21,542 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:00:21,748 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 86.78% of their original sizes. [2018-01-24 17:00:21,748 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:00:23,283 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:00:23,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:00:23,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [11] total 47 [2018-01-24 17:00:23,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:00:23,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 17:00:23,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 17:00:23,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 17:00:23,286 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 38 states. [2018-01-24 17:00:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:00:35,110 INFO L93 Difference]: Finished difference Result 252 states and 280 transitions. [2018-01-24 17:00:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-24 17:00:35,110 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2018-01-24 17:00:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:00:35,112 INFO L225 Difference]: With dead ends: 252 [2018-01-24 17:00:35,112 INFO L226 Difference]: Without dead ends: 251 [2018-01-24 17:00:35,113 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 85 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=328, Invalid=5074, Unknown=0, NotChecked=0, Total=5402 [2018-01-24 17:00:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-01-24 17:00:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2018-01-24 17:00:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-24 17:00:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-01-24 17:00:35,147 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 50 [2018-01-24 17:00:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:00:35,147 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-01-24 17:00:35,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 17:00:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-01-24 17:00:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 17:00:35,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:00:35,149 INFO L322 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] [2018-01-24 17:00:35,149 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 17:00:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2076004955, now seen corresponding path program 1 times [2018-01-24 17:00:35,150 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:00:35,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:35,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:35,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:00:35,151 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:00:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:35,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:00:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:35,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:00:35,618 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:00:35,619 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-24 17:00:35,619 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [13], [14], [15], [16], [21], [23], [27], [55], [56], [58], [59], [65], [68], [71], [77], [78], [79], [82], [92], [93], [97], [98], [128], [129], [130], [134], [147], [148], [149], [154], [163], [164], [165], [166], [167], [171], [172], [177], [179], [180], [181], [185], [186], [187] [2018-01-24 17:00:35,621 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:00:35,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:00:35,785 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:00:35,785 INFO L268 AbstractInterpreter]: Visited 49 different actions 79 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-24 17:00:35,796 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:00:35,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:00:35,797 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:00:35,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:00:35,808 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:00:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:00:35,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:00:35,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:00:35,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:00:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:00:35,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 17:00:36,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:00:36,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:00:36,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 17:00:36,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:00:36,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:00:36,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-24 17:00:36,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:00:36,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:00:36,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 17:00:36,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:00:36,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:00:36,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-01-24 17:00:36,288 WARN L1029 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|)))) is different from true [2018-01-24 17:00:36,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:00:36,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 17:00:36,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:00:36,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:00:36,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-01-24 17:00:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:00:36,485 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:00:36,642 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:00:36,643 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:00:36,643 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 18 treesize of output 9 [2018-01-24 17:00:36,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:00:36,652 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:00:36,652 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:00:36,652 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 23 treesize of output 14 [2018-01-24 17:00:36,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:00:36,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:00:36,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:20 [2018-01-24 17:00:55,521 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-01-24 17:00:55,557 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 93631 column 11: unknown constant v_insert_sub_~sub~10.base_14 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:582) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:200) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:667) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:759) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 17:00:55,559 INFO L168 Benchmark]: Toolchain (without parser) took 42220.47 ms. Allocated memory was 302.0 MB in the beginning and 914.9 MB in the end (delta: 612.9 MB). Free memory was 262.0 MB in the beginning and 788.4 MB in the end (delta: -526.3 MB). Peak memory consumption was 86.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:00:55,560 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:00:55,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.97 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 17:00:55,560 INFO L168 Benchmark]: Boogie Preprocessor took 43.49 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:00:55,561 INFO L168 Benchmark]: RCFGBuilder took 494.36 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 217.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:00:55,561 INFO L168 Benchmark]: TraceAbstraction took 41455.62 ms. Allocated memory was 302.0 MB in the beginning and 914.9 MB in the end (delta: 612.9 MB). Free memory was 216.1 MB in the beginning and 788.4 MB in the end (delta: -572.3 MB). Peak memory consumption was 40.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:00:55,563 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.12 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.97 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.49 ms. Allocated memory is still 302.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 494.36 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 217.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 41455.62 ms. Allocated memory was 302.0 MB in the beginning and 914.9 MB in the end (delta: 612.9 MB). Free memory was 216.1 MB in the beginning and 788.4 MB in the end (delta: -572.3 MB). Peak memory consumption was 40.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 552 LocStat_NO_SUPPORTING_DISEQUALITIES : 178 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 65 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 155 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 67 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.027021 RENAME_VARIABLES(MILLISECONDS) : 0.102948 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001078 PROJECTAWAY(MILLISECONDS) : 0.038855 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001404 DISJOIN(MILLISECONDS) : 0.168864 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.122803 ADD_EQUALITY(MILLISECONDS) : 0.024711 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016427 #CONJOIN_DISJUNCTIVE : 125 #RENAME_VARIABLES : 209 #UNFREEZE : 0 #CONJOIN : 308 #PROJECTAWAY : 185 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 30 #RENAME_VARIABLES_DISJUNCTIVE : 206 #ADD_EQUALITY : 192 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 48 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 562 LocStat_NO_SUPPORTING_DISEQUALITIES : 180 LocStat_NO_DISJUNCTIONS : -96 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 65 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 157 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 68 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.018479 RENAME_VARIABLES(MILLISECONDS) : 0.065692 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001055 PROJECTAWAY(MILLISECONDS) : 0.039309 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001442 DISJOIN(MILLISECONDS) : 0.211056 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.083802 ADD_EQUALITY(MILLISECONDS) : 0.015318 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003764 #CONJOIN_DISJUNCTIVE : 125 #RENAME_VARIABLES : 211 #UNFREEZE : 0 #CONJOIN : 310 #PROJECTAWAY : 190 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 206 #ADD_EQUALITY : 194 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 93631 column 11: unknown constant v_insert_sub_~sub~10.base_14 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 93631 column 11: unknown constant v_insert_sub_~sub~10.base_14: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-00-55-575.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-00-55-575.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-00-55-575.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-00-55-575.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-00-55-575.csv Received shutdown request...