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_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:00:16,419 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:00:16,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:00:16,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:00:16,436 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:00:16,437 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:00:16,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:00:16,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:00:16,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:00:16,443 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:00:16,444 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:00:16,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:00:16,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:00:16,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:00:16,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:00:16,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:00:16,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:00:16,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:00:16,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:00:16,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:00:16,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:00:16,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:00:16,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:00:16,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:00:16,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:00:16,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:00:16,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:00:16,464 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:00:16,464 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:00:16,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:00:16,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:00:16,465 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 03:00:16,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:00:16,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:00:16,486 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:00:16,486 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:00:16,486 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:00:16,487 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:00:16,487 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:00:16,487 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:00:16,487 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:00:16,488 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:00:16,488 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:00:16,488 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:00:16,488 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:00:16,489 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:00:16,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:00:16,489 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:00:16,489 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:00:16,489 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:00:16,489 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:00:16,490 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:00:16,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:00:16,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:00:16,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:00:16,490 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:00:16,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:00:16,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:00:16,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:00:16,491 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:00:16,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:00:16,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:00:16,492 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:00:16,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:00:16,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:00:16,492 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:00:16,492 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:00:16,493 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:00:16,494 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:00:16,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:00:16,547 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:00:16,552 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:00:16,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:00:16,554 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:00:16,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_true-valid-memsafety.i [2018-01-25 03:00:16,754 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:00:16,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:00:16,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:00:16,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:00:16,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:00:16,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:00:16" (1/1) ... [2018-01-25 03:00:16,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a45686f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:16, skipping insertion in model container [2018-01-25 03:00:16,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:00:16" (1/1) ... [2018-01-25 03:00:16,796 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:00:16,841 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:00:16,971 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:00:16,991 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:00:17,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17 WrapperNode [2018-01-25 03:00:17,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:00:17,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:00:17,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:00:17,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:00:17,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (1/1) ... [2018-01-25 03:00:17,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (1/1) ... [2018-01-25 03:00:17,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (1/1) ... [2018-01-25 03:00:17,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (1/1) ... [2018-01-25 03:00:17,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (1/1) ... [2018-01-25 03:00:17,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (1/1) ... [2018-01-25 03:00:17,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (1/1) ... [2018-01-25 03:00:17,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:00:17,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:00:17,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:00:17,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:00:17,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (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 03:00:17,112 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:00:17,113 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:00:17,113 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-25 03:00:17,113 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-25 03:00:17,113 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-25 03:00:17,113 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-25 03:00:17,113 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-25 03:00:17,114 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-25 03:00:17,114 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-25 03:00:17,114 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-25 03:00:17,114 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:00:17,114 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:00:17,114 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:00:17,115 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:00:17,115 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:00:17,115 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:00:17,115 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:00:17,115 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:00:17,115 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:00:17,116 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 03:00:17,116 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:00:17,116 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-25 03:00:17,116 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-25 03:00:17,116 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-25 03:00:17,116 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-25 03:00:17,117 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-25 03:00:17,117 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-25 03:00:17,117 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-25 03:00:17,117 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-25 03:00:17,117 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:00:17,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:00:17,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:00:17,992 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:00:17,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:00:17 BoogieIcfgContainer [2018-01-25 03:00:17,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:00:17,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:00:17,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:00:17,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:00:17,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:00:16" (1/3) ... [2018-01-25 03:00:18,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1c82b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:00:18, skipping insertion in model container [2018-01-25 03:00:18,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:17" (2/3) ... [2018-01-25 03:00:18,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1c82b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:00:18, skipping insertion in model container [2018-01-25 03:00:18,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:00:17" (3/3) ... [2018-01-25 03:00:18,004 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_true-valid-memsafety.i [2018-01-25 03:00:18,017 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:00:18,031 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-25 03:00:18,113 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:00:18,114 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:00:18,114 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:00:18,114 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:00:18,114 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:00:18,114 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:00:18,115 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:00:18,115 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:00:18,116 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:00:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-01-25 03:00:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:00:18,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:18,174 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:18,175 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 03:00:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311652, now seen corresponding path program 1 times [2018-01-25 03:00:18,188 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:18,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:18,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:18,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:18,262 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:18,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:18,517 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 03:00:18,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:18,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:00:18,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:18,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:00:18,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:00:18,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:00:18,538 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2018-01-25 03:00:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:18,854 INFO L93 Difference]: Finished difference Result 226 states and 257 transitions. [2018-01-25 03:00:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:00:18,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:00:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:18,865 INFO L225 Difference]: With dead ends: 226 [2018-01-25 03:00:18,865 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 03:00:18,869 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 03:00:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 03:00:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-01-25 03:00:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 03:00:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-25 03:00:18,930 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 7 [2018-01-25 03:00:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:18,931 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-25 03:00:18,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:00:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-25 03:00:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:00:18,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:18,932 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:18,932 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 03:00:18,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2078311651, now seen corresponding path program 1 times [2018-01-25 03:00:18,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:18,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:18,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:18,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:18,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:18,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:19,011 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 03:00:19,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:19,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:00:19,011 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:19,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:00:19,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:00:19,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:00:19,013 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 3 states. [2018-01-25 03:00:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:19,180 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-25 03:00:19,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:00:19,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:00:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:19,182 INFO L225 Difference]: With dead ends: 115 [2018-01-25 03:00:19,182 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 03:00:19,183 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 03:00:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 03:00:19,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-25 03:00:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 03:00:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-25 03:00:19,193 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 7 [2018-01-25 03:00:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:19,194 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-25 03:00:19,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:00:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-25 03:00:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:00:19,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:19,195 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 03:00:19,195 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 03:00:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash -491558478, now seen corresponding path program 1 times [2018-01-25 03:00:19,195 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:19,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:19,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:19,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:19,196 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:19,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:19,320 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 03:00:19,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:19,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:00:19,321 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:19,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:00:19,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:00:19,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:00:19,322 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-25 03:00:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:19,748 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-01-25 03:00:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:00:19,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:00:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:19,754 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:00:19,754 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 03:00:19,754 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 03:00:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 03:00:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-01-25 03:00:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 03:00:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-01-25 03:00:19,771 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 19 [2018-01-25 03:00:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:19,771 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-01-25 03:00:19,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:00:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-01-25 03:00:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:00:19,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:19,773 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 03:00:19,773 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 03:00:19,773 INFO L82 PathProgramCache]: Analyzing trace with hash -491558477, now seen corresponding path program 1 times [2018-01-25 03:00:19,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:19,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:19,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:19,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:19,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:19,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:19,928 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 03:00:19,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:19,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:00:19,929 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:19,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:00:19,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:00:19,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:00:19,930 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 6 states. [2018-01-25 03:00:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:20,082 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-01-25 03:00:20,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:00:20,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:00:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:20,083 INFO L225 Difference]: With dead ends: 119 [2018-01-25 03:00:20,083 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 03:00:20,084 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 03:00:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 03:00:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-01-25 03:00:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 03:00:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-25 03:00:20,093 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 19 [2018-01-25 03:00:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:20,093 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-25 03:00:20,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:00:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-25 03:00:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:00:20,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:20,094 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 03:00:20,094 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 03:00:20,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309148, now seen corresponding path program 1 times [2018-01-25 03:00:20,095 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:20,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:20,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:20,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:20,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:20,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:20,184 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 03:00:20,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:20,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:00:20,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:20,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:00:20,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:00:20,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:00:20,185 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 4 states. [2018-01-25 03:00:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:20,297 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-25 03:00:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:00:20,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 03:00:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:20,298 INFO L225 Difference]: With dead ends: 115 [2018-01-25 03:00:20,299 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 03:00:20,299 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 03:00:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 03:00:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 03:00:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 03:00:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-01-25 03:00:20,307 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 27 [2018-01-25 03:00:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:20,307 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-01-25 03:00:20,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:00:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-01-25 03:00:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:00:20,308 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:20,308 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 03:00:20,308 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 03:00:20,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1908309147, now seen corresponding path program 1 times [2018-01-25 03:00:20,309 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:20,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:20,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:20,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:20,310 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:20,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:20,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:20,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:00:20,406 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:20,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:00:20,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:00:20,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:00:20,407 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 4 states. [2018-01-25 03:00:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:20,477 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-25 03:00:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:00:20,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 03:00:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:20,479 INFO L225 Difference]: With dead ends: 114 [2018-01-25 03:00:20,479 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 03:00:20,479 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 03:00:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 03:00:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-25 03:00:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 03:00:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-25 03:00:20,489 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 27 [2018-01-25 03:00:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:20,490 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-25 03:00:20,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:00:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-25 03:00:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:00:20,491 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:20,491 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 03:00:20,491 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 03:00:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2044398882, now seen corresponding path program 1 times [2018-01-25 03:00:20,492 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:20,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:20,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:20,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:20,493 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:20,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:20,611 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 03:00:20,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:20,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:00:20,612 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:20,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:00:20,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:00:20,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:00:20,613 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 9 states. [2018-01-25 03:00:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:21,109 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-01-25 03:00:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:00:21,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 03:00:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:21,111 INFO L225 Difference]: With dead ends: 121 [2018-01-25 03:00:21,111 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 03:00:21,111 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 03:00:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 03:00:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-01-25 03:00:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:00:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-01-25 03:00:21,122 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-01-25 03:00:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:21,123 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-01-25 03:00:21,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:00:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-01-25 03:00:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:00:21,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:21,124 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 03:00:21,124 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 03:00:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2044398883, now seen corresponding path program 1 times [2018-01-25 03:00:21,125 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:21,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:21,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:21,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:21,126 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:21,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:21,856 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 03:00:21,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:21,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:00:21,856 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:21,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 03:00:21,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 03:00:21,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:00:21,858 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 11 states. [2018-01-25 03:00:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:22,881 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-01-25 03:00:22,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:00:22,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-25 03:00:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:22,884 INFO L225 Difference]: With dead ends: 142 [2018-01-25 03:00:22,884 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 03:00:22,885 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:00:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 03:00:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-01-25 03:00:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-25 03:00:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-01-25 03:00:22,902 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 30 [2018-01-25 03:00:22,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:22,903 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-01-25 03:00:22,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 03:00:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-01-25 03:00:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:00:22,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:22,904 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 03:00:22,905 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 03:00:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2050970924, now seen corresponding path program 1 times [2018-01-25 03:00:22,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:22,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:22,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:22,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:22,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:22,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:23,107 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 03:00:23,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:23,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:00:23,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:23,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:00:23,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:00:23,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:00:23,109 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 5 states. [2018-01-25 03:00:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:23,408 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-25 03:00:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:00:23,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 03:00:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:23,410 INFO L225 Difference]: With dead ends: 139 [2018-01-25 03:00:23,410 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 03:00:23,411 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 03:00:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 03:00:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-01-25 03:00:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 03:00:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2018-01-25 03:00:23,433 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 33 [2018-01-25 03:00:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:23,433 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2018-01-25 03:00:23,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:00:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-01-25 03:00:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:00:23,435 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:23,435 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 03:00:23,435 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 03:00:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2050970925, now seen corresponding path program 1 times [2018-01-25 03:00:23,436 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:23,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:23,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:23,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:23,437 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:23,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:24,093 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 03:00:24,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:24,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 03:00:24,093 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:24,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:00:24,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:00:24,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:00:24,094 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 13 states. [2018-01-25 03:00:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:25,017 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2018-01-25 03:00:25,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:00:25,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-25 03:00:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:25,022 INFO L225 Difference]: With dead ends: 153 [2018-01-25 03:00:25,023 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 03:00:25,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-25 03:00:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 03:00:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2018-01-25 03:00:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-25 03:00:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-01-25 03:00:25,039 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 33 [2018-01-25 03:00:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:25,039 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-01-25 03:00:25,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:00:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-01-25 03:00:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:00:25,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:25,041 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 03:00:25,041 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 03:00:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash -844410822, now seen corresponding path program 1 times [2018-01-25 03:00:25,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:25,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:25,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:25,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:25,043 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:25,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:25,237 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 03:00:25,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:25,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:00:25,237 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:25,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:00:25,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:00:25,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:00:25,238 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 7 states. [2018-01-25 03:00:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:25,812 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-01-25 03:00:25,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:00:25,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-25 03:00:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:25,814 INFO L225 Difference]: With dead ends: 151 [2018-01-25 03:00:25,814 INFO L226 Difference]: Without dead ends: 149 [2018-01-25 03:00:25,815 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:00:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-25 03:00:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-01-25 03:00:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 03:00:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-01-25 03:00:25,826 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 34 [2018-01-25 03:00:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:25,827 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-01-25 03:00:25,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:00:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-01-25 03:00:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:00:25,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:25,828 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 03:00:25,828 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 03:00:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash -844410821, now seen corresponding path program 1 times [2018-01-25 03:00:25,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:25,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:25,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:25,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:25,836 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:25,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:26,045 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 03:00:26,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:26,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:00:26,045 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:26,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:00:26,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:00:26,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:00:26,046 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 8 states. [2018-01-25 03:00:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:26,281 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-01-25 03:00:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:00:26,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-25 03:00:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:26,283 INFO L225 Difference]: With dead ends: 149 [2018-01-25 03:00:26,283 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 03:00:26,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:00:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 03:00:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2018-01-25 03:00:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 03:00:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-01-25 03:00:26,294 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 34 [2018-01-25 03:00:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:26,295 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-01-25 03:00:26,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:00:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-01-25 03:00:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 03:00:26,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:26,296 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 03:00:26,296 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 03:00:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 270018269, now seen corresponding path program 1 times [2018-01-25 03:00:26,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:26,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:26,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:26,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:26,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:26,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:26,606 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 03:00:26,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:26,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:00:26,607 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:26,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:00:26,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:00:26,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:00:26,608 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 17 states. [2018-01-25 03:00:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:27,026 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2018-01-25 03:00:27,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 03:00:27,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-25 03:00:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:27,028 INFO L225 Difference]: With dead ends: 178 [2018-01-25 03:00:27,028 INFO L226 Difference]: Without dead ends: 177 [2018-01-25 03:00:27,028 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 03:00:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-25 03:00:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-01-25 03:00:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-25 03:00:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2018-01-25 03:00:27,040 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 36 [2018-01-25 03:00:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:27,041 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2018-01-25 03:00:27,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:00:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2018-01-25 03:00:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 03:00:27,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:27,042 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 03:00:27,042 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 03:00:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash 270018270, now seen corresponding path program 1 times [2018-01-25 03:00:27,043 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:27,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:27,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:27,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:27,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:27,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:27,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:27,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:00:27,577 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:27,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:00:27,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:00:27,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:00:27,578 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand 17 states. [2018-01-25 03:00:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:28,737 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2018-01-25 03:00:28,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 03:00:28,737 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-25 03:00:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:28,738 INFO L225 Difference]: With dead ends: 182 [2018-01-25 03:00:28,739 INFO L226 Difference]: Without dead ends: 181 [2018-01-25 03:00:28,739 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-25 03:00:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-25 03:00:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-01-25 03:00:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-25 03:00:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-01-25 03:00:28,753 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 36 [2018-01-25 03:00:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:28,753 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-01-25 03:00:28,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:00:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-01-25 03:00:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-25 03:00:28,755 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:28,755 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 03:00:28,755 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 03:00:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2076004954, now seen corresponding path program 1 times [2018-01-25 03:00:28,755 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:28,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:28,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:28,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:28,757 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:28,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:28,872 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 03:00:28,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:00:28,872 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:00:28,873 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-25 03:00:28,874 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [13], [14], [15], [16], [21], [23], [27], [55], [56], [57], [59], [65], [68], [71], [77], [78], [79], [82], [92], [93], [97], [98], [128], [129], [130], [134], [147], [148], [149], [154], [163], [164], [165], [166], [167], [171], [172], [177], [179], [180], [181], [185], [186], [187] [2018-01-25 03:00:28,923 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:00:28,923 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