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/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:56:58,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:56:58,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:56:58,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:56:58,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:56:58,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:56:58,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:56:58,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:56:58,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:56:58,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:56:58,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:56:58,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:56:58,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:56:58,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:56:58,983 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:56:58,985 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:56:58,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:56:58,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:56:58,991 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:56:58,992 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:56:58,995 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:56:58,995 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:56:58,995 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:56:58,996 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:56:58,997 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:56:58,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:56:58,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:56:58,999 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:56:58,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:56:58,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:56:59,000 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:56:59,000 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:56:59,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:56:59,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:56:59,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:56:59,012 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:56:59,012 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:56:59,012 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:56:59,012 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:56:59,013 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:56:59,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:56:59,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:56:59,014 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:56:59,014 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:56:59,014 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:56:59,014 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:56:59,014 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:56:59,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:56:59,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:56:59,015 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:56:59,015 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:56:59,015 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:56:59,015 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:56:59,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:56:59,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:56:59,016 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:56:59,016 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:56:59,016 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:56:59,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:56:59,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:56:59,017 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:56:59,017 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:56:59,017 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:56:59,017 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:56:59,017 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:56:59,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:56:59,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:56:59,018 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:56:59,018 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:56:59,019 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:56:59,019 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:56:59,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:56:59,068 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:56:59,072 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:56:59,073 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:56:59,074 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:56:59,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-01-21 05:56:59,265 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:56:59,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:56:59,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:56:59,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:56:59,275 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:56:59,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11237bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59, skipping insertion in model container [2018-01-21 05:56:59,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,293 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:56:59,331 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:56:59,452 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:56:59,472 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:56:59,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59 WrapperNode [2018-01-21 05:56:59,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:56:59,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:56:59,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:56:59,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:56:59,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (1/1) ... [2018-01-21 05:56:59,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:56:59,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:56:59,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:56:59,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:56:59,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (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:56:59,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:56:59,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:56:59,570 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 05:56:59,570 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:56:59,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 05:56:59,570 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 05:56:59,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:56:59,570 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:56:59,570 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:56:59,571 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 05:56:59,571 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 05:56:59,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 05:56:59,571 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 05:56:59,571 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:56:59,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:56:59,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:56:59,830 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:56:59,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:56:59 BoogieIcfgContainer [2018-01-21 05:56:59,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:56:59,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:56:59,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:56:59,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:56:59,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:56:59" (1/3) ... [2018-01-21 05:56:59,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4ef6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:56:59, skipping insertion in model container [2018-01-21 05:56:59,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:56:59" (2/3) ... [2018-01-21 05:56:59,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4ef6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:56:59, skipping insertion in model container [2018-01-21 05:56:59,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:56:59" (3/3) ... [2018-01-21 05:56:59,837 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-01-21 05:56:59,844 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:56:59,851 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 05:56:59,902 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:56:59,902 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:56:59,902 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:56:59,903 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:56:59,903 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:56:59,903 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:56:59,903 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:56:59,903 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:56:59,904 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:56:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 05:56:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:56:59,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:56:59,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:56:59,935 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:56:59,940 INFO L82 PathProgramCache]: Analyzing trace with hash 118205, now seen corresponding path program 1 times [2018-01-21 05:56:59,943 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:56:59,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:56:59,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:56:59,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:56:59,995 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:57:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:57:00,052 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:57:00,059 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:57:00,070 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:57:00,071 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:57:00,071 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:57:00,071 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:57:00,071 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:57:00,071 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:57:00,072 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:57:00,072 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:57:00,072 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:57:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 05:57:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 05:57:00,077 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:57:00,077 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:57:00,077 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:57:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1657082378, now seen corresponding path program 1 times [2018-01-21 05:57:00,078 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:57:00,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:57:00,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,080 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:57:00,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:57:00,142 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:57:00,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:57:00,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:57:00,143 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:57:00,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:57:00,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:57:00,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:57:00,160 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 05:57:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:57:00,265 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-21 05:57:00,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:57:00,267 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 05:57:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:57:00,276 INFO L225 Difference]: With dead ends: 97 [2018-01-21 05:57:00,276 INFO L226 Difference]: Without dead ends: 61 [2018-01-21 05:57:00,279 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:57:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-21 05:57:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-21 05:57:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 05:57:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-21 05:57:00,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-01-21 05:57:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:57:00,309 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-21 05:57:00,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:57:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-21 05:57:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 05:57:00,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:57:00,311 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:57:00,311 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:57:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1284274074, now seen corresponding path program 1 times [2018-01-21 05:57:00,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:57:00,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:57:00,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:57:00,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:57:00,432 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:57:00,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:57:00,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 05:57:00,433 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:57:00,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:57:00,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:57:00,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:57:00,436 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 4 states. [2018-01-21 05:57:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:57:00,514 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-21 05:57:00,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:57:00,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-21 05:57:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:57:00,517 INFO L225 Difference]: With dead ends: 81 [2018-01-21 05:57:00,517 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 05:57:00,518 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:57:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 05:57:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-21 05:57:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 05:57:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-21 05:57:00,532 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 37 [2018-01-21 05:57:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:57:00,533 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-21 05:57:00,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:57:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-21 05:57:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 05:57:00,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:57:00,535 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, 1] [2018-01-21 05:57:00,535 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:57:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1067134254, now seen corresponding path program 1 times [2018-01-21 05:57:00,535 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:57:00,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:57:00,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,537 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:57:00,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:57:00,706 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:57:00,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:57:00,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:57:00,707 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:57:00,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:57:00,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:57:00,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:57:00,709 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2018-01-21 05:57:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:57:00,773 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-21 05:57:00,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:57:00,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-21 05:57:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:57:00,775 INFO L225 Difference]: With dead ends: 80 [2018-01-21 05:57:00,775 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:57:00,776 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:57:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:57:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:57:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:57:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:57:00,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-21 05:57:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:57:00,778 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:57:00,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:57:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:57:00,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:57:00,781 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:57:00,782 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:57:00,782 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:57:00,782 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:57:00,782 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:57:00,783 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:57:00,783 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:57:00,783 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:57:00,783 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:57:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 05:57:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 05:57:00,787 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:57:00,787 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:57:00,787 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:57:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash -901067964, now seen corresponding path program 1 times [2018-01-21 05:57:00,787 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:57:00,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:57:00,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,789 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:57:00,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:57:00,803 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:57:00,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:57:00,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:57:00,804 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:57:00,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:57:00,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:57:00,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:57:00,805 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 05:57:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:57:00,810 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-21 05:57:00,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:57:00,810 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 05:57:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:57:00,812 INFO L225 Difference]: With dead ends: 97 [2018-01-21 05:57:00,812 INFO L226 Difference]: Without dead ends: 59 [2018-01-21 05:57:00,812 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:57:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-21 05:57:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-21 05:57:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 05:57:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-21 05:57:00,819 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 15 [2018-01-21 05:57:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:57:00,819 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-21 05:57:00,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:57:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-21 05:57:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 05:57:00,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:57:00,821 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:57:00,821 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:57:00,821 INFO L82 PathProgramCache]: Analyzing trace with hash -959556396, now seen corresponding path program 1 times [2018-01-21 05:57:00,822 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:57:00,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:57:00,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,823 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:57:00,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:57:00,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:57:00,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:57:00,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 05:57:00,883 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:57:00,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:57:00,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:57:00,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:57:00,884 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states. [2018-01-21 05:57:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:57:00,916 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-21 05:57:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:57:00,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-21 05:57:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:57:00,918 INFO L225 Difference]: With dead ends: 77 [2018-01-21 05:57:00,918 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 05:57:00,919 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:57:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 05:57:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-21 05:57:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 05:57:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-21 05:57:00,923 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 35 [2018-01-21 05:57:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:57:00,923 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-21 05:57:00,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:57:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-21 05:57:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 05:57:00,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:57:00,924 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] [2018-01-21 05:57:00,925 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 05:57:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 754195980, now seen corresponding path program 1 times [2018-01-21 05:57:00,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:57:00,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:57:00,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:00,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:57:00,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:57:01,048 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:57:01,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:57:01,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:57:01,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:57:01,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:57:01,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:57:01,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:57:01,050 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2018-01-21 05:57:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:57:01,119 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-21 05:57:01,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:57:01,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-21 05:57:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:57:01,120 INFO L225 Difference]: With dead ends: 78 [2018-01-21 05:57:01,120 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:57:01,121 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:57:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:57:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:57:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:57:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:57:01,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-01-21 05:57:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:57:01,122 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:57:01,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:57:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:57:01,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:57:01,123 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:57:01,124 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:57:01,124 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:57:01,124 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:57:01,124 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:57:01,124 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:57:01,124 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:57:01,124 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 05:57:01,124 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:57:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 05:57:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 05:57:01,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:57:01,127 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] [2018-01-21 05:57:01,127 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 05:57:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash -958748531, now seen corresponding path program 1 times [2018-01-21 05:57:01,128 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:57:01,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:01,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:57:01,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:57:01,129 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:57:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:57:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:57:01,161 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:57:01,170 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:57:01,175 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:57:01,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:57:01 BoogieIcfgContainer [2018-01-21 05:57:01,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:57:01,189 INFO L168 Benchmark]: Toolchain (without parser) took 1923.38 ms. Allocated memory was 308.3 MB in the beginning and 452.5 MB in the end (delta: 144.2 MB). Free memory was 267.0 MB in the beginning and 331.2 MB in the end (delta: -64.2 MB). Peak memory consumption was 80.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:57:01,190 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:57:01,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.19 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 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:57:01,191 INFO L168 Benchmark]: Boogie Preprocessor took 37.43 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 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:57:01,191 INFO L168 Benchmark]: RCFGBuilder took 311.92 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 232.1 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-21 05:57:01,192 INFO L168 Benchmark]: TraceAbstraction took 1356.43 ms. Allocated memory was 308.3 MB in the beginning and 452.5 MB in the end (delta: 144.2 MB). Free memory was 232.1 MB in the beginning and 331.2 MB in the end (delta: -99.2 MB). Peak memory consumption was 45.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:57:01,194 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.17 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.19 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.43 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 311.92 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 232.1 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1356.43 ms. Allocated memory was 308.3 MB in the beginning and 452.5 MB in the end (delta: 144.2 MB). Free memory was 232.1 MB in the beginning and 331.2 MB in the end (delta: -99.2 MB). Peak memory consumption was 45.0 MB. 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: [L620] int c = 0; VAL [\old(c)=2, c=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 65 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=65occurred 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, 65 locations, 4 error locations. SAFE Result, 0.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 152 SDtfs, 38 SDslu, 113 SDs, 0 SdLazy, 48 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 13360 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: 635]: 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, 65 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 38 SDslu, 109 SDs, 0 SdLazy, 48 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 12570 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: 625]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={9:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L633] FCALL *plist = item VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 65 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=65occurred 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, 24 NumberOfCodeBlocks, 24 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_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_05-57-01-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_05-57-01-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_05-57-01-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_05-57-01-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_05-57-01-204.csv Received shutdown request...