java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:02:55,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:02:55,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:02:55,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:02:55,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:02:55,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:02:55,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:02:55,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:02:55,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:02:55,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:02:55,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:02:55,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:02:55,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:02:55,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:02:55,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:02:55,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:02:55,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:02:55,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:02:55,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:02:55,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:02:55,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:02:55,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:02:55,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:02:55,677 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:02:55,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:02:55,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:02:55,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:02:55,680 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:02:55,680 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:02:55,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:02:55,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:02:55,682 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:02:55,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:02:55,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:02:55,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:02:55,693 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:02:55,693 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:02:55,694 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:02:55,694 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:02:55,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:02:55,695 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:02:55,695 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:02:55,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:02:55,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:02:55,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:02:55,696 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:02:55,696 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:02:55,696 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:02:55,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:02:55,697 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:02:55,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:02:55,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:02:55,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:02:55,698 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:02:55,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:02:55,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:02:55,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:02:55,699 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:02:55,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:02:55,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:02:55,699 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:02:55,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:02:55,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:02:55,700 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:02:55,701 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:02:55,701 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:02:55,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:02:55,749 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:02:55,754 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:02:55,755 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:02:55,756 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:02:55,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-01-24 13:02:55,945 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:02:55,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:02:55,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:02:55,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:02:55,960 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:02:55,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:02:55" (1/1) ... [2018-01-24 13:02:55,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:55, skipping insertion in model container [2018-01-24 13:02:55,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:02:55" (1/1) ... [2018-01-24 13:02:55,984 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:02:56,026 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:02:56,160 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:02:56,181 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:02:56,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56 WrapperNode [2018-01-24 13:02:56,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:02:56,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:02:56,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:02:56,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:02:56,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... [2018-01-24 13:02:56,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... [2018-01-24 13:02:56,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... [2018-01-24 13:02:56,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... [2018-01-24 13:02:56,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... [2018-01-24 13:02:56,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... [2018-01-24 13:02:56,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... [2018-01-24 13:02:56,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:02:56,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:02:56,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:02:56,233 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:02:56,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:02:56,281 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:02:56,281 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:02:56,281 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 13:02:56,281 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-24 13:02:56,281 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-24 13:02:56,282 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-24 13:02:56,282 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-24 13:02:56,282 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-24 13:02:56,282 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-24 13:02:56,282 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-24 13:02:56,282 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:02:56,283 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:02:56,283 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:02:56,283 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:02:56,283 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:02:56,283 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:02:56,283 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:02:56,283 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:02:56,284 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:02:56,284 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 13:02:56,284 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:02:56,284 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 13:02:56,284 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-24 13:02:56,284 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-24 13:02:56,285 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-24 13:02:56,285 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-24 13:02:56,285 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-24 13:02:56,285 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-24 13:02:56,285 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-24 13:02:56,286 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:02:56,286 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:02:56,286 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:02:56,704 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:02:56,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:02:56 BoogieIcfgContainer [2018-01-24 13:02:56,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:02:56,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:02:56,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:02:56,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:02:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:02:55" (1/3) ... [2018-01-24 13:02:56,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522e3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:02:56, skipping insertion in model container [2018-01-24 13:02:56,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:02:56" (2/3) ... [2018-01-24 13:02:56,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522e3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:02:56, skipping insertion in model container [2018-01-24 13:02:56,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:02:56" (3/3) ... [2018-01-24 13:02:56,740 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-24 13:02:56,746 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:02:56,753 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-24 13:02:56,793 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:02:56,794 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:02:56,794 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:02:56,794 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:02:56,794 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:02:56,794 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:02:56,794 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:02:56,794 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:02:56,795 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:02:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-24 13:02:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:02:56,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:56,821 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:56,822 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:56,825 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-01-24 13:02:56,827 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:56,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:56,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:56,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:56,871 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:56,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:56,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:56,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:02:56,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:56,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:57,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:57,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:57,080 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-01-24 13:02:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:57,237 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2018-01-24 13:02:57,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:57,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:02:57,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:57,248 INFO L225 Difference]: With dead ends: 224 [2018-01-24 13:02:57,249 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 13:02:57,253 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 13:02:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 13:02:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:02:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 13:02:57,302 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-01-24 13:02:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:57,303 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 13:02:57,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 13:02:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:02:57,303 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:57,304 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:57,304 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-01-24 13:02:57,304 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:57,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:57,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,306 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:57,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:57,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:57,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:02:57,383 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:57,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:02:57,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:02:57,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:57,386 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-01-24 13:02:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:57,482 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 13:02:57,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:02:57,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:02:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:57,485 INFO L225 Difference]: With dead ends: 114 [2018-01-24 13:02:57,485 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 13:02:57,486 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:02:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 13:02:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 13:02:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 13:02:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 13:02:57,499 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-01-24 13:02:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:57,500 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 13:02:57,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:02:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 13:02:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:02:57,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:57,501 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:57,501 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:57,501 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-01-24 13:02:57,501 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:57,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:57,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,503 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:57,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:57,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:57,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:02:57,595 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:57,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:02:57,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:02:57,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:02:57,596 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-01-24 13:02:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:57,830 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-24 13:02:57,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:02:57,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:02:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:57,834 INFO L225 Difference]: With dead ends: 122 [2018-01-24 13:02:57,835 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 13:02:57,835 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:02:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 13:02:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-01-24 13:02:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 13:02:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-24 13:02:57,850 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-01-24 13:02:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:57,850 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-24 13:02:57,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:02:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-24 13:02:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:02:57,851 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:57,851 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:57,851 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-01-24 13:02:57,852 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:57,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:57,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:57,853 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:57,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:58,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:58,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:02:58,026 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:58,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:02:58,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:02:58,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:02:58,027 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-24 13:02:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:58,219 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-24 13:02:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:02:58,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:02:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:58,220 INFO L225 Difference]: With dead ends: 118 [2018-01-24 13:02:58,220 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 13:02:58,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:02:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 13:02:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-24 13:02:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:02:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 13:02:58,229 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-01-24 13:02:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:58,229 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 13:02:58,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:02:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 13:02:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:02:58,230 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:58,230 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:58,230 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-01-24 13:02:58,231 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:58,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:58,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:58,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:58,232 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:58,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:58,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:58,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:58,301 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:58,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:02:58,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:02:58,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:02:58,302 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-01-24 13:02:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:58,408 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 13:02:58,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:02:58,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 13:02:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:58,414 INFO L225 Difference]: With dead ends: 114 [2018-01-24 13:02:58,414 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 13:02:58,415 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 13:02:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 13:02:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 13:02:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-24 13:02:58,426 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-01-24 13:02:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:58,427 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-24 13:02:58,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:02:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-24 13:02:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:02:58,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:58,428 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:58,428 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-01-24 13:02:58,429 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:58,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:58,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:58,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:58,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:58,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:58,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:58,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:02:58,523 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:58,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:02:58,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:02:58,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:02:58,524 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-24 13:02:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:58,585 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-24 13:02:58,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:02:58,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 13:02:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:58,586 INFO L225 Difference]: With dead ends: 113 [2018-01-24 13:02:58,586 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 13:02:58,586 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 13:02:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 13:02:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 13:02:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 13:02:58,596 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-01-24 13:02:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:58,596 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 13:02:58,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:02:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 13:02:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:02:58,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:58,598 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:58,598 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-01-24 13:02:58,598 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:58,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:58,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:58,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:58,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:58,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:58,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:58,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:02:58,752 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:58,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:02:58,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:02:58,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:02:58,752 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 9 states. [2018-01-24 13:02:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:58,994 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-24 13:02:58,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:02:58,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 13:02:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:58,996 INFO L225 Difference]: With dead ends: 120 [2018-01-24 13:02:58,996 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 13:02:58,996 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:02:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 13:02:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-01-24 13:02:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 13:02:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-24 13:02:59,003 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 30 [2018-01-24 13:02:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:59,003 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-24 13:02:59,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:02:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-24 13:02:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:02:59,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:59,004 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:59,005 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:59,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036197, now seen corresponding path program 1 times [2018-01-24 13:02:59,005 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:59,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:59,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:59,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:59,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:59,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:59,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:59,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:02:59,368 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:59,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:02:59,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:02:59,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:02:59,369 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 11 states. [2018-01-24 13:02:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:59,710 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-01-24 13:02:59,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:02:59,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 13:02:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:59,711 INFO L225 Difference]: With dead ends: 141 [2018-01-24 13:02:59,711 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 13:02:59,712 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:02:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 13:02:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-24 13:02:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 13:02:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-24 13:02:59,720 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 30 [2018-01-24 13:02:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:02:59,721 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-24 13:02:59,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:02:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-24 13:02:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:02:59,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:02:59,722 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:02:59,722 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:02:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 98146345, now seen corresponding path program 1 times [2018-01-24 13:02:59,722 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:02:59,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:59,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:02:59,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:02:59,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:02:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:02:59,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:02:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:02:59,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:02:59,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:02:59,799 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:02:59,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:02:59,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:02:59,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:02:59,799 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-01-24 13:02:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:02:59,993 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-01-24 13:02:59,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:02:59,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 13:02:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:02:59,994 INFO L225 Difference]: With dead ends: 138 [2018-01-24 13:02:59,995 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 13:02:59,995 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:02:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 13:03:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 13:03:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 13:03:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-01-24 13:03:00,003 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 33 [2018-01-24 13:03:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:00,003 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-01-24 13:03:00,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:03:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-01-24 13:03:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:03:00,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:00,004 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:00,005 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:03:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash 98146346, now seen corresponding path program 1 times [2018-01-24 13:03:00,005 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:00,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:00,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:00,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:00,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:00,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:00,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:00,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 13:03:00,245 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:00,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:03:00,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:03:00,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:03:00,246 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 13 states. [2018-01-24 13:03:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:00,706 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-01-24 13:03:00,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:03:00,706 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 13:03:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:00,708 INFO L225 Difference]: With dead ends: 152 [2018-01-24 13:03:00,708 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 13:03:00,709 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-24 13:03:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 13:03:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-01-24 13:03:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 13:03:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-01-24 13:03:00,720 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 33 [2018-01-24 13:03:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:00,721 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-01-24 13:03:00,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:03:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-01-24 13:03:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:03:00,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:00,722 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:00,722 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:03:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430627, now seen corresponding path program 1 times [2018-01-24 13:03:00,722 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:00,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:00,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:00,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:00,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:00,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:00,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:00,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:03:00,821 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:00,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:03:00,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:03:00,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:03:00,822 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 7 states. [2018-01-24 13:03:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:01,110 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-24 13:03:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:03:01,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 13:03:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:01,112 INFO L225 Difference]: With dead ends: 150 [2018-01-24 13:03:01,113 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 13:03:01,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:03:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 13:03:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-01-24 13:03:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 13:03:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-24 13:03:01,122 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 34 [2018-01-24 13:03:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:01,122 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-24 13:03:01,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:03:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-24 13:03:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:03:01,123 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:01,123 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:01,123 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:03:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430626, now seen corresponding path program 1 times [2018-01-24 13:03:01,124 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:01,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:01,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:01,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:01,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:01,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:01,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:01,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:03:01,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:01,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:03:01,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:03:01,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:03:01,454 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 8 states. [2018-01-24 13:03:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:01,772 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-01-24 13:03:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:03:01,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-24 13:03:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:01,774 INFO L225 Difference]: With dead ends: 148 [2018-01-24 13:03:01,774 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 13:03:01,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:03:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 13:03:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-24 13:03:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 13:03:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-24 13:03:01,782 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2018-01-24 13:03:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:01,783 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-24 13:03:01,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:03:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-24 13:03:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 13:03:01,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:01,784 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:01,784 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:03:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash -994990400, now seen corresponding path program 1 times [2018-01-24 13:03:01,784 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:01,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:01,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:01,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:01,786 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:01,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:02,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:02,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 13:03:02,104 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:02,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:03:02,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:03:02,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:03:02,105 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-01-24 13:03:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:02,521 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-01-24 13:03:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 13:03:02,521 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 13:03:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:02,523 INFO L225 Difference]: With dead ends: 177 [2018-01-24 13:03:02,523 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 13:03:02,523 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 13:03:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 13:03:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-01-24 13:03:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 13:03:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-01-24 13:03:02,540 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 36 [2018-01-24 13:03:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:02,540 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-01-24 13:03:02,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:03:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-01-24 13:03:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 13:03:02,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:02,541 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:02,541 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:03:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash -994990399, now seen corresponding path program 1 times [2018-01-24 13:03:02,542 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:02,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:02,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:02,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:02,543 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:02,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:03,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:03:03,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 13:03:03,008 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:03:03,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:03:03,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:03:03,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:03:03,009 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 17 states. [2018-01-24 13:03:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:03,741 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-01-24 13:03:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 13:03:03,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 13:03:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:03,743 INFO L225 Difference]: With dead ends: 181 [2018-01-24 13:03:03,743 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 13:03:03,743 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 13:03:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 13:03:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-01-24 13:03:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-24 13:03:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-01-24 13:03:03,755 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 36 [2018-01-24 13:03:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:03,755 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-01-24 13:03:03,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:03:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-01-24 13:03:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 13:03:03,756 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:03,756 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:03,756 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:03:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash -315835362, now seen corresponding path program 1 times [2018-01-24 13:03:03,757 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:03,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:03,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:03,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:03,757 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:03,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:03,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:03,876 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:03,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:03,891 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:03,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:04,171 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:04,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:03:04,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 13:03:04,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:03:04,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 13:03:04,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:03:04,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 13:03:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:04,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:04,539 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:03:04,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:04,557 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:04,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:04,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:03:04,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:03:04,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:9 [2018-01-24 13:03:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:04,830 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:04,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-24 13:03:04,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:03:04,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:04,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 [2018-01-24 13:03:05,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-24 13:03:05,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:05,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:03:05,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:05,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:05,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 [2018-01-24 13:03:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:05,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:03:05,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9, 11, 10] total 16 [2018-01-24 13:03:05,061 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:03:05,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:03:05,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:03:05,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:03:05,064 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 13 states. [2018-01-24 13:03:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:03:05,849 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2018-01-24 13:03:05,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:03:05,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-01-24 13:03:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:03:05,851 INFO L225 Difference]: With dead ends: 199 [2018-01-24 13:03:05,851 INFO L226 Difference]: Without dead ends: 198 [2018-01-24 13:03:05,852 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 174 SyntacticMatches, 22 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:03:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-24 13:03:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2018-01-24 13:03:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 13:03:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 192 transitions. [2018-01-24 13:03:05,868 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 192 transitions. Word has length 50 [2018-01-24 13:03:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:03:05,868 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 192 transitions. [2018-01-24 13:03:05,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:03:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2018-01-24 13:03:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 13:03:05,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:03:05,869 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:03:05,869 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 13:03:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -315835361, now seen corresponding path program 1 times [2018-01-24 13:03:05,870 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:03:05,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:05,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:05,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:03:05,871 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:03:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:05,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:03:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:06,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:03:06,282 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:03:06,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:03:06,291 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:03:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:03:06,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:03:06,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:03:06,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:03:06,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 13:03:06,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:03:06,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:03:06,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-24 13:03:06,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:03:06,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:03:06,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:03:06,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:03:06,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-01-24 13:03:06,622 WARN L1029 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|)))) is different from true [2018-01-24 13:03:06,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:03:06,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 13:03:06,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:03:06,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-01-24 13:03:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:03:06,754 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:03:06,944 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:03:06,944 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:03:06,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-24 13:03:06,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,954 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:03:06,955 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:03:06,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-01-24 13:03:06,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:03:06,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:03:06,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:20 [2018-01-24 13:03:25,591 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 52646 column 11: unknown constant v_insert_sub_~sub~10.base_28 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:582) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:200) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:667) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:759) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 13:03:25,594 INFO L168 Benchmark]: Toolchain (without parser) took 29648.63 ms. Allocated memory was 303.6 MB in the beginning and 584.6 MB in the end (delta: 281.0 MB). Free memory was 263.6 MB in the beginning and 467.8 MB in the end (delta: -204.2 MB). Peak memory consumption was 76.8 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:25,595 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:03:25,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.10 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 251.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:25,595 INFO L168 Benchmark]: Boogie Preprocessor took 41.22 ms. Allocated memory is still 303.6 MB. Free memory was 251.5 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:25,596 INFO L168 Benchmark]: RCFGBuilder took 501.24 ms. Allocated memory is still 303.6 MB. Free memory was 249.6 MB in the beginning and 218.7 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:25,596 INFO L168 Benchmark]: TraceAbstraction took 28858.36 ms. Allocated memory was 303.6 MB in the beginning and 584.6 MB in the end (delta: 281.0 MB). Free memory was 217.7 MB in the beginning and 467.8 MB in the end (delta: -250.1 MB). Peak memory consumption was 31.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:03:25,597 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.10 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 251.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.22 ms. Allocated memory is still 303.6 MB. Free memory was 251.5 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 501.24 ms. Allocated memory is still 303.6 MB. Free memory was 249.6 MB in the beginning and 218.7 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 28858.36 ms. Allocated memory was 303.6 MB in the beginning and 584.6 MB in the end (delta: 281.0 MB). Free memory was 217.7 MB in the beginning and 467.8 MB in the end (delta: -250.1 MB). Peak memory consumption was 31.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 52646 column 11: unknown constant v_insert_sub_~sub~10.base_28 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 52646 column 11: unknown constant v_insert_sub_~sub~10.base_28: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-03-25-606.csv Received shutdown request...