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_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:56:51,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:56:51,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:56:51,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:56:51,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:56:51,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:56:51,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:56:51,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:56:51,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:56:51,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:56:51,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:56:51,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:56:51,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:56:51,622 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:56:51,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:56:51,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:56:51,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:56:51,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:56:51,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:56:51,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:56:51,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:56:51,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:56:51,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:56:51,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:56:51,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:56:51,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:56:51,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:56:51,639 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:56:51,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:56:51,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:56:51,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:56:51,640 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_preciseopt.epf [2018-01-25 02:56:51,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:56:51,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:56:51,651 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:56:51,651 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:56:51,651 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:56:51,652 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:56:51,652 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:56:51,652 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:56:51,652 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:56:51,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:56:51,653 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:56:51,653 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:56:51,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:56:51,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:56:51,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:56:51,654 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:56:51,654 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:56:51,654 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:56:51,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:56:51,655 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:56:51,655 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:56:51,655 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:56:51,655 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:56:51,655 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:56:51,656 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:56:51,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:56:51,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:56:51,656 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:56:51,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:56:51,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:56:51,657 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:56:51,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:56:51,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:56:51,657 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:56:51,657 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:56:51,658 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:56:51,658 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:56:51,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:56:51,706 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:56:51,710 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:56:51,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:56:51,712 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:56:51,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-01-25 02:56:51,898 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:56:51,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:56:51,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:56:51,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:56:51,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:56:51,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:56:51" (1/1) ... [2018-01-25 02:56:51,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5977c944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:51, skipping insertion in model container [2018-01-25 02:56:51,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:56:51" (1/1) ... [2018-01-25 02:56:51,941 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:56:51,985 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:56:52,143 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:56:52,176 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:56:52,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52 WrapperNode [2018-01-25 02:56:52,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:56:52,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:56:52,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:56:52,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:56:52,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (1/1) ... [2018-01-25 02:56:52,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (1/1) ... [2018-01-25 02:56:52,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (1/1) ... [2018-01-25 02:56:52,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (1/1) ... [2018-01-25 02:56:52,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (1/1) ... [2018-01-25 02:56:52,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (1/1) ... [2018-01-25 02:56:52,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (1/1) ... [2018-01-25 02:56:52,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:56:52,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:56:52,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:56:52,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:56:52,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (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-25 02:56:52,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:56:52,306 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:56:52,306 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-25 02:56:52,307 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-25 02:56:52,307 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-25 02:56:52,307 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-25 02:56:52,307 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-25 02:56:52,307 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-25 02:56:52,307 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-25 02:56:52,308 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-25 02:56:52,308 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:56:52,308 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:56:52,308 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:56:52,308 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 02:56:52,308 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 02:56:52,308 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:56:52,309 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:56:52,309 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:56:52,309 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 02:56:52,309 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 02:56:52,309 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:56:52,310 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-25 02:56:52,310 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-25 02:56:52,310 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-25 02:56:52,310 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-25 02:56:52,310 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-25 02:56:52,310 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-25 02:56:52,310 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-25 02:56:52,311 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-25 02:56:52,311 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:56:52,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:56:52,311 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:56:52,787 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:56:52,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:56:52 BoogieIcfgContainer [2018-01-25 02:56:52,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:56:52,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:56:52,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:56:52,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:56:52,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:56:51" (1/3) ... [2018-01-25 02:56:52,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd8d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:56:52, skipping insertion in model container [2018-01-25 02:56:52,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:56:52" (2/3) ... [2018-01-25 02:56:52,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd8d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:56:52, skipping insertion in model container [2018-01-25 02:56:52,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:56:52" (3/3) ... [2018-01-25 02:56:52,794 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-25 02:56:52,801 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:56:52,808 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-25 02:56:52,857 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:56:52,857 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:56:52,857 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:56:52,857 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:56:52,858 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:56:52,858 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:56:52,858 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:56:52,858 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:56:52,859 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:56:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-25 02:56:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 02:56:52,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:52,885 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:56:52,885 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-25 02:56:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-01-25 02:56:52,891 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:52,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:52,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:52,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:52,934 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:52,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:53,052 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-25 02:56:53,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:53,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:56:53,056 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:53,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:56:53,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:56:53,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:56:53,163 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-01-25 02:56:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:53,295 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2018-01-25 02:56:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:56:53,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 02:56:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:53,308 INFO L225 Difference]: With dead ends: 224 [2018-01-25 02:56:53,308 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 02:56:53,313 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-25 02:56:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 02:56:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 02:56:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 02:56:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-25 02:56:53,379 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-01-25 02:56:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:53,380 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-25 02:56:53,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:56:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-25 02:56:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 02:56:53,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:53,381 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:56:53,381 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-25 02:56:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-01-25 02:56:53,381 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:53,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:53,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:53,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:53,384 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:53,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:53,478 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-25 02:56:53,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:53,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:56:53,478 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:53,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:56:53,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:56:53,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:56:53,480 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-01-25 02:56:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:53,621 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-25 02:56:53,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:56:53,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 02:56:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:53,624 INFO L225 Difference]: With dead ends: 114 [2018-01-25 02:56:53,624 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 02:56:53,625 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-25 02:56:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 02:56:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-25 02:56:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 02:56:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-25 02:56:53,639 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-01-25 02:56:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:53,639 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-25 02:56:53,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:56:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-25 02:56:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:56:53,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:53,640 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-25 02:56:53,641 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-25 02:56:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-01-25 02:56:53,641 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:53,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:53,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:53,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:53,643 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:53,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:53,749 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-25 02:56:53,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:53,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:56:53,750 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:53,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:56:53,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:56:53,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:56:53,751 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-01-25 02:56:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:54,158 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 02:56:54,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:56:54,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 02:56:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:54,162 INFO L225 Difference]: With dead ends: 122 [2018-01-25 02:56:54,162 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 02:56:54,163 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-25 02:56:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 02:56:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-01-25 02:56:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 02:56:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-25 02:56:54,179 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-01-25 02:56:54,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:54,179 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-25 02:56:54,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:56:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-25 02:56:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:56:54,180 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:54,180 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-25 02:56:54,181 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-25 02:56:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-01-25 02:56:54,181 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:54,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:54,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,183 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:54,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:54,298 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-25 02:56:54,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:54,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:56:54,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:54,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:56:54,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:56:54,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:56:54,299 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-25 02:56:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:54,454 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-25 02:56:54,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:56:54,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 02:56:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:54,456 INFO L225 Difference]: With dead ends: 118 [2018-01-25 02:56:54,456 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 02:56:54,457 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-25 02:56:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 02:56:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-25 02:56:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 02:56:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-25 02:56:54,468 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-01-25 02:56:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:54,468 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-25 02:56:54,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:56:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-25 02:56:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:56:54,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:54,469 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-25 02:56:54,469 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-25 02:56:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-01-25 02:56:54,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:54,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:54,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:54,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:54,559 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-25 02:56:54,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:54,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:56:54,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:54,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:56:54,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:56:54,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:56:54,561 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-01-25 02:56:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:54,656 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-25 02:56:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:56:54,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 02:56:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:54,658 INFO L225 Difference]: With dead ends: 114 [2018-01-25 02:56:54,658 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 02:56:54,659 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-25 02:56:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 02:56:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-25 02:56:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 02:56:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-25 02:56:54,668 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-01-25 02:56:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:54,668 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-25 02:56:54,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:56:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-25 02:56:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:56:54,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:54,670 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-25 02:56:54,670 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-25 02:56:54,670 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-01-25 02:56:54,670 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:54,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:54,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:54,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:54,780 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-25 02:56:54,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:54,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:56:54,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:54,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:56:54,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:56:54,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:56:54,781 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-25 02:56:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:54,872 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-25 02:56:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:56:54,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 02:56:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:54,874 INFO L225 Difference]: With dead ends: 113 [2018-01-25 02:56:54,874 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 02:56:54,875 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-25 02:56:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 02:56:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-25 02:56:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 02:56:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-25 02:56:54,885 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-01-25 02:56:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:54,885 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-25 02:56:54,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:56:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-25 02:56:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:56:54,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:54,887 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-25 02:56:54,887 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-25 02:56:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-01-25 02:56:54,887 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:54,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:54,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:54,889 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:54,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:55,050 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-25 02:56:55,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:55,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:56:55,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:55,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:56:55,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:56:55,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:56:55,051 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 9 states. [2018-01-25 02:56:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:55,309 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-25 02:56:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:56:55,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 02:56:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:55,311 INFO L225 Difference]: With dead ends: 120 [2018-01-25 02:56:55,311 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 02:56:55,311 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-25 02:56:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 02:56:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-01-25 02:56:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 02:56:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-25 02:56:55,320 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 30 [2018-01-25 02:56:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:55,320 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-25 02:56:55,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:56:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-25 02:56:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:56:55,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:55,322 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-25 02:56:55,322 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-25 02:56:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036197, now seen corresponding path program 1 times [2018-01-25 02:56:55,322 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:55,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:55,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:55,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:55,324 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:55,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:55,633 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-25 02:56:55,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:55,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:56:55,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:55,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:56:55,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:56:55,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:56:55,635 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 11 states. [2018-01-25 02:56:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:56,055 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-01-25 02:56:56,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:56:56,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-25 02:56:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:56,056 INFO L225 Difference]: With dead ends: 141 [2018-01-25 02:56:56,057 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 02:56:56,057 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:56:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 02:56:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-25 02:56:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 02:56:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-25 02:56:56,066 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 30 [2018-01-25 02:56:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:56,066 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-25 02:56:56,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:56:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-25 02:56:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:56:56,067 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:56,067 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-25 02:56:56,067 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-25 02:56:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 98146345, now seen corresponding path program 1 times [2018-01-25 02:56:56,068 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:56,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:56,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:56,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:56,070 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:56,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:56,289 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-25 02:56:56,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:56,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:56:56,290 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:56,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:56:56,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:56:56,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:56:56,291 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-01-25 02:56:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:56,432 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-01-25 02:56:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:56:56,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 02:56:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:56,434 INFO L225 Difference]: With dead ends: 138 [2018-01-25 02:56:56,434 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 02:56:56,434 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:56:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 02:56:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-25 02:56:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-25 02:56:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-01-25 02:56:56,443 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 33 [2018-01-25 02:56:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:56,444 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-01-25 02:56:56,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:56:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-01-25 02:56:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:56:56,444 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:56,444 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-25 02:56:56,445 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-25 02:56:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash 98146346, now seen corresponding path program 1 times [2018-01-25 02:56:56,445 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:56,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:56,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:56,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:56,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:56,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:56,604 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-25 02:56:56,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:56,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:56:56,605 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:56,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:56:56,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:56:56,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:56:56,606 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 13 states. [2018-01-25 02:56:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:57,121 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-01-25 02:56:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:56:57,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-25 02:56:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:57,122 INFO L225 Difference]: With dead ends: 152 [2018-01-25 02:56:57,122 INFO L226 Difference]: Without dead ends: 151 [2018-01-25 02:56:57,123 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-25 02:56:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-25 02:56:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-01-25 02:56:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 02:56:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-01-25 02:56:57,131 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 33 [2018-01-25 02:56:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:57,131 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-01-25 02:56:57,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:56:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-01-25 02:56:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 02:56:57,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:57,132 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-25 02:56:57,133 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-25 02:56:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430627, now seen corresponding path program 1 times [2018-01-25 02:56:57,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:57,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:57,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:57,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:57,134 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:57,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:57,212 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-25 02:56:57,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:57,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:56:57,212 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:57,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:56:57,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:56:57,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:56:57,213 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 7 states. [2018-01-25 02:56:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:57,455 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-25 02:56:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:56:57,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-25 02:56:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:57,457 INFO L225 Difference]: With dead ends: 150 [2018-01-25 02:56:57,457 INFO L226 Difference]: Without dead ends: 148 [2018-01-25 02:56:57,457 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-25 02:56:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-25 02:56:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-01-25 02:56:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 02:56:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-25 02:56:57,469 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 34 [2018-01-25 02:56:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:57,470 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-25 02:56:57,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:56:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-25 02:56:57,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 02:56:57,471 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:57,471 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-25 02:56:57,472 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-25 02:56:57,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430626, now seen corresponding path program 1 times [2018-01-25 02:56:57,472 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:57,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:57,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:57,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:57,473 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:57,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:57,878 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-25 02:56:57,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:57,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:56:57,879 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:57,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:56:57,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:56:57,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:56:57,880 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 8 states. [2018-01-25 02:56:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:58,257 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-01-25 02:56:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:56:58,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-25 02:56:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:58,259 INFO L225 Difference]: With dead ends: 148 [2018-01-25 02:56:58,259 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 02:56:58,260 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:56:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 02:56:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-25 02:56:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 02:56:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-25 02:56:58,270 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2018-01-25 02:56:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:58,271 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-25 02:56:58,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:56:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-25 02:56:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 02:56:58,272 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:58,272 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-25 02:56:58,272 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-25 02:56:58,272 INFO L82 PathProgramCache]: Analyzing trace with hash -994990400, now seen corresponding path program 1 times [2018-01-25 02:56:58,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:58,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:58,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:58,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:58,274 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:58,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:58,603 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-25 02:56:58,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:58,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 02:56:58,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:58,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 02:56:58,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 02:56:58,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:56:58,605 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-01-25 02:56:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:56:59,211 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-01-25 02:56:59,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 02:56:59,212 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-25 02:56:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:56:59,213 INFO L225 Difference]: With dead ends: 177 [2018-01-25 02:56:59,213 INFO L226 Difference]: Without dead ends: 176 [2018-01-25 02:56:59,214 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-25 02:56:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-25 02:56:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-01-25 02:56:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-25 02:56:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-01-25 02:56:59,230 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 36 [2018-01-25 02:56:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:56:59,230 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-01-25 02:56:59,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 02:56:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-01-25 02:56:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 02:56:59,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:56:59,232 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-25 02:56:59,232 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-25 02:56:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash -994990399, now seen corresponding path program 1 times [2018-01-25 02:56:59,232 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:56:59,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:59,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:56:59,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:56:59,234 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:56:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:56:59,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:56:59,892 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-25 02:56:59,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:56:59,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 02:56:59,892 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:56:59,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 02:56:59,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 02:56:59,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:56:59,893 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 17 states. [2018-01-25 02:57:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:00,746 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-01-25 02:57:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 02:57:00,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-25 02:57:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:00,748 INFO L225 Difference]: With dead ends: 181 [2018-01-25 02:57:00,748 INFO L226 Difference]: Without dead ends: 180 [2018-01-25 02:57:00,749 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-25 02:57:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-25 02:57:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-01-25 02:57:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-25 02:57:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-01-25 02:57:00,762 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 36 [2018-01-25 02:57:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:00,763 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-01-25 02:57:00,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 02:57:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-01-25 02:57:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-25 02:57:00,764 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:00,764 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-25 02:57:00,764 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-25 02:57:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash -315835362, now seen corresponding path program 1 times [2018-01-25 02:57:00,765 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:00,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:00,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:00,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:00,766 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:00,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:00,911 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-25 02:57:00,911 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:57:00,911 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:57:00,913 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-25 02:57:00,915 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], [127], [128], [129], [133], [146], [147], [148], [153], [162], [163], [164], [165], [166], [170], [171], [174], [176], [177], [178], [182], [183], [184] [2018-01-25 02:57:00,979 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:57:00,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown