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/cav18-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-26d9e06-m
[2018-02-02 10:24:16,818 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 10:24:16,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 10:24:16,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 10:24:16,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 10:24:16,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 10:24:16,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 10:24:16,832 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 10:24:16,834 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 10:24:16,834 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 10:24:16,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 10:24:16,835 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 10:24:16,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 10:24:16,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 10:24:16,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 10:24:16,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 10:24:16,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 10:24:16,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 10:24:16,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 10:24:16,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 10:24:16,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 10:24:16,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 10:24:16,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 10:24:16,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 10:24:16,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 10:24:16,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 10:24:16,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 10:24:16,849 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 10:24:16,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 10:24:16,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 10:24:16,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 10:24:16,850 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf
[2018-02-02 10:24:16,860 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 10:24:16,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 10:24:16,861 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 10:24:16,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 10:24:16,861 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 10:24:16,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 10:24:16,861 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 10:24:16,862 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 10:24:16,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 10:24:16,862 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 10:24:16,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 10:24:16,862 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 10:24:16,862 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 10:24:16,863 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 10:24:16,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 10:24:16,863 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 10:24:16,863 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 10:24:16,863 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 10:24:16,863 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 10:24:16,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 10:24:16,864 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:24:16,864 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 10:24:16,864 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-02 10:24:16,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 10:24:16,900 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 10:24:16,903 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 10:24:16,904 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 10:24:16,905 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 10:24:16,905 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-02 10:24:17,064 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 10:24:17,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 10:24:17,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 10:24:17,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 10:24:17,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 10:24:17,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc89e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17, skipping insertion in model container
[2018-02-02 10:24:17,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,082 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:24:17,115 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:24:17,198 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:24:17,209 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:24:17,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17 WrapperNode
[2018-02-02 10:24:17,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 10:24:17,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 10:24:17,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 10:24:17,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 10:24:17,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (1/1) ...
[2018-02-02 10:24:17,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 10:24:17,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 10:24:17,241 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 10:24:17,241 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 10:24:17,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (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-02 10:24:17,275 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 10:24:17,275 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 10:24:17,275 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2018-02-02 10:24:17,275 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point
[2018-02-02 10:24:17,275 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc
[2018-02-02 10:24:17,276 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point
[2018-02-02 10:24:17,277 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 10:24:17,277 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 10:24:17,277 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 10:24:17,377 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 10:24:17,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:17 BoogieIcfgContainer
[2018-02-02 10:24:17,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 10:24:17,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 10:24:17,378 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 10:24:17,381 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 10:24:17,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:24:17" (1/3) ...
[2018-02-02 10:24:17,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d202b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:17, skipping insertion in model container
[2018-02-02 10:24:17,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:24:17" (2/3) ...
[2018-02-02 10:24:17,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d202b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:24:17, skipping insertion in model container
[2018-02-02 10:24:17,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:24:17" (3/3) ...
[2018-02-02 10:24:17,384 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i
[2018-02-02 10:24:17,392 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 10:24:17,398 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations.
[2018-02-02 10:24:17,431 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 10:24:17,431 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 10:24:17,431 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-02 10:24:17,432 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 10:24:17,432 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 10:24:17,432 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 10:24:17,432 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 10:24:17,432 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 10:24:17,433 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 10:24:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states.
[2018-02-02 10:24:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 10:24:17,451 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:17,452 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:24:17,452 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times
[2018-02-02 10:24:17,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:17,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:17,594 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-02 10:24:17,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:24:17,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:24:17,597 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:17,597 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-02 10:24:17,598 INFO L182 omatonBuilderFactory]: Interpolants [33#true, 34#false, 35#(= |#valid| |old(#valid)|)]
[2018-02-02 10:24:17,598 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-02 10:24:17,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 10:24:17,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 10:24:17,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:24:17,613 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states.
[2018-02-02 10:24:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:17,676 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions.
[2018-02-02 10:24:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 10:24:17,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2018-02-02 10:24:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:17,735 INFO L225 Difference]: With dead ends: 42
[2018-02-02 10:24:17,735 INFO L226 Difference]: Without dead ends: 36
[2018-02-02 10:24:17,737 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-02 10:24:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2018-02-02 10:24:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31.
[2018-02-02 10:24:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-02 10:24:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions.
[2018-02-02 10:24:17,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16
[2018-02-02 10:24:17,766 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:17,766 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions.
[2018-02-02 10:24:17,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 10:24:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions.
[2018-02-02 10:24:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 10:24:17,767 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:17,767 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-02 10:24:17,767 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:17,768 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times
[2018-02-02 10:24:17,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:17,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:17,827 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-02 10:24:17,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:24:17,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 10:24:17,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:17,827 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-02 10:24:17,828 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-02 10:24:17,828 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-02 10:24:17,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:24:17,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:24:17,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:24:17,829 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states.
[2018-02-02 10:24:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:17,860 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions.
[2018-02-02 10:24:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:24:17,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2018-02-02 10:24:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:17,861 INFO L225 Difference]: With dead ends: 40
[2018-02-02 10:24:17,861 INFO L226 Difference]: Without dead ends: 40
[2018-02-02 10:24:17,862 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-02 10:24:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2018-02-02 10:24:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27.
[2018-02-02 10:24:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2018-02-02 10:24:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions.
[2018-02-02 10:24:17,867 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18
[2018-02-02 10:24:17,867 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:17,867 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions.
[2018-02-02 10:24:17,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:24:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions.
[2018-02-02 10:24:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-02 10:24:17,868 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:17,868 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:24:17,868 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times
[2018-02-02 10:24:17,869 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:17,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:17,921 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-02 10:24:17,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:24:17,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:24:17,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:17,922 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-02 10:24:17,922 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-02 10:24:17,923 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-02 10:24:17,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:24:17,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:24:17,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:24:17,924 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states.
[2018-02-02 10:24:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:17,934 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions.
[2018-02-02 10:24:17,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:24:17,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-02-02 10:24:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:17,935 INFO L225 Difference]: With dead ends: 32
[2018-02-02 10:24:17,935 INFO L226 Difference]: Without dead ends: 32
[2018-02-02 10:24:17,935 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-02 10:24:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2018-02-02 10:24:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31.
[2018-02-02 10:24:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-02 10:24:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions.
[2018-02-02 10:24:17,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20
[2018-02-02 10:24:17,938 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:17,938 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions.
[2018-02-02 10:24:17,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:24:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions.
[2018-02-02 10:24:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-02 10:24:17,938 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:17,938 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:24:17,939 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times
[2018-02-02 10:24:17,940 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:17,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:17,986 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-02 10:24:17,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:24:17,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:24:17,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:17,987 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-02 10:24:17,987 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-02 10:24:17,987 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-02 10:24:17,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:24:17,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:24:17,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:24:17,988 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states.
[2018-02-02 10:24:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:17,996 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions.
[2018-02-02 10:24:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:24:17,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-02-02 10:24:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:17,997 INFO L225 Difference]: With dead ends: 36
[2018-02-02 10:24:17,997 INFO L226 Difference]: Without dead ends: 36
[2018-02-02 10:24:17,998 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-02 10:24:17,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2018-02-02 10:24:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31.
[2018-02-02 10:24:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-02 10:24:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions.
[2018-02-02 10:24:18,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20
[2018-02-02 10:24:18,001 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:18,001 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions.
[2018-02-02 10:24:18,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:24:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2018-02-02 10:24:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-02 10:24:18,001 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:18,001 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-02 10:24:18,001 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times
[2018-02-02 10:24:18,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:18,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:18,057 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-02 10:24:18,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:24:18,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:24:18,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:18,058 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-02 10:24:18,058 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-02 10:24:18,059 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-02 10:24:18,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:24:18,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:24:18,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:24:18,059 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states.
[2018-02-02 10:24:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:18,073 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions.
[2018-02-02 10:24:18,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:24:18,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2018-02-02 10:24:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:18,075 INFO L225 Difference]: With dead ends: 33
[2018-02-02 10:24:18,075 INFO L226 Difference]: Without dead ends: 31
[2018-02-02 10:24:18,075 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-02 10:24:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2018-02-02 10:24:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2018-02-02 10:24:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-02 10:24:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions.
[2018-02-02 10:24:18,077 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21
[2018-02-02 10:24:18,078 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:18,078 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions.
[2018-02-02 10:24:18,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:24:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions.
[2018-02-02 10:24:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 10:24:18,079 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:18,079 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-02 10:24:18,079 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times
[2018-02-02 10:24:18,080 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:18,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:18,138 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-02 10:24:18,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:24:18,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:24:18,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:18,138 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-02 10:24:18,138 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-02 10:24:18,138 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-02 10:24:18,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:24:18,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:24:18,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:24:18,139 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states.
[2018-02-02 10:24:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:18,159 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions.
[2018-02-02 10:24:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:24:18,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23
[2018-02-02 10:24:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:18,161 INFO L225 Difference]: With dead ends: 30
[2018-02-02 10:24:18,161 INFO L226 Difference]: Without dead ends: 30
[2018-02-02 10:24:18,161 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-02 10:24:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2018-02-02 10:24:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2018-02-02 10:24:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-02-02 10:24:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions.
[2018-02-02 10:24:18,164 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23
[2018-02-02 10:24:18,164 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:18,164 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions.
[2018-02-02 10:24:18,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:24:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2018-02-02 10:24:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 10:24:18,165 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:18,165 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-02 10:24:18,165 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times
[2018-02-02 10:24:18,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:18,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:18,269 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-02 10:24:18,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:24:18,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:24:18,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:18,270 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-02 10:24:18,270 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-02 10:24:18,270 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-02 10:24:18,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:24:18,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:24:18,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:24:18,271 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states.
[2018-02-02 10:24:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:18,329 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions.
[2018-02-02 10:24:18,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:24:18,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23
[2018-02-02 10:24:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:18,330 INFO L225 Difference]: With dead ends: 31
[2018-02-02 10:24:18,330 INFO L226 Difference]: Without dead ends: 31
[2018-02-02 10:24:18,330 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-02 10:24:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2018-02-02 10:24:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2018-02-02 10:24:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-02 10:24:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions.
[2018-02-02 10:24:18,332 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23
[2018-02-02 10:24:18,332 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:18,332 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions.
[2018-02-02 10:24:18,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:24:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions.
[2018-02-02 10:24:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-02-02 10:24:18,332 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:18,332 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-02 10:24:18,333 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times
[2018-02-02 10:24:18,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:18,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:18,374 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-02 10:24:18,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:24:18,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:24:18,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:18,374 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-02 10:24:18,375 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-02 10:24:18,375 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-02 10:24:18,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:24:18,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:24:18,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:24:18,375 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states.
[2018-02-02 10:24:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:18,388 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions.
[2018-02-02 10:24:18,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:24:18,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24
[2018-02-02 10:24:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:18,389 INFO L225 Difference]: With dead ends: 30
[2018-02-02 10:24:18,389 INFO L226 Difference]: Without dead ends: 30
[2018-02-02 10:24:18,389 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-02 10:24:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2018-02-02 10:24:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2018-02-02 10:24:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-02-02 10:24:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions.
[2018-02-02 10:24:18,392 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24
[2018-02-02 10:24:18,392 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:18,392 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions.
[2018-02-02 10:24:18,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:24:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2018-02-02 10:24:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-02-02 10:24:18,393 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:18,394 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-02 10:24:18,394 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times
[2018-02-02 10:24:18,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:18,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:18,432 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-02 10:24:18,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:24:18,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:24:18,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:18,433 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-02 10:24:18,433 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-02 10:24:18,433 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-02 10:24:18,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:24:18,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:24:18,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:24:18,433 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states.
[2018-02-02 10:24:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:18,467 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions.
[2018-02-02 10:24:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:24:18,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24
[2018-02-02 10:24:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:18,468 INFO L225 Difference]: With dead ends: 29
[2018-02-02 10:24:18,468 INFO L226 Difference]: Without dead ends: 29
[2018-02-02 10:24:18,468 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-02 10:24:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2018-02-02 10:24:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2018-02-02 10:24:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2018-02-02 10:24:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions.
[2018-02-02 10:24:18,471 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24
[2018-02-02 10:24:18,471 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:18,471 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions.
[2018-02-02 10:24:18,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:24:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions.
[2018-02-02 10:24:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-02 10:24:18,472 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:18,472 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-02 10:24:18,473 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:18,473 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times
[2018-02-02 10:24:18,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:18,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:18,611 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-02 10:24:18,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:24:18,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-02-02 10:24:18,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:18,612 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-02 10:24:18,612 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-02 10:24:18,612 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-02 10:24:18,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 10:24:18,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 10:24:18,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:24:18,613 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states.
[2018-02-02 10:24:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:18,768 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions.
[2018-02-02 10:24:18,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:24:18,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25
[2018-02-02 10:24:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:18,769 INFO L225 Difference]: With dead ends: 28
[2018-02-02 10:24:18,769 INFO L226 Difference]: Without dead ends: 28
[2018-02-02 10:24:18,770 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-02 10:24:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2018-02-02 10:24:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25.
[2018-02-02 10:24:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2018-02-02 10:24:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions.
[2018-02-02 10:24:18,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25
[2018-02-02 10:24:18,772 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:18,772 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions.
[2018-02-02 10:24:18,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 10:24:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions.
[2018-02-02 10:24:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-02 10:24:18,773 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:18,773 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-02 10:24:18,773 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times
[2018-02-02 10:24:18,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:18,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:18,905 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-02 10:24:18,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:24:18,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:24:18,906 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:18,906 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-02 10:24:18,906 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-02 10:24:18,906 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-02 10:24:18,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:24:18,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:24:18,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:24:18,907 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states.
[2018-02-02 10:24:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:19,021 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions.
[2018-02-02 10:24:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:24:19,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26
[2018-02-02 10:24:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:19,022 INFO L225 Difference]: With dead ends: 31
[2018-02-02 10:24:19,022 INFO L226 Difference]: Without dead ends: 23
[2018-02-02 10:24:19,022 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-02 10:24:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2018-02-02 10:24:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2018-02-02 10:24:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2018-02-02 10:24:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions.
[2018-02-02 10:24:19,024 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 26
[2018-02-02 10:24:19,024 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:19,024 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions.
[2018-02-02 10:24:19,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:24:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions.
[2018-02-02 10:24:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 10:24:19,025 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:24:19,025 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-02 10:24:19,025 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:24:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1917235028, now seen corresponding path program 1 times
[2018-02-02 10:24:19,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:24:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:24:19,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:24:19,396 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-02 10:24:19,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:24:19,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-02-02 10:24:19,397 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:24:19,397 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-02 10:24:19,397 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-02 10:24:19,397 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-02 10:24:19,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:24:19,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:24:19,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:24:19,398 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states.
[2018-02-02 10:24:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:24:19,559 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions.
[2018-02-02 10:24:19,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:24:19,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28
[2018-02-02 10:24:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:24:19,562 INFO L225 Difference]: With dead ends: 22
[2018-02-02 10:24:19,562 INFO L226 Difference]: Without dead ends: 0
[2018-02-02 10:24:19,562 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-02 10:24:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-02-02 10:24:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-02-02 10:24:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-02-02 10:24:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-02-02 10:24:19,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28
[2018-02-02 10:24:19,563 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:24:19,563 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-02-02 10:24:19,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:24:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-02-02 10:24:19,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-02-02 10:24:19,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:24:19 BoogieIcfgContainer
[2018-02-02 10:24:19,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 10:24:19,568 INFO L168 Benchmark]: Toolchain (without parser) took 2503.08 ms. Allocated memory was 405.3 MB in the beginning and 670.6 MB in the end (delta: 265.3 MB). Free memory was 362.0 MB in the beginning and 637.0 MB in the end (delta: -275.0 MB). There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:24:19,569 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:24:19,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.85 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
[2018-02-02 10:24:19,569 INFO L168 Benchmark]: Boogie Preprocessor took 25.02 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 10:24:19,570 INFO L168 Benchmark]: RCFGBuilder took 136.35 ms. Allocated memory is still 405.3 MB. Free memory was 347.4 MB in the beginning and 332.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB.
[2018-02-02 10:24:19,570 INFO L168 Benchmark]: TraceAbstraction took 2189.12 ms. Allocated memory was 405.3 MB in the beginning and 670.6 MB in the end (delta: 265.3 MB). Free memory was 332.9 MB in the beginning and 637.0 MB in the end (delta: -304.1 MB). There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:24:19,571 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.15 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 149.85 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 348.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 25.02 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 136.35 ms. Allocated memory is still 405.3 MB. Free memory was 347.4 MB in the beginning and 332.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 2189.12 ms. Allocated memory was 405.3 MB in the beginning and 670.6 MB in the end (delta: 265.3 MB). Free memory was 332.9 MB in the beginning and 637.0 MB in the end (delta: -304.1 MB). There was no memory consumed. 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.1s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 0.7s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s 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-02_10-24-19-586.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-02_10-24-19-586.csv
Received shutdown request...