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_Camel+AI_EQ.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-20 22:09:57,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:09:57,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:09:57,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:09:57,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:09:57,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:09:57,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:09:57,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:09:57,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:09:57,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:09:57,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:09:57,349 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:09:57,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:09:57,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:09:57,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:09:57,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:09:57,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:09:57,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:09:57,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:09:57,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:09:57,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:09:57,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:09:57,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:09:57,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:09:57,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:09:57,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:09:57,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:09:57,367 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:09:57,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:09:57,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:09:57,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:09:57,369 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:09:57,379 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:09:57,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:09:57,380 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:09:57,380 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:09:57,380 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:09:57,381 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:09:57,381 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:09:57,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:09:57,382 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:09:57,382 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:09:57,382 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:09:57,382 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:09:57,382 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:09:57,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:09:57,383 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:09:57,383 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:09:57,383 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:09:57,383 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:09:57,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:09:57,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:09:57,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:09:57,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:09:57,384 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:09:57,385 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:09:57,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:09:57,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:09:57,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:09:57,385 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:09:57,386 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:09:57,386 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:09:57,386 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:09:57,386 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:09:57,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:09:57,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:09:57,387 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:09:57,388 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:09:57,388 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:09:57,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:09:57,436 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:09:57,440 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:09:57,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:09:57,442 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:09:57,443 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-20 22:09:57,641 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:09:57,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:09:57,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:09:57,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:09:57,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:09:57,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4454cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57, skipping insertion in model container [2018-01-20 22:09:57,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,672 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:09:57,711 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:09:57,831 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:09:57,854 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:09:57,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57 WrapperNode [2018-01-20 22:09:57,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:09:57,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:09:57,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:09:57,863 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:09:57,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (1/1) ... [2018-01-20 22:09:57,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:09:57,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:09:57,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:09:57,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:09:57,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (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-20 22:09:57,946 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:09:57,946 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:09:57,946 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-20 22:09:57,946 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:09:57,947 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:09:57,947 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:09:57,947 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:09:57,947 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:09:57,947 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:09:57,947 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:09:57,948 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:09:57,948 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:09:57,948 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-20 22:09:57,948 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:09:57,948 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:09:57,948 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:09:58,224 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:09:58,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:58 BoogieIcfgContainer [2018-01-20 22:09:58,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:09:58,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:09:58,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:09:58,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:09:58,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:09:57" (1/3) ... [2018-01-20 22:09:58,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:09:58, skipping insertion in model container [2018-01-20 22:09:58,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:09:57" (2/3) ... [2018-01-20 22:09:58,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:09:58, skipping insertion in model container [2018-01-20 22:09:58,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:58" (3/3) ... [2018-01-20 22:09:58,230 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-01-20 22:09:58,236 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:09:58,242 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 22:09:58,290 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:58,290 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:58,290 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:58,290 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:58,290 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:58,291 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:58,291 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:58,291 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:09:58,292 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:09:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:09:58,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:58,320 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:09:58,320 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:09:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash 118205, now seen corresponding path program 1 times [2018-01-20 22:09:58,327 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:58,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:58,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:58,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:58,449 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:09:58,455 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:09:58,466 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:58,467 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:58,467 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:58,467 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:58,467 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:58,467 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:58,467 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:58,467 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:09:58,467 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:09:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 22:09:58,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:58,472 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:58,472 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:09:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1657082378, now seen corresponding path program 1 times [2018-01-20 22:09:58,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:58,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:58,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:58,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:58,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:58,532 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-20 22:09:58,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:58,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:09:58,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:09:58,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:09:58,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:09:58,632 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 22:09:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:58,650 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-20 22:09:58,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:09:58,651 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-20 22:09:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:58,659 INFO L225 Difference]: With dead ends: 97 [2018-01-20 22:09:58,659 INFO L226 Difference]: Without dead ends: 61 [2018-01-20 22:09:58,662 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-20 22:09:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-20 22:09:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-20 22:09:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-20 22:09:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-20 22:09:58,701 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-01-20 22:09:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:58,701 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-20 22:09:58,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:09:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-20 22:09:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 22:09:58,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:58,703 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-20 22:09:58,703 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:09:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1284274074, now seen corresponding path program 1 times [2018-01-20 22:09:58,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:58,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:58,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:58,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:58,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:09:58,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:58,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:09:58,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:09:58,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:09:58,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:09:58,823 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 4 states. [2018-01-20 22:09:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:58,882 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-20 22:09:58,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:09:58,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-20 22:09:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:58,886 INFO L225 Difference]: With dead ends: 81 [2018-01-20 22:09:58,886 INFO L226 Difference]: Without dead ends: 64 [2018-01-20 22:09:58,887 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-20 22:09:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-20 22:09:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-20 22:09:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-20 22:09:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-20 22:09:58,900 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 37 [2018-01-20 22:09:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:58,901 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-20 22:09:58,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:09:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-20 22:09:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-20 22:09:58,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:58,903 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-20 22:09:58,903 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:09:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1067134254, now seen corresponding path program 1 times [2018-01-20 22:09:58,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:58,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:58,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:58,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:58,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:59,086 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-20 22:09:59,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:59,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 22:09:59,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:09:59,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:09:59,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:09:59,087 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2018-01-20 22:09:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:59,194 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-20 22:09:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:09:59,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-20 22:09:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:59,195 INFO L225 Difference]: With dead ends: 80 [2018-01-20 22:09:59,195 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:09:59,196 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-20 22:09:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:09:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:09:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:09:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:09:59,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-20 22:09:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:59,197 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:09:59,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:09:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:09:59,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:09:59,199 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:59,200 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:59,200 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:59,200 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:59,200 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:59,200 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:59,200 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:59,200 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:09:59,200 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:09:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 22:09:59,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:59,202 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:09:59,202 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:59,202 INFO L82 PathProgramCache]: Analyzing trace with hash -901067964, now seen corresponding path program 1 times [2018-01-20 22:09:59,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:59,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:59,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:59,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:59,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:59,219 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-20 22:09:59,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:59,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:09:59,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:09:59,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:09:59,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:09:59,221 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-20 22:09:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:59,226 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-20 22:09:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:09:59,226 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-20 22:09:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:59,227 INFO L225 Difference]: With dead ends: 97 [2018-01-20 22:09:59,227 INFO L226 Difference]: Without dead ends: 59 [2018-01-20 22:09:59,228 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-20 22:09:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-20 22:09:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-20 22:09:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-20 22:09:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-20 22:09:59,233 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 15 [2018-01-20 22:09:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:59,233 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-20 22:09:59,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:09:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-20 22:09:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 22:09:59,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:59,235 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-20 22:09:59,235 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash -959556396, now seen corresponding path program 1 times [2018-01-20 22:09:59,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:59,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:59,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:59,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:59,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:09:59,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:59,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:09:59,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:09:59,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:09:59,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:09:59,291 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states. [2018-01-20 22:09:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:59,331 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-20 22:09:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:09:59,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-20 22:09:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:59,332 INFO L225 Difference]: With dead ends: 77 [2018-01-20 22:09:59,332 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 22:09:59,333 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-20 22:09:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 22:09:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-20 22:09:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-20 22:09:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-20 22:09:59,337 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 35 [2018-01-20 22:09:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:59,337 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-20 22:09:59,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:09:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-20 22:09:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-20 22:09:59,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:59,338 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-20 22:09:59,339 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:09:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash 754195980, now seen corresponding path program 1 times [2018-01-20 22:09:59,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:59,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:59,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:59,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:09:59,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:09:59,489 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-20 22:09:59,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:09:59,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 22:09:59,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:09:59,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:09:59,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:09:59,490 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2018-01-20 22:09:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:09:59,572 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-20 22:09:59,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:09:59,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-20 22:09:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:09:59,573 INFO L225 Difference]: With dead ends: 78 [2018-01-20 22:09:59,573 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:09:59,574 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-20 22:09:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:09:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:09:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:09:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:09:59,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-01-20 22:09:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:09:59,576 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:09:59,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:09:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:09:59,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:09:59,578 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:09:59,578 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:09:59,579 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:09:59,579 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:09:59,579 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:09:59,579 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:09:59,579 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:09:59,579 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-20 22:09:59,579 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:09:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-20 22:09:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:09:59,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:09:59,583 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-20 22:09:59,583 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-20 22:09:59,584 INFO L82 PathProgramCache]: Analyzing trace with hash -958748531, now seen corresponding path program 1 times [2018-01-20 22:09:59,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:09:59,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:09:59,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:09:59,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:09:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:09:59,617 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:09:59,625 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:09:59,630 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:09:59,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:09:59 BoogieIcfgContainer [2018-01-20 22:09:59,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:09:59,644 INFO L168 Benchmark]: Toolchain (without parser) took 2002.59 ms. Allocated memory was 304.6 MB in the beginning and 465.6 MB in the end (delta: 161.0 MB). Free memory was 261.9 MB in the beginning and 343.8 MB in the end (delta: -81.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:09:59,646 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 304.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:09:59,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.19 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 252.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:09:59,646 INFO L168 Benchmark]: Boogie Preprocessor took 33.83 ms. Allocated memory is still 304.6 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:09:59,646 INFO L168 Benchmark]: RCFGBuilder took 328.43 ms. Allocated memory is still 304.6 MB. Free memory was 250.0 MB in the beginning and 227.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-01-20 22:09:59,647 INFO L168 Benchmark]: TraceAbstraction took 1417.65 ms. Allocated memory was 304.6 MB in the beginning and 465.6 MB in the end (delta: 161.0 MB). Free memory was 227.4 MB in the beginning and 343.8 MB in the end (delta: -116.3 MB). Peak memory consumption was 44.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:09:59,648 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.21 ms. Allocated memory is still 304.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.19 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 252.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 33.83 ms. Allocated memory is still 304.6 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 328.43 ms. Allocated memory is still 304.6 MB. Free memory was 250.0 MB in the beginning and 227.4 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1417.65 ms. Allocated memory was 304.6 MB in the beginning and 465.6 MB in the end (delta: 161.0 MB). Free memory was 227.4 MB in the beginning and 343.8 MB in the end (delta: -116.3 MB). Peak memory consumption was 44.6 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.1s 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)={11:0}, malloc(sizeof *item)={12: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)={11:0}, malloc(sizeof *item)={12: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)={11:0}, malloc(sizeof *item)={12:0}, plist={9:0}, plist={9:0}] [L633] FCALL *plist = item VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={12: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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-09-59-657.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-09-59-657.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-09-59-657.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-09-59-657.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-09-59-657.csv Received shutdown request...