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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:15:29,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:15:29,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:15:29,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:15:29,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:15:29,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:15:29,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:15:29,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:15:29,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:15:29,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:15:29,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:15:29,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:15:29,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:15:29,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:15:29,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:15:29,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:15:29,582 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:15:29,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:15:29,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:15:29,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:15:29,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:15:29,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:15:29,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:15:29,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:15:29,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:15:29,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:15:29,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:15:29,590 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:15:29,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:15:29,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:15:29,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:15:29,591 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:15:29,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:15:29,599 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:15:29,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:15:29,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:15:29,600 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:15:29,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:15:29,601 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:15:29,601 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:15:29,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:15:29,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:15:29,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:15:29,601 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:15:29,602 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:15:29,602 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:15:29,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:15:29,602 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:15:29,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:15:29,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:15:29,602 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:15:29,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:15:29,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:15:29,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:15:29,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:15:29,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:15:29,638 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:15:29,641 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:15:29,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:15:29,642 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:15:29,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_1_false-valid-memtrack_true-termination.i [2018-02-04 03:15:29,776 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:15:29,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:15:29,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:15:29,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:15:29,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:15:29,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29, skipping insertion in model container [2018-02-04 03:15:29,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,796 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:15:29,830 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:15:29,918 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:15:29,930 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:15:29,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29 WrapperNode [2018-02-04 03:15:29,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:15:29,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:15:29,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:15:29,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:15:29,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... [2018-02-04 03:15:29,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:15:29,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:15:29,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:15:29,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:15:29,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 03:15:30,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:15:30,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:15:30,003 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:15:30,003 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9_2 [2018-02-04 03:15:30,003 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-02-04 03:15:30,003 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:15:30,004 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:15:30,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:15:30,004 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:15:30,004 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:15:30,004 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:15:30,004 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:15:30,004 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:15:30,004 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:15:30,005 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9_2 [2018-02-04 03:15:30,005 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-02-04 03:15:30,005 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:15:30,005 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:15:30,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:15:30,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:15:30,115 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:15:30,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:15:30 BoogieIcfgContainer [2018-02-04 03:15:30,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:15:30,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:15:30,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:15:30,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:15:30,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:15:29" (1/3) ... [2018-02-04 03:15:30,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a395580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:15:30, skipping insertion in model container [2018-02-04 03:15:30,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:15:29" (2/3) ... [2018-02-04 03:15:30,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a395580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:15:30, skipping insertion in model container [2018-02-04 03:15:30,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:15:30" (3/3) ... [2018-02-04 03:15:30,122 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test9_1_false-valid-memtrack_true-termination.i [2018-02-04 03:15:30,127 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:15:30,132 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 03:15:30,167 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:15:30,167 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:15:30,167 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:15:30,168 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:15:30,168 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:15:30,168 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:15:30,168 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:15:30,168 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:15:30,169 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:15:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-02-04 03:15:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:15:30,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:30,194 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:30,195 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:15:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1164483743, now seen corresponding path program 1 times [2018-02-04 03:15:30,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:30,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:30,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:15:30,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,371 INFO L182 omatonBuilderFactory]: Interpolants [36#true, 37#false, 38#(= 0 |ldv_malloc_#res.base|), 39#(= 0 |probe_9_2_#t~ret2.base|), 40#(= 0 ~a9.base)] [2018-02-04 03:15:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:15:30,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:15:30,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:15:30,384 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-02-04 03:15:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:30,512 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-02-04 03:15:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:15:30,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 03:15:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:30,521 INFO L225 Difference]: With dead ends: 46 [2018-02-04 03:15:30,521 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 03:15:30,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 03:15:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-02-04 03:15:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 03:15:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 03:15:30,547 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 19 [2018-02-04 03:15:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:30,547 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 03:15:30,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:15:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 03:15:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:15:30,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:30,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:30,548 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:15:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1164483744, now seen corresponding path program 1 times [2018-02-04 03:15:30,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:30,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:30,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:15:30,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,596 INFO L182 omatonBuilderFactory]: Interpolants [132#true, 133#false, 134#(= 0 |ldv_malloc_#res.offset|), 135#(= 0 |probe_9_2_#t~ret2.offset|), 136#(= 0 ~a9.offset)] [2018-02-04 03:15:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:15:30,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:15:30,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:15:30,598 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2018-02-04 03:15:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:30,662 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-02-04 03:15:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:15:30,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 03:15:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:30,666 INFO L225 Difference]: With dead ends: 42 [2018-02-04 03:15:30,666 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 03:15:30,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 03:15:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-02-04 03:15:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 03:15:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-02-04 03:15:30,673 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 19 [2018-02-04 03:15:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:30,673 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-02-04 03:15:30,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:15:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-02-04 03:15:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 03:15:30,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:30,674 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:30,674 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:15:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 78678979, now seen corresponding path program 1 times [2018-02-04 03:15:30,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:30,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:30,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:30,748 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,749 INFO L182 omatonBuilderFactory]: Interpolants [224#true, 225#false, 226#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 227#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 228#(= 1 (select |#valid| |probe_9_2_#t~ret2.base|)), 229#(= 1 (select |#valid| ~a9.base))] [2018-02-04 03:15:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:30,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:30,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:30,749 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 6 states. [2018-02-04 03:15:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:30,808 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-04 03:15:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:15:30,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 03:15:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:30,809 INFO L225 Difference]: With dead ends: 41 [2018-02-04 03:15:30,809 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 03:15:30,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:15:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 03:15:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-02-04 03:15:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 03:15:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-02-04 03:15:30,814 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 21 [2018-02-04 03:15:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:30,814 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-02-04 03:15:30,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-02-04 03:15:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 03:15:30,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:30,815 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:30,815 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:15:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 78678978, now seen corresponding path program 1 times [2018-02-04 03:15:30,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:30,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:30,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:15:30,861 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,862 INFO L182 omatonBuilderFactory]: Interpolants [313#true, 314#false, 315#(= 0 |ldv_malloc_#t~malloc1.offset|), 316#(= 0 |ldv_malloc_#res.offset|), 317#(= 0 |probe_9_2_#t~ret2.offset|), 318#(= 0 ~a9.offset)] [2018-02-04 03:15:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:15:30,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:15:30,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:15:30,862 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 6 states. [2018-02-04 03:15:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:30,892 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 03:15:30,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:15:30,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 03:15:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:30,893 INFO L225 Difference]: With dead ends: 39 [2018-02-04 03:15:30,893 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 03:15:30,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:15:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 03:15:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-02-04 03:15:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 03:15:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-04 03:15:30,897 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-02-04 03:15:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:30,897 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-04 03:15:30,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:15:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-04 03:15:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 03:15:30,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:30,898 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:30,898 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:15:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1919879344, now seen corresponding path program 1 times [2018-02-04 03:15:30,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:15:30,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:15:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:15:30,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:15:30,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:15:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,931 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= |#valid| |old(#valid)|)] [2018-02-04 03:15:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:15:30,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:15:30,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:15:30,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:15:30,932 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-02-04 03:15:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:15:30,952 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-02-04 03:15:30,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:15:30,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-02-04 03:15:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:15:30,954 INFO L225 Difference]: With dead ends: 40 [2018-02-04 03:15:30,954 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 03:15:30,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:15:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 03:15:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-02-04 03:15:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 03:15:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-02-04 03:15:30,960 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 21 [2018-02-04 03:15:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:15:30,960 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-02-04 03:15:30,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:15:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-02-04 03:15:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:15:30,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:15:30,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:15:30,961 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-02-04 03:15:30,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1696620398, now seen corresponding path program 1 times [2018-02-04 03:15:30,962 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:15:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:15:30,998 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:15:31,006 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 03:15:31,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:15:31 BoogieIcfgContainer [2018-02-04 03:15:31,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:15:31,016 INFO L168 Benchmark]: Toolchain (without parser) took 1239.24 ms. Allocated memory was 397.9 MB in the beginning and 602.4 MB in the end (delta: 204.5 MB). Free memory was 354.8 MB in the beginning and 507.4 MB in the end (delta: -152.6 MB). Peak memory consumption was 51.9 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:31,017 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:15:31,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.21 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 341.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:31,017 INFO L168 Benchmark]: Boogie Preprocessor took 27.70 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:31,017 INFO L168 Benchmark]: RCFGBuilder took 151.48 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 326.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:31,018 INFO L168 Benchmark]: TraceAbstraction took 899.04 ms. Allocated memory was 397.9 MB in the beginning and 602.4 MB in the end (delta: 204.5 MB). Free memory was 326.2 MB in the beginning and 507.4 MB in the end (delta: -181.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:15:31,019 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.10 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.21 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 341.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.70 ms. Allocated memory is still 397.9 MB. Free memory was 341.6 MB in the beginning and 340.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 151.48 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 326.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 899.04 ms. Allocated memory was 397.9 MB in the beginning and 602.4 MB in the end (delta: 204.5 MB). Free memory was 326.2 MB in the beginning and 507.4 MB in the end (delta: -181.1 MB). Peak memory consumption was 23.3 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1456]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1456. Possible FailurePath: [L1434] int *a9; VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1457] CALL entry_point() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1448] CALL, EXPR probe_9_2() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] [L1437] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, a9={0:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, a9={0:0}, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(a9)=0, \old(a9)=0, \old(size)=4, \result={7:0}, a9={0:0}, malloc(size)={7:0}, size=4] [L1437] EXPR ldv_malloc(sizeof(int)) VAL [\old(a9)=0, \old(a9)=0, a9={0:0}, ldv_malloc(sizeof(int))={7:0}] [L1437] a9 = (int *)ldv_malloc(sizeof(int)) [L1440] RET return - -3; VAL [\old(a9)=0, \old(a9)=0, \result=3, a9={7:0}] [L1448] EXPR probe_9_2() VAL [\old(a9)=0, \old(a9)=0, a9={7:0}, probe_9_2()=3] [L1448] int ret = probe_9_2(); [L1450] COND FALSE !(ret==0) VAL [\old(a9)=0, \old(a9)=0, a9={7:0}, ret=3] [L1453] RET a9 = 0 VAL [\old(a9)=0, \old(a9)=0, a9={0:0}, ret=3] [L1457] entry_point() VAL [\old(a9)=0, \old(a9)=0, a9={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 33 locations, 3 error locations. UNSAFE Result, 0.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 74 SDslu, 346 SDs, 0 SdLazy, 85 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=1, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 4336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-15-31-024.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-15-31-024.csv Received shutdown request...