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_test4_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:29:04,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:29:04,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:29:04,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:29:04,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:29:04,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:29:04,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:29:04,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:29:04,869 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:29:04,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:29:04,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:29:04,871 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:29:04,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:29:04,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:29:04,873 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:29:04,875 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:29:04,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:29:04,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:29:04,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:29:04,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:29:04,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:29:04,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:29:04,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:29:04,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:29:04,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:29:04,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:29:04,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:29:04,884 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:29:04,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:29:04,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:29:04,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:29:04,885 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 16:29:04,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:29:04,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:29:04,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:29:04,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:29:04,896 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:29:04,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:29:04,896 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:29:04,897 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:29:04,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:29:04,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:29:04,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:29:04,897 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:29:04,897 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:29:04,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:29:04,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:29:04,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:29:04,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:29:04,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:29:04,898 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:29:04,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:29:04,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:29:04,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:29:04,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:29:04,937 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:29:04,940 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:29:04,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:29:04,941 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:29:04,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_false-valid-memtrack_true-termination.i [2018-02-04 16:29:05,099 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:29:05,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:29:05,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:29:05,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:29:05,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:29:05,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581e1694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05, skipping insertion in model container [2018-02-04 16:29:05,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,121 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:29:05,154 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:29:05,244 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:29:05,252 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:29:05,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05 WrapperNode [2018-02-04 16:29:05,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:29:05,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:29:05,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:29:05,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:29:05,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (1/1) ... [2018-02-04 16:29:05,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:29:05,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:29:05,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:29:05,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:29:05,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (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 16:29:05,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:29:05,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:29:05,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 16:29:05,319 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 16:29:05,320 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:29:05,320 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:29:05,411 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:29:05,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:29:05 BoogieIcfgContainer [2018-02-04 16:29:05,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:29:05,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:29:05,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:29:05,414 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:29:05,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:29:05" (1/3) ... [2018-02-04 16:29:05,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:29:05, skipping insertion in model container [2018-02-04 16:29:05,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:29:05" (2/3) ... [2018-02-04 16:29:05,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:29:05, skipping insertion in model container [2018-02-04 16:29:05,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:29:05" (3/3) ... [2018-02-04 16:29:05,417 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_false-valid-memtrack_true-termination.i [2018-02-04 16:29:05,422 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:29:05,427 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 16:29:05,459 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:29:05,459 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:29:05,459 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:29:05,459 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:29:05,459 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:29:05,460 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:29:05,460 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:29:05,460 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:29:05,461 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:29:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-02-04 16:29:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 16:29:05,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:05,481 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:05,481 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1713265670, now seen corresponding path program 1 times [2018-02-04 16:29:05,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:05,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:05,638 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 16:29:05,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:05,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:29:05,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:05,641 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 16:29:05,641 INFO L182 omatonBuilderFactory]: Interpolants [32#(= |#valid| |old(#valid)|), 30#true, 31#false] [2018-02-04 16:29:05,641 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 16:29:05,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:29:05,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:29:05,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:29:05,652 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-02-04 16:29:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:05,724 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-02-04 16:29:05,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:29:05,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 16:29:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:05,772 INFO L225 Difference]: With dead ends: 39 [2018-02-04 16:29:05,772 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 16:29:05,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 16:29:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 16:29:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-02-04 16:29:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 16:29:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 16:29:05,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-04 16:29:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:05,801 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 16:29:05,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:29:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 16:29:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 16:29:05,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:05,802 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:05,803 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash 295629500, now seen corresponding path program 1 times [2018-02-04 16:29:05,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:05,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:05,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 16:29:05,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:05,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:29:05,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:05,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 16:29:05,862 INFO L182 omatonBuilderFactory]: Interpolants [100#true, 101#false, 102#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 103#(not (= 0 |ldv_malloc_#res.base|)), 104#(not (= 0 |entry_point_#t~ret2.base|)), 105#(not (= 0 entry_point_~p~0.base))] [2018-02-04 16:29:05,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 16:29:05,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:29:05,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:29:05,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:29:05,864 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 6 states. [2018-02-04 16:29:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:05,890 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-02-04 16:29:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:29:05,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 16:29:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:05,892 INFO L225 Difference]: With dead ends: 35 [2018-02-04 16:29:05,892 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 16:29:05,893 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 16:29:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 16:29:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-02-04 16:29:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 16:29:05,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-04 16:29:05,897 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2018-02-04 16:29:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:05,897 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-04 16:29:05,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:29:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-04 16:29:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 16:29:05,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:05,898 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:05,899 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:05,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1865005914, now seen corresponding path program 1 times [2018-02-04 16:29:05,900 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:05,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:05,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:05,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:29:05,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:05,962 INFO L182 omatonBuilderFactory]: Interpolants [167#true, 168#false, 169#(= 0 |ldv_malloc_#res.offset|), 170#(= 0 |entry_point_#t~ret3.offset|), 171#(= 0 entry_point_~q~0.offset)] [2018-02-04 16:29:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:05,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:29:05,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:29:05,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:05,963 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-02-04 16:29:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:05,991 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-02-04 16:29:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:29:05,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 16:29:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:05,992 INFO L225 Difference]: With dead ends: 29 [2018-02-04 16:29:05,992 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 16:29:05,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 16:29:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-02-04 16:29:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 16:29:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 16:29:05,997 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2018-02-04 16:29:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:05,997 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 16:29:05,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:29:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 16:29:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 16:29:05,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:05,998 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:05,998 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1865005913, now seen corresponding path program 1 times [2018-02-04 16:29:05,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:06,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:06,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:06,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:29:06,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:06,036 INFO L182 omatonBuilderFactory]: Interpolants [229#true, 230#false, 231#(= 0 |ldv_malloc_#res.base|), 232#(= 0 |entry_point_#t~ret3.base|), 233#(= 0 entry_point_~q~0.base)] [2018-02-04 16:29:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:06,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:29:06,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:29:06,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:06,036 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-02-04 16:29:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:06,044 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-02-04 16:29:06,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:29:06,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 16:29:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:06,046 INFO L225 Difference]: With dead ends: 30 [2018-02-04 16:29:06,046 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 16:29:06,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 16:29:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-02-04 16:29:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 16:29:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-02-04 16:29:06,050 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2018-02-04 16:29:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:06,050 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-02-04 16:29:06,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:29:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-02-04 16:29:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 16:29:06,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:06,051 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:06,051 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 245416420, now seen corresponding path program 1 times [2018-02-04 16:29:06,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:06,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:06,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:29:06,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:29:06,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:06,095 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 295#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 296#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-04 16:29:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:29:06,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:29:06,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:29:06,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:06,096 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2018-02-04 16:29:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:06,111 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 16:29:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:29:06,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 16:29:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:06,112 INFO L225 Difference]: With dead ends: 30 [2018-02-04 16:29:06,112 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 16:29:06,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:29:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 16:29:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 16:29:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 16:29:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-04 16:29:06,114 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-02-04 16:29:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:06,115 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-04 16:29:06,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:29:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-04 16:29:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 16:29:06,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:06,115 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:06,115 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1092908838, now seen corresponding path program 1 times [2018-02-04 16:29:06,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:06,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:29:06,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:06,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:29:06,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:29:06,176 INFO L182 omatonBuilderFactory]: Interpolants [355#true, 356#false, 357#(= 0 |ldv_malloc_#t~malloc1.offset|), 358#(= 0 |ldv_malloc_#res.offset|), 359#(= 0 |entry_point_#t~ret3.offset|), 360#(= 0 entry_point_~q~0.offset)] [2018-02-04 16:29:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:29:06,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:29:06,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:29:06,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:29:06,177 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 6 states. [2018-02-04 16:29:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:06,190 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-02-04 16:29:06,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:29:06,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 16:29:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:06,191 INFO L225 Difference]: With dead ends: 27 [2018-02-04 16:29:06,191 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 16:29:06,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 16:29:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 16:29:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 16:29:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 16:29:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 16:29:06,193 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-02-04 16:29:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:06,193 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 16:29:06,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:29:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 16:29:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 16:29:06,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:06,194 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:06,194 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:06,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1092908839, now seen corresponding path program 1 times [2018-02-04 16:29:06,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:29:06,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:29:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:29:06,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:29:06,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:29:06,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:29:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:29:06,237 INFO L182 omatonBuilderFactory]: Interpolants [417#true, 418#false, 419#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 420#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 421#(= 1 (select |#valid| |entry_point_#t~ret3.base|)), 422#(= 1 (select |#valid| entry_point_~q~0.base))] [2018-02-04 16:29:06,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:29:06,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:29:06,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:29:06,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:29:06,238 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 6 states. [2018-02-04 16:29:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:29:06,285 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 16:29:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:29:06,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 16:29:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:29:06,286 INFO L225 Difference]: With dead ends: 26 [2018-02-04 16:29:06,286 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 16:29:06,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 16:29:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 16:29:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-02-04 16:29:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 16:29:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-04 16:29:06,289 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 24 [2018-02-04 16:29:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:29:06,289 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-04 16:29:06,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:29:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-04 16:29:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 16:29:06,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:29:06,290 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:29:06,290 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 16:29:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash -191782558, now seen corresponding path program 1 times [2018-02-04 16:29:06,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:29:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:29:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:29:06,325 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 16:29:06,333 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 16:29:06,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:29:06 BoogieIcfgContainer [2018-02-04 16:29:06,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:29:06,341 INFO L168 Benchmark]: Toolchain (without parser) took 1241.15 ms. Allocated memory was 402.1 MB in the beginning and 605.0 MB in the end (delta: 202.9 MB). Free memory was 359.0 MB in the beginning and 501.5 MB in the end (delta: -142.5 MB). Peak memory consumption was 60.4 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:06,342 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:29:06,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.70 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 347.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:06,342 INFO L168 Benchmark]: Boogie Preprocessor took 22.33 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:06,342 INFO L168 Benchmark]: RCFGBuilder took 133.10 ms. Allocated memory is still 402.1 MB. Free memory was 344.5 MB in the beginning and 330.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:06,343 INFO L168 Benchmark]: TraceAbstraction took 928.38 ms. Allocated memory was 402.1 MB in the beginning and 605.0 MB in the end (delta: 202.9 MB). Free memory was 330.2 MB in the beginning and 501.5 MB in the end (delta: -171.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:29:06,343 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.70 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 347.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.33 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 133.10 ms. Allocated memory is still 402.1 MB. Free memory was 344.5 MB in the beginning and 330.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 928.38 ms. Allocated memory was 402.1 MB in the beginning and 605.0 MB in the end (delta: 202.9 MB). Free memory was 330.2 MB in the beginning and 501.5 MB in the end (delta: -171.3 MB). Peak memory consumption was 31.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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1443]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1444] CALL entry_point() [L1435] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] [L1435] EXPR ldv_malloc(sizeof(int)) VAL [ldv_malloc(sizeof(int))={6:0}] [L1435] int *p = (int *)ldv_malloc(sizeof(int)); [L1436] COND TRUE \read(*p) VAL [p={6:0}] [L1437] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1437] EXPR ldv_malloc(sizeof(int)) VAL [ldv_malloc(sizeof(int))={0:0}, p={6:0}] [L1437] int *q = (int *)ldv_malloc(sizeof(int)); [L1438] FCALL free(q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 3 error locations. UNSAFE Result, 0.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 26 SDslu, 471 SDs, 0 SdLazy, 106 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 22/24 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, 7 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 4818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 22/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-29-06-348.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-29-06-348.csv Received shutdown request...