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/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:37:46,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:37:46,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:37:46,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:37:46,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:37:46,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:37:46,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:37:46,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:37:46,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:37:46,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:37:46,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:37:46,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:37:46,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:37:46,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:37:46,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:37:46,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:37:46,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:37:46,673 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:37:46,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:37:46,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:37:46,678 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:37:46,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:37:46,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:37:46,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:37:46,681 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:37:46,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:37:46,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:37:46,684 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:37:46,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:37:46,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:37:46,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:37:46,685 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-21 05:37:46,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:37:46,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:37:46,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:37:46,701 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:37:46,702 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:37:46,702 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:37:46,703 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:37:46,703 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:37:46,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:37:46,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:37:46,704 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:37:46,704 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:37:46,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:37:46,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:37:46,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:37:46,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:37:46,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:37:46,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:37:46,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:37:46,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:37:46,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:37:46,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:37:46,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:37:46,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:37:46,707 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:37:46,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:37:46,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:37:46,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:37:46,708 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:37:46,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:37:46,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:37:46,708 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:37:46,709 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:37:46,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:37:46,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:37:46,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:37:46,709 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:37:46,711 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:37:46,711 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:37:46,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:37:46,774 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:37:46,777 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:37:46,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:37:46,779 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:37:46,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-01-21 05:37:46,952 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:37:46,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:37:46,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:37:46,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:37:46,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:37:46,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:37:46" (1/1) ... [2018-01-21 05:37:46,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a663d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:46, skipping insertion in model container [2018-01-21 05:37:46,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:37:46" (1/1) ... [2018-01-21 05:37:46,984 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:37:47,023 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:37:47,151 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:37:47,171 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:37:47,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47 WrapperNode [2018-01-21 05:37:47,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:37:47,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:37:47,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:37:47,180 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:37:47,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (1/1) ... [2018-01-21 05:37:47,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (1/1) ... [2018-01-21 05:37:47,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (1/1) ... [2018-01-21 05:37:47,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (1/1) ... [2018-01-21 05:37:47,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (1/1) ... [2018-01-21 05:37:47,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (1/1) ... [2018-01-21 05:37:47,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (1/1) ... [2018-01-21 05:37:47,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:37:47,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:37:47,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:37:47,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:37:47,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (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-21 05:37:47,268 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:37:47,268 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:37:47,268 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 05:37:47,268 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:37:47,268 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 05:37:47,268 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 05:37:47,268 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:37:47,269 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:37:47,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:37:47,576 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:37:47,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:37:47 BoogieIcfgContainer [2018-01-21 05:37:47,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:37:47,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:37:47,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:37:47,580 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:37:47,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:37:46" (1/3) ... [2018-01-21 05:37:47,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7761c98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:37:47, skipping insertion in model container [2018-01-21 05:37:47,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:37:47" (2/3) ... [2018-01-21 05:37:47,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7761c98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:37:47, skipping insertion in model container [2018-01-21 05:37:47,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:37:47" (3/3) ... [2018-01-21 05:37:47,585 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-01-21 05:37:47,594 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:37:47,604 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 05:37:47,655 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:47,655 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:47,655 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:47,655 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:47,656 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:47,656 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:47,656 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:47,656 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:37:47,657 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 05:37:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:37:47,686 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:47,687 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:37:47,688 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:37:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash 125893, now seen corresponding path program 1 times [2018-01-21 05:37:47,696 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:47,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:47,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:47,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:47,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:37:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:37:47,806 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:37:47,813 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:37:47,819 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:47,819 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:47,819 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:47,819 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:47,820 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:47,820 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:47,820 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:47,820 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:37:47,820 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 05:37:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 05:37:47,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:47,825 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:47,825 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:37:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1201666841, now seen corresponding path program 1 times [2018-01-21 05:37:47,825 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:47,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:47,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:47,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:47,827 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:47,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:47,883 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-21 05:37:47,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:47,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:37:47,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:47,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:37:47,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:37:47,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:47,900 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-21 05:37:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:48,010 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-21 05:37:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:37:48,012 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 05:37:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:48,021 INFO L225 Difference]: With dead ends: 105 [2018-01-21 05:37:48,021 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 05:37:48,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 05:37:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-21 05:37:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 05:37:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-21 05:37:48,058 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 17 [2018-01-21 05:37:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:48,059 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-21 05:37:48,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:37:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-21 05:37:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 05:37:48,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:48,061 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, 1] [2018-01-21 05:37:48,061 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:37:48,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1521991172, now seen corresponding path program 1 times [2018-01-21 05:37:48,061 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:48,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:48,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,063 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:48,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:48,308 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-21 05:37:48,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:48,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 05:37:48,308 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:48,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 05:37:48,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 05:37:48,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 05:37:48,310 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 8 states. [2018-01-21 05:37:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:48,553 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-21 05:37:48,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 05:37:48,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-21 05:37:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:48,558 INFO L225 Difference]: With dead ends: 93 [2018-01-21 05:37:48,559 INFO L226 Difference]: Without dead ends: 71 [2018-01-21 05:37:48,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-21 05:37:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-21 05:37:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-01-21 05:37:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 05:37:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-21 05:37:48,572 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 37 [2018-01-21 05:37:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:48,573 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-21 05:37:48,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 05:37:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-21 05:37:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 05:37:48,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:48,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:48,575 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:37:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1267549394, now seen corresponding path program 1 times [2018-01-21 05:37:48,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:48,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:48,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:48,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:48,730 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-21 05:37:48,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:48,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:37:48,730 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:48,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:37:48,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:37:48,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:48,732 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states. [2018-01-21 05:37:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:48,801 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-01-21 05:37:48,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:37:48,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-01-21 05:37:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:48,802 INFO L225 Difference]: With dead ends: 83 [2018-01-21 05:37:48,802 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:37:48,803 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:37:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:37:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:37:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:37:48,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-01-21 05:37:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:48,805 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:37:48,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:37:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:37:48,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:37:48,808 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:48,809 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:48,809 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:48,809 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:48,809 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:48,809 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:48,809 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:48,809 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:37:48,810 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 05:37:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 05:37:48,812 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:48,813 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:48,813 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1051528599, now seen corresponding path program 1 times [2018-01-21 05:37:48,813 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:48,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:48,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,815 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:48,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:48,828 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-21 05:37:48,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:48,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:37:48,829 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:48,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:37:48,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:37:48,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:48,830 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-21 05:37:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:48,836 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-21 05:37:48,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:37:48,836 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 05:37:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:48,838 INFO L225 Difference]: With dead ends: 105 [2018-01-21 05:37:48,838 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 05:37:48,838 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:37:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 05:37:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-21 05:37:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 05:37:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-21 05:37:48,845 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2018-01-21 05:37:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:48,845 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-21 05:37:48,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:37:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-21 05:37:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 05:37:48,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:48,847 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] [2018-01-21 05:37:48,847 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:48,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2106609350, now seen corresponding path program 1 times [2018-01-21 05:37:48,848 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:48,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:48,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:48,849 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:48,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:49,019 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-21 05:37:49,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:49,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 05:37:49,020 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:49,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 05:37:49,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 05:37:49,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 05:37:49,021 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 8 states. [2018-01-21 05:37:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:49,185 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-01-21 05:37:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 05:37:49,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-21 05:37:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:49,186 INFO L225 Difference]: With dead ends: 89 [2018-01-21 05:37:49,186 INFO L226 Difference]: Without dead ends: 69 [2018-01-21 05:37:49,187 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-21 05:37:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-21 05:37:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-21 05:37:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 05:37:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-21 05:37:49,191 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 35 [2018-01-21 05:37:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:49,191 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-21 05:37:49,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 05:37:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-21 05:37:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 05:37:49,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:49,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:37:49,193 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 05:37:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1721987472, now seen corresponding path program 1 times [2018-01-21 05:37:49,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:49,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:49,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:49,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:49,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:37:49,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:37:49,314 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-21 05:37:49,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:37:49,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:37:49,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:37:49,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:37:49,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:37:49,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:49,316 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2018-01-21 05:37:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:37:49,376 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-21 05:37:49,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:37:49,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-21 05:37:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:37:49,378 INFO L225 Difference]: With dead ends: 81 [2018-01-21 05:37:49,378 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:37:49,379 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:37:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:37:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:37:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:37:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:37:49,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 05:37:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:37:49,381 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:37:49,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:37:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:37:49,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:37:49,383 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:37:49,383 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:37:49,383 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:37:49,384 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:37:49,384 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:37:49,384 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:37:49,384 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:37:49,384 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 05:37:49,384 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:37:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 05:37:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 05:37:49,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:37:49,388 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] [2018-01-21 05:37:49,388 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 05:37:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1137567503, now seen corresponding path program 1 times [2018-01-21 05:37:49,389 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:37:49,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:49,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:37:49,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:37:49,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:37:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:37:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:37:49,418 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:37:49,424 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:37:49,429 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:37:49,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:37:49 BoogieIcfgContainer [2018-01-21 05:37:49,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:37:49,443 INFO L168 Benchmark]: Toolchain (without parser) took 2491.31 ms. Allocated memory was 300.9 MB in the beginning and 475.0 MB in the end (delta: 174.1 MB). Free memory was 259.9 MB in the beginning and 422.0 MB in the end (delta: -162.2 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-01-21 05:37:49,444 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 300.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:37:49,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.66 ms. Allocated memory is still 300.9 MB. Free memory was 259.9 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:37:49,445 INFO L168 Benchmark]: Boogie Preprocessor took 35.16 ms. Allocated memory is still 300.9 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:37:49,445 INFO L168 Benchmark]: RCFGBuilder took 361.34 ms. Allocated memory is still 300.9 MB. Free memory was 247.9 MB in the beginning and 224.8 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-01-21 05:37:49,445 INFO L168 Benchmark]: TraceAbstraction took 1864.83 ms. Allocated memory was 300.9 MB in the beginning and 475.0 MB in the end (delta: 174.1 MB). Free memory was 224.8 MB in the beginning and 422.0 MB in the end (delta: -197.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:37:49,447 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.15 ms. Allocated memory is still 300.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.66 ms. Allocated memory is still 300.9 MB. Free memory was 259.9 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.16 ms. Allocated memory is still 300.9 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 361.34 ms. Allocated memory is still 300.9 MB. Free memory was 247.9 MB in the beginning and 224.8 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1864.83 ms. Allocated memory was 300.9 MB in the beginning and 475.0 MB in the end (delta: 174.1 MB). Free memory was 224.8 MB in the beginning and 422.0 MB in the end (delta: -197.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 72 SDslu, 188 SDs, 0 SdLazy, 140 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 17859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 633]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 72 SDslu, 180 SDs, 0 SdLazy, 140 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 16803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 624]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={11:0}] [L637] CALL append(&list) VAL [plist={11:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628] EXPR, FCALL item->next VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L631] FCALL *plist = item VAL [item={9:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_05-37-49-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_05-37-49-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_05-37-49-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_05-37-49-456.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_05-37-49-456.csv Received shutdown request...