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/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-ccafca9-m
[2018-02-04 03:28:46,360 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-04 03:28:46,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-04 03:28:46,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-04 03:28:46,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-04 03:28:46,374 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-04 03:28:46,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-04 03:28:46,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-04 03:28:46,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-04 03:28:46,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-04 03:28:46,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-04 03:28:46,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-04 03:28:46,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-04 03:28:46,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-04 03:28:46,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-04 03:28:46,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-04 03:28:46,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-04 03:28:46,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-04 03:28:46,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-04 03:28:46,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-04 03:28:46,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-04 03:28:46,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-04 03:28:46,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-04 03:28:46,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-04 03:28:46,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-04 03:28:46,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-04 03:28:46,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-04 03:28:46,394 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-04 03:28:46,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-04 03:28:46,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-04 03:28:46,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-04 03:28:46,395 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:28:46,404 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-04 03:28:46,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-04 03:28:46,405 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-04 03:28:46,405 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-04 03:28:46,405 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-04 03:28:46,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-04 03:28:46,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-04 03:28:46,407 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-04 03:28:46,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-04 03:28:46,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-04 03:28:46,407 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-04 03:28:46,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-04 03:28:46,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-04 03:28:46,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-04 03:28:46,407 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-04 03:28:46,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-04 03:28:46,442 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-04 03:28:46,444 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-04 03:28:46,445 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-04 03:28:46,445 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-04 03:28:46,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i
[2018-02-04 03:28:46,587 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-04 03:28:46,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-04 03:28:46,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-04 03:28:46,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-04 03:28:46,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-04 03:28:46,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d68d8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46, skipping insertion in model container
[2018-02-04 03:28:46,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,606 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 03:28:46,635 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-04 03:28:46,723 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 03:28:46,736 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-04 03:28:46,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46 WrapperNode
[2018-02-04 03:28:46,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-04 03:28:46,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-04 03:28:46,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-04 03:28:46,743 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-04 03:28:46,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (1/1) ...
[2018-02-04 03:28:46,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-04 03:28:46,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-04 03:28:46,772 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-04 03:28:46,772 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-04 03:28:46,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (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:28:46,811 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-04 03:28:46,812 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-04 03:28:46,812 INFO L136 BoogieDeclarations]: Found implementation of procedure exit
[2018-02-04 03:28:46,812 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-04 03:28:46,812 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-04 03:28:46,812 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-04 03:28:46,812 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-04 03:28:46,812 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure exit
[2018-02-04 03:28:46,813 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-04 03:28:46,814 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-04 03:28:46,814 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-04 03:28:46,965 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-04 03:28:46,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:46 BoogieIcfgContainer
[2018-02-04 03:28:46,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-04 03:28:46,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-04 03:28:46,967 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-04 03:28:46,970 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-04 03:28:46,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:28:46" (1/3) ...
[2018-02-04 03:28:46,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4605a841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:46, skipping insertion in model container
[2018-02-04 03:28:46,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:46" (2/3) ...
[2018-02-04 03:28:46,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4605a841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:46, skipping insertion in model container
[2018-02-04 03:28:46,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:46" (3/3) ...
[2018-02-04 03:28:46,972 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i
[2018-02-04 03:28:46,980 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-04 03:28:46,985 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations.
[2018-02-04 03:28:47,018 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-04 03:28:47,018 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-04 03:28:47,018 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-04 03:28:47,018 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-04 03:28:47,018 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-04 03:28:47,018 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-04 03:28:47,018 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-04 03:28:47,019 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-04 03:28:47,019 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-04 03:28:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states.
[2018-02-04 03:28:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-02-04 03:28:47,039 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,039 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,039 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash -119107064, now seen corresponding path program 1 times
[2018-02-04 03:28:47,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,129 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:28:47,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-04 03:28:47,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,133 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:28:47,133 INFO L182 omatonBuilderFactory]: Interpolants [41#true, 42#false]
[2018-02-04 03:28:47,133 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:28:47,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-02-04 03:28:47,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-02-04 03:28:47,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-02-04 03:28:47,144 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states.
[2018-02-04 03:28:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,157 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions.
[2018-02-04 03:28:47,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-02-04 03:28:47,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9
[2018-02-04 03:28:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,165 INFO L225 Difference]: With dead ends: 38
[2018-02-04 03:28:47,165 INFO L226 Difference]: Without dead ends: 31
[2018-02-04 03:28:47,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-02-04 03:28:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2018-02-04 03:28:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2018-02-04 03:28:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-04 03:28:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions.
[2018-02-04 03:28:47,261 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 9
[2018-02-04 03:28:47,261 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,261 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions.
[2018-02-04 03:28:47,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-02-04 03:28:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions.
[2018-02-04 03:28:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-02-04 03:28:47,262 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,262 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,262 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918584, now seen corresponding path program 1 times
[2018-02-04 03:28:47,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,294 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:28:47,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-04 03:28:47,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,294 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:28:47,294 INFO L182 omatonBuilderFactory]: Interpolants [112#true, 113#false, 114#(= |#valid| |old(#valid)|)]
[2018-02-04 03:28:47,294 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:28:47,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-04 03:28:47,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-04 03:28:47,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 03:28:47,296 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states.
[2018-02-04 03:28:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,336 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions.
[2018-02-04 03:28:47,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-04 03:28:47,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2018-02-04 03:28:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,337 INFO L225 Difference]: With dead ends: 46
[2018-02-04 03:28:47,338 INFO L226 Difference]: Without dead ends: 45
[2018-02-04 03:28:47,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:28:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2018-02-04 03:28:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40.
[2018-02-04 03:28:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2018-02-04 03:28:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions.
[2018-02-04 03:28:47,342 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 12
[2018-02-04 03:28:47,342 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,342 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions.
[2018-02-04 03:28:47,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-04 03:28:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions.
[2018-02-04 03:28:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-02-04 03:28:47,343 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,343 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,343 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918540, now seen corresponding path program 1 times
[2018-02-04 03:28:47,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,379 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:28:47,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-04 03:28:47,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,380 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:28:47,380 INFO L182 omatonBuilderFactory]: Interpolants [201#true, 202#false, 203#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))]
[2018-02-04 03:28:47,380 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:28:47,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-04 03:28:47,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-04 03:28:47,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-04 03:28:47,381 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states.
[2018-02-04 03:28:47,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,400 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions.
[2018-02-04 03:28:47,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-04 03:28:47,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2018-02-04 03:28:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,401 INFO L225 Difference]: With dead ends: 46
[2018-02-04 03:28:47,401 INFO L226 Difference]: Without dead ends: 44
[2018-02-04 03:28:47,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:28:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2018-02-04 03:28:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34.
[2018-02-04 03:28:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-02-04 03:28:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions.
[2018-02-04 03:28:47,403 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12
[2018-02-04 03:28:47,404 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,404 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions.
[2018-02-04 03:28:47,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-04 03:28:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions.
[2018-02-04 03:28:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-04 03:28:47,404 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,404 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,404 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605995, now seen corresponding path program 1 times
[2018-02-04 03:28:47,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,441 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:28:47,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-04 03:28:47,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,441 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:28:47,442 INFO L182 omatonBuilderFactory]: Interpolants [284#true, 285#false, 286#(= 1 (select |#valid| |main_#t~malloc1.base|)), 287#(= 1 (select |#valid| main_~t~0.base))]
[2018-02-04 03:28:47,442 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:28:47,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 03:28:47,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 03:28:47,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 03:28:47,443 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states.
[2018-02-04 03:28:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,514 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions.
[2018-02-04 03:28:47,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-04 03:28:47,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-02-04 03:28:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,515 INFO L225 Difference]: With dead ends: 34
[2018-02-04 03:28:47,515 INFO L226 Difference]: Without dead ends: 34
[2018-02-04 03:28:47,516 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-04 03:28:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2018-02-04 03:28:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32.
[2018-02-04 03:28:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-02-04 03:28:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions.
[2018-02-04 03:28:47,521 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 13
[2018-02-04 03:28:47,521 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,522 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions.
[2018-02-04 03:28:47,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 03:28:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions.
[2018-02-04 03:28:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-04 03:28:47,522 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,522 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,522 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605994, now seen corresponding path program 1 times
[2018-02-04 03:28:47,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-04 03:28:47,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,596 INFO L182 omatonBuilderFactory]: Interpolants [357#true, 358#false, 359#(and (= 0 |main_#t~malloc1.offset|) (= 8 (select |#length| |main_#t~malloc1.base|))), 360#(and (= (select |#length| main_~t~0.base) 8) (= main_~t~0.offset 0))]
[2018-02-04 03:28:47,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-04 03:28:47,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 03:28:47,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 03:28:47,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 03:28:47,597 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states.
[2018-02-04 03:28:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,627 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions.
[2018-02-04 03:28:47,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-04 03:28:47,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-02-04 03:28:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,628 INFO L225 Difference]: With dead ends: 32
[2018-02-04 03:28:47,628 INFO L226 Difference]: Without dead ends: 32
[2018-02-04 03:28:47,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-04 03:28:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2018-02-04 03:28:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30.
[2018-02-04 03:28:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-02-04 03:28:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions.
[2018-02-04 03:28:47,632 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 13
[2018-02-04 03:28:47,632 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,632 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions.
[2018-02-04 03:28:47,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 03:28:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2018-02-04 03:28:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-04 03:28:47,633 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,633 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,633 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash -252306105, now seen corresponding path program 1 times
[2018-02-04 03:28:47,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-04 03:28:47,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,681 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:28:47,681 INFO L182 omatonBuilderFactory]: Interpolants [426#true, 427#false, 428#(not (= 0 |main_#t~malloc1.base|)), 429#(not (= 0 main_~t~0.base)), 430#(not (= 0 main_~p~0.base))]
[2018-02-04 03:28:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 03:28:47,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 03:28:47,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 03:28:47,682 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states.
[2018-02-04 03:28:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,737 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions.
[2018-02-04 03:28:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 03:28:47,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2018-02-04 03:28:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,738 INFO L225 Difference]: With dead ends: 46
[2018-02-04 03:28:47,738 INFO L226 Difference]: Without dead ends: 46
[2018-02-04 03:28:47,738 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-04 03:28:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-02-04 03:28:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32.
[2018-02-04 03:28:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-02-04 03:28:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions.
[2018-02-04 03:28:47,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21
[2018-02-04 03:28:47,741 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,741 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions.
[2018-02-04 03:28:47,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 03:28:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions.
[2018-02-04 03:28:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-04 03:28:47,742 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,742 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,742 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -252306061, now seen corresponding path program 1 times
[2018-02-04 03:28:47,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-04 03:28:47,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,776 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:28:47,776 INFO L182 omatonBuilderFactory]: Interpolants [514#true, 515#false, 516#(= 1 (select |#valid| main_~t~0.base)), 517#(= 1 (select |#valid| main_~p~0.base))]
[2018-02-04 03:28:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-04 03:28:47,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-04 03:28:47,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-04 03:28:47,777 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states.
[2018-02-04 03:28:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,820 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions.
[2018-02-04 03:28:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 03:28:47,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2018-02-04 03:28:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,821 INFO L225 Difference]: With dead ends: 39
[2018-02-04 03:28:47,821 INFO L226 Difference]: Without dead ends: 39
[2018-02-04 03:28:47,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-04 03:28:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2018-02-04 03:28:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32.
[2018-02-04 03:28:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-02-04 03:28:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions.
[2018-02-04 03:28:47,824 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21
[2018-02-04 03:28:47,824 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,825 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions.
[2018-02-04 03:28:47,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-04 03:28:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions.
[2018-02-04 03:28:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-04 03:28:47,825 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,825 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,826 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -252306060, now seen corresponding path program 1 times
[2018-02-04 03:28:47,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-04 03:28:47,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-04 03:28:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-04 03:28:47,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-04 03:28:47,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-04 03:28:47,898 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:28:47,898 INFO L182 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(and (= 0 |main_#t~malloc1.offset|) (= 8 (select |#length| |main_#t~malloc1.base|))), 595#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 596#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))]
[2018-02-04 03:28:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-04 03:28:47,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-04 03:28:47,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-04 03:28:47,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-04 03:28:47,899 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states.
[2018-02-04 03:28:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-04 03:28:47,938 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions.
[2018-02-04 03:28:47,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-04 03:28:47,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2018-02-04 03:28:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-04 03:28:47,938 INFO L225 Difference]: With dead ends: 41
[2018-02-04 03:28:47,938 INFO L226 Difference]: Without dead ends: 41
[2018-02-04 03:28:47,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-04 03:28:47,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2018-02-04 03:28:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34.
[2018-02-04 03:28:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-02-04 03:28:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions.
[2018-02-04 03:28:47,941 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21
[2018-02-04 03:28:47,941 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-04 03:28:47,941 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions.
[2018-02-04 03:28:47,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-04 03:28:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions.
[2018-02-04 03:28:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-02-04 03:28:47,942 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-04 03:28:47,942 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-04 03:28:47,942 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-04 03:28:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash -633867851, now seen corresponding path program 1 times
[2018-02-04 03:28:47,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-04 03:28:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-02-04 03:28:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-02-04 03:28:47,982 INFO L410 BasicCegarLoop]: Counterexample might be feasible
[2018-02-04 03:28:47,993 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-02-04 03:28:48,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:28:48 BoogieIcfgContainer
[2018-02-04 03:28:48,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-04 03:28:48,006 INFO L168 Benchmark]: Toolchain (without parser) took 1419.01 ms. Allocated memory was 403.7 MB in the beginning and 621.8 MB in the end (delta: 218.1 MB). Free memory was 360.4 MB in the beginning and 489.1 MB in the end (delta: -128.7 MB). Peak memory consumption was 89.4 MB. Max. memory is 5.3 GB.
[2018-02-04 03:28:48,007 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-04 03:28:48,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.21 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
[2018-02-04 03:28:48,007 INFO L168 Benchmark]: Boogie Preprocessor took 28.57 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
[2018-02-04 03:28:48,007 INFO L168 Benchmark]: RCFGBuilder took 194.49 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 330.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB.
[2018-02-04 03:28:48,008 INFO L168 Benchmark]: TraceAbstraction took 1038.55 ms. Allocated memory was 403.7 MB in the beginning and 621.8 MB in the end (delta: 218.1 MB). Free memory was 330.0 MB in the beginning and 489.1 MB in the end (delta: -159.1 MB). Peak memory consumption was 59.0 MB. Max. memory is 5.3 GB.
[2018-02-04 03:28:48,008 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.13 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 154.21 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 28.57 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 194.49 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 330.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 1038.55 ms. Allocated memory was 403.7 MB in the beginning and 621.8 MB in the end (delta: 218.1 MB). Free memory was 330.0 MB in the beginning and 489.1 MB in the end (delta: -159.1 MB). Peak memory consumption was 59.0 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor:
- GenericResult: Unfinished Backtranslation
Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 626.
Possible FailurePath:
[L627] List t;
[L628] List p = 0;
VAL [p={0:0}]
[L629] COND TRUE __VERIFIER_nondet_int()
[L630] EXPR, FCALL malloc(sizeof(struct node))
VAL [malloc(sizeof(struct node))={13:0}, p={0:0}]
[L630] t = (List) malloc(sizeof(struct node))
VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}]
[L631] COND FALSE !(t == 0)
VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}]
[L632] FCALL t->h = 1
VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}]
[L633] FCALL t->n = p
VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}]
[L634] p = t
VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}]
[L629] COND FALSE !(__VERIFIER_nondet_int())
[L636] COND TRUE p!=0
VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}]
[L637] EXPR, FCALL p->h
VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=1, t={13:0}]
[L637] COND FALSE !(p->h != 1)
[L640] EXPR, FCALL p->n
VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}, t={13:0}]
[L640] p = p->n
[L636] COND FALSE !(p!=0)
VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 40 locations, 9 error locations. UNSAFE Result, 0.9s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 262 SDslu, 144 SDs, 0 SdLazy, 154 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 9/9 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, 8 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-28-48-013.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-28-48-013.csv
Received shutdown request...