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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:24:40,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:24:40,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:24:40,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:24:40,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:24:40,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:24:40,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:24:40,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:24:40,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:24:40,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:24:40,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:24:40,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:24:40,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:24:40,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:24:40,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:24:40,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:24:40,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:24:40,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:24:40,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:24:40,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:24:40,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:24:40,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:24:40,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:24:40,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:24:40,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:24:40,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:24:40,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:24:40,230 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:24:40,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:24:40,231 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:24:40,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:24:40,231 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:24:40,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:24:40,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:24:40,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:24:40,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:24:40,242 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:24:40,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:24:40,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:24:40,243 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:24:40,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:24:40,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:24:40,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:24:40,243 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:24:40,243 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:24:40,243 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:24:40,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:24:40,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:24:40,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:24:40,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:24:40,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:24:40,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:24:40,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:24:40,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:24:40,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:24:40,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:24:40,287 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:24:40,291 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:24:40,292 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:24:40,293 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:24:40,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 03:24:40,455 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:24:40,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:24:40,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:40,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:24:40,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:24:40,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40, skipping insertion in model container [2018-02-04 03:24:40,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,473 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:40,508 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:24:40,596 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:40,608 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:24:40,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40 WrapperNode [2018-02-04 03:24:40,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:24:40,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:24:40,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:24:40,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:24:40,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (1/1) ... [2018-02-04 03:24:40,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:24:40,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:24:40,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:24:40,639 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:24:40,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (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:24:40,675 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:24:40,675 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:24:40,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:24:40,676 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:24:40,676 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:24:40,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:24:40,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:24:40,676 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:24:40,676 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:24:40,676 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:24:40,677 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:24:40,677 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:24:40,677 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:24:40,677 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:24:40,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:24:40,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:24:40,776 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:24:40,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:40 BoogieIcfgContainer [2018-02-04 03:24:40,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:24:40,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:24:40,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:24:40,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:24:40,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:24:40" (1/3) ... [2018-02-04 03:24:40,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175a1416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:40, skipping insertion in model container [2018-02-04 03:24:40,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:24:40" (2/3) ... [2018-02-04 03:24:40,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175a1416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:24:40, skipping insertion in model container [2018-02-04 03:24:40,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:24:40" (3/3) ... [2018-02-04 03:24:40,782 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 03:24:40,789 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:24:40,794 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 03:24:40,827 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:24:40,827 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:24:40,827 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:24:40,827 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:24:40,827 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:24:40,828 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:24:40,828 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:24:40,828 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:24:40,828 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:24:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 03:24:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 03:24:40,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:40,846 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:40,846 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-02-04 03:24:40,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:40,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:40,982 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:24:40,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:40,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:24:40,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:40,986 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:24:40,986 INFO L182 omatonBuilderFactory]: Interpolants [33#true, 34#false, 35#(= |#valid| |old(#valid)|)] [2018-02-04 03:24:40,987 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:24:40,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:24:41,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:24:41,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:24:41,002 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-02-04 03:24:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,077 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-04 03:24:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:24:41,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 03:24:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,130 INFO L225 Difference]: With dead ends: 42 [2018-02-04 03:24:41,130 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 03:24:41,131 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 03:24:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 03:24:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 03:24:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 03:24:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 03:24:41,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-02-04 03:24:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,158 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 03:24:41,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:24:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 03:24:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:24:41,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,160 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 03:24:41,160 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-02-04 03:24:41,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:41,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:41,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:24:41,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,220 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:24:41,220 INFO L182 omatonBuilderFactory]: Interpolants [112#(not (= 0 |ldv_malloc_#res.base|)), 113#(not (= 0 |entry_point_#t~ret2.base|)), 114#(not (= 0 entry_point_~p~0.base)), 109#true, 110#false, 111#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-04 03:24:41,221 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:24:41,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:41,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:41,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:41,223 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-02-04 03:24:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,270 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-04 03:24:41,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:41,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 03:24:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,272 INFO L225 Difference]: With dead ends: 40 [2018-02-04 03:24:41,272 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 03:24:41,273 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:24:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 03:24:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-04 03:24:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 03:24:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 03:24:41,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-02-04 03:24:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,278 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 03:24:41,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 03:24:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:24:41,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,279 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 03:24:41,279 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-02-04 03:24:41,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,338 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 03:24:41,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:41,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:24:41,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,339 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 03:24:41,339 INFO L182 omatonBuilderFactory]: Interpolants [184#true, 185#false, 186#(= 0 |ldv_malloc_#res.offset|), 187#(= 0 |entry_point_#t~ret3.offset|), 188#(= 0 entry_point_~q~0.offset)] [2018-02-04 03:24:41,339 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 03:24:41,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:24:41,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:24:41,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:41,340 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 03:24:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,352 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 03:24:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:41,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 03:24:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,353 INFO L225 Difference]: With dead ends: 32 [2018-02-04 03:24:41,353 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 03:24:41,354 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 03:24:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 03:24:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-04 03:24:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 03:24:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 03:24:41,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-02-04 03:24:41,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,358 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 03:24:41,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:24:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 03:24:41,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:24:41,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,359 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 03:24:41,360 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,360 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-02-04 03:24:41,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,403 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 03:24:41,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:41,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:24:41,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,404 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 03:24:41,404 INFO L182 omatonBuilderFactory]: Interpolants [256#(= 0 entry_point_~q~0.base), 252#true, 253#false, 254#(= 0 |ldv_malloc_#res.base|), 255#(= 0 |entry_point_#t~ret3.base|)] [2018-02-04 03:24:41,404 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 03:24:41,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:24:41,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:24:41,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:41,405 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-02-04 03:24:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,421 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 03:24:41,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:41,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 03:24:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,423 INFO L225 Difference]: With dead ends: 36 [2018-02-04 03:24:41,423 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 03:24:41,424 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 03:24:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 03:24:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 03:24:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 03:24:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 03:24:41,427 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-02-04 03:24:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,428 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 03:24:41,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:24:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 03:24:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 03:24:41,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,429 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:41,429 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-02-04 03:24:41,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,484 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 03:24:41,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:41,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:24:41,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,485 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 03:24:41,485 INFO L182 omatonBuilderFactory]: Interpolants [324#true, 325#false, 326#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 327#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 328#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-04 03:24:41,485 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 03:24:41,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:24:41,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:24:41,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:24:41,486 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-02-04 03:24:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,497 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-04 03:24:41,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:24:41,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 03:24:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,498 INFO L225 Difference]: With dead ends: 33 [2018-02-04 03:24:41,498 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 03:24:41,498 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 03:24:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 03:24:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 03:24:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 03:24:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 03:24:41,501 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-02-04 03:24:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,501 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 03:24:41,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:24:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 03:24:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:24:41,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,501 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] [2018-02-04 03:24:41,501 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-02-04 03:24:41,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,551 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 03:24:41,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:41,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:24:41,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,552 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 03:24:41,552 INFO L182 omatonBuilderFactory]: Interpolants [393#true, 394#false, 395#(= 0 |ldv_malloc_#t~malloc1.offset|), 396#(= 0 |ldv_malloc_#res.offset|), 397#(= 0 |entry_point_#t~ret2.offset|), 398#(= 0 entry_point_~p~0.offset)] [2018-02-04 03:24:41,552 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 03:24:41,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:41,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:41,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:41,553 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 03:24:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,578 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 03:24:41,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:24:41,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 03:24:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,580 INFO L225 Difference]: With dead ends: 30 [2018-02-04 03:24:41,580 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 03:24:41,581 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:24:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 03:24:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 03:24:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 03:24:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 03:24:41,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-02-04 03:24:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,584 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 03:24:41,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 03:24:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:24:41,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,585 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] [2018-02-04 03:24:41,585 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-02-04 03:24:41,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:41,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:41,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:24:41,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:41,691 INFO L182 omatonBuilderFactory]: Interpolants [464#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 465#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 466#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 467#(= 1 (select |#valid| entry_point_~p~0.base)), 468#(= |#valid| |old(#valid)|), 469#(and (= |#valid| |old(#valid)|) (= 0 |ldv_malloc_#res.base|)), 470#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 |entry_point_#t~ret3.base|)), 471#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 entry_point_~q~0.base)), 462#true, 463#false] [2018-02-04 03:24:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:41,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:24:41,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:24:41,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:41,692 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-02-04 03:24:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,772 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-04 03:24:41,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:24:41,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 03:24:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,774 INFO L225 Difference]: With dead ends: 31 [2018-02-04 03:24:41,774 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 03:24:41,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:24:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 03:24:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 03:24:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 03:24:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 03:24:41,777 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-02-04 03:24:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,777 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 03:24:41,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:24:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 03:24:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:24:41,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,778 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 03:24:41,778 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-02-04 03:24:41,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,822 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 03:24:41,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:41,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:41,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,823 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 03:24:41,823 INFO L182 omatonBuilderFactory]: Interpolants [536#true, 537#false, 538#(= 0 |ldv_malloc_#t~malloc1.offset|), 539#(= 0 |ldv_malloc_#res.offset|), 540#(= 0 |entry_point_#t~ret3.offset|), 541#(= 0 entry_point_~q~0.offset)] [2018-02-04 03:24:41,823 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 03:24:41,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:41,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:41,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:41,823 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 03:24:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,836 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 03:24:41,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:24:41,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:24:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,837 INFO L225 Difference]: With dead ends: 30 [2018-02-04 03:24:41,837 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 03:24:41,838 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 03:24:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 03:24:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 03:24:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 03:24:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 03:24:41,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-02-04 03:24:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,841 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 03:24:41,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 03:24:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:24:41,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,842 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 03:24:41,842 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-02-04 03:24:41,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:41,880 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 03:24:41,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:41,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:24:41,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:41,880 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 03:24:41,880 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| |entry_point_#t~ret3.base|)), 609#(= 1 (select |#valid| entry_point_~q~0.base)), 604#true, 605#false, 606#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 607#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-04 03:24:41,880 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 03:24:41,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:24:41,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:24:41,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:24:41,881 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-02-04 03:24:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:41,931 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 03:24:41,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:24:41,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:24:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:41,932 INFO L225 Difference]: With dead ends: 29 [2018-02-04 03:24:41,932 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 03:24:41,933 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 03:24:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 03:24:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 03:24:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 03:24:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-04 03:24:41,935 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-02-04 03:24:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:41,935 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-04 03:24:41,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:24:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-04 03:24:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:24:41,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:41,936 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:41,936 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-02-04 03:24:41,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:41,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:42,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:42,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:24:42,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:42,119 INFO L182 omatonBuilderFactory]: Interpolants [672#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 673#(= (select |#valid| |ldv_malloc_#res.base|) 1), 674#(= (select |#valid| |entry_point_#t~ret2.base|) 1), 675#(= 1 (select |#valid| entry_point_~p~0.base)), 676#(= |#valid| |old(#valid)|), 677#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 678#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 679#(and (not (= entry_point_~p~0.base |entry_point_#t~ret3.base|)) (not (= 0 |entry_point_#t~ret3.base|)) (= 1 (select |#valid| entry_point_~p~0.base))), 680#(and (not (= 0 entry_point_~q~0.base)) (= 1 (select (store |#valid| entry_point_~q~0.base 0) entry_point_~p~0.base))), 670#true, 671#false] [2018-02-04 03:24:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:24:42,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:24:42,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:24:42,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:24:42,120 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2018-02-04 03:24:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,256 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-02-04 03:24:42,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:24:42,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-04 03:24:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,257 INFO L225 Difference]: With dead ends: 28 [2018-02-04 03:24:42,257 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 03:24:42,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:24:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 03:24:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-02-04 03:24:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 03:24:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 03:24:42,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2018-02-04 03:24:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,259 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 03:24:42,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:24:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 03:24:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:24:42,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:42,260 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, 1] [2018-02-04 03:24:42,260 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times [2018-02-04 03:24:42,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:42,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,422 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 03:24:42,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:24:42,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:24:42,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,423 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 03:24:42,423 INFO L182 omatonBuilderFactory]: Interpolants [738#true, 739#false, 740#(= |#valid| |old(#valid)|), 741#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 742#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 743#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret2.base| (select |#valid| |entry_point_#t~ret2.base|))) (not (= 0 |entry_point_#t~ret2.base|)) (= (select |old(#valid)| |entry_point_#t~ret2.base|) 0)), 744#(and (not (= 0 entry_point_~p~0.base)) (= (select |old(#valid)| entry_point_~p~0.base) 0) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (select |#valid| entry_point_~p~0.base)))), 745#(and (= |#valid| |old(#valid)|) (= 0 |ldv_malloc_#res.base|)), 746#(and (not (= 0 entry_point_~p~0.base)) (= (select |old(#valid)| entry_point_~p~0.base) 0) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (select |#valid| entry_point_~p~0.base))) (= 0 |entry_point_#t~ret3.base|)), 747#(and (not (= 0 entry_point_~p~0.base)) (= (select |old(#valid)| entry_point_~p~0.base) 0) (= 0 entry_point_~q~0.base) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (select |#valid| entry_point_~p~0.base))))] [2018-02-04 03:24:42,423 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 03:24:42,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:24:42,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:24:42,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:42,424 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states. [2018-02-04 03:24:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:42,566 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 03:24:42,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:24:42,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-04 03:24:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:42,567 INFO L225 Difference]: With dead ends: 31 [2018-02-04 03:24:42,567 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 03:24:42,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:24:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 03:24:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 03:24:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 03:24:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-04 03:24:42,570 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 26 [2018-02-04 03:24:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:42,570 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-04 03:24:42,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:24:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-04 03:24:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:24:42,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:24:42,571 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:24:42,571 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 03:24:42,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1917235028, now seen corresponding path program 1 times [2018-02-04 03:24:42,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:24:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:24:42,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:24:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:24:42,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:24:42,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:24:42,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:24:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:24:42,926 INFO L182 omatonBuilderFactory]: Interpolants [806#true, 807#false, 808#(= |#valid| |old(#valid)|), 809#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 810#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 811#(and (or (= |entry_point_#t~ret2.base| (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (select |old(#valid)| |entry_point_#t~ret2.base|) 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 812#(and (not (= 0 entry_point_~p~0.base)) (= (select |old(#valid)| entry_point_~p~0.base) 0) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (select |#valid| entry_point_~p~0.base)))), 813#(and (not (= 0 |entry_point_#t~ret3.base|)) (or (= entry_point_~p~0.base |entry_point_#t~ret3.base|) (and (= |#valid| (store (store |old(#valid)| |entry_point_#t~ret3.base| (select |#valid| |entry_point_#t~ret3.base|)) entry_point_~p~0.base (select |#valid| entry_point_~p~0.base))) (= (select |old(#valid)| |entry_point_#t~ret3.base|) 0) (= (select |old(#valid)| entry_point_~p~0.base) 0))) (not (= 0 entry_point_~p~0.base))), 814#(and (not (= 0 entry_point_~q~0.base)) (not (= 0 entry_point_~p~0.base)) (or (= entry_point_~q~0.base entry_point_~p~0.base) (and (= (store (store |old(#valid)| entry_point_~p~0.base (select (store |#valid| entry_point_~q~0.base 0) entry_point_~p~0.base)) entry_point_~q~0.base (select (store |#valid| entry_point_~q~0.base 0) entry_point_~q~0.base)) (store |#valid| entry_point_~q~0.base 0)) (= (select |old(#valid)| entry_point_~q~0.base) (select (store |#valid| entry_point_~q~0.base 0) entry_point_~q~0.base)) (= (select |old(#valid)| entry_point_~p~0.base) 0)))), 815#(and (not (= 0 entry_point_~p~0.base)) (or (and (= (store |old(#valid)| entry_point_~p~0.base (select (store |#valid| entry_point_~p~0.base 0) entry_point_~p~0.base)) (store |#valid| entry_point_~p~0.base 0)) (= (select |old(#valid)| entry_point_~p~0.base) (select (store |#valid| entry_point_~p~0.base 0) entry_point_~p~0.base))) (= 0 (select |#valid| entry_point_~p~0.base))))] [2018-02-04 03:24:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:24:42,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:24:42,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:24:42,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:24:42,928 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-02-04 03:24:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:24:43,120 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-02-04 03:24:43,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:24:43,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-04 03:24:43,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:24:43,124 INFO L225 Difference]: With dead ends: 22 [2018-02-04 03:24:43,124 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:24:43,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:24:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:24:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:24:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:24:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:24:43,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-04 03:24:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:24:43,125 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:24:43,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:24:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:24:43,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:24:43,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:24:43 BoogieIcfgContainer [2018-02-04 03:24:43,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:24:43,145 INFO L168 Benchmark]: Toolchain (without parser) took 2688.81 ms. Allocated memory was 401.1 MB in the beginning and 674.2 MB in the end (delta: 273.2 MB). Free memory was 357.8 MB in the beginning and 644.4 MB in the end (delta: -286.7 MB). Peak memory consumption was 178.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:43,146 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:24:43,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.90 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 344.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:24:43,146 INFO L168 Benchmark]: Boogie Preprocessor took 24.57 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 343.2 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:24:43,146 INFO L168 Benchmark]: RCFGBuilder took 137.93 ms. Allocated memory is still 401.1 MB. Free memory was 343.2 MB in the beginning and 328.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:43,147 INFO L168 Benchmark]: TraceAbstraction took 2366.87 ms. Allocated memory was 401.1 MB in the beginning and 674.2 MB in the end (delta: 273.2 MB). Free memory was 328.7 MB in the beginning and 644.4 MB in the end (delta: -315.8 MB). Peak memory consumption was 149.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:24:43,148 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.18 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.90 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 344.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 24.57 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 343.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 137.93 ms. Allocated memory is still 401.1 MB. Free memory was 343.2 MB in the beginning and 328.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2366.87 ms. Allocated memory was 401.1 MB in the beginning and 674.2 MB in the end (delta: 273.2 MB). Free memory was 328.7 MB in the beginning and 644.4 MB in the end (delta: -315.8 MB). Peak memory consumption was 149.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 5 error locations. SAFE Result, 2.3s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 66 SDslu, 812 SDs, 0 SdLazy, 597 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 37/48 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, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 27249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 37/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-24-43-154.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-24-43-154.csv Received shutdown request...