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_Camel.epf -i ../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 09:35:47,441 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 09:35:47,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 09:35:47,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 09:35:47,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 09:35:47,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 09:35:47,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 09:35:47,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 09:35:47,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 09:35:47,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 09:35:47,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 09:35:47,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 09:35:47,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 09:35:47,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 09:35:47,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 09:35:47,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 09:35:47,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 09:35:47,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 09:35:47,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 09:35:47,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 09:35:47,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 09:35:47,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 09:35:47,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 09:35:47,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 09:35:47,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 09:35:47,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 09:35:47,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 09:35:47,473 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 09:35:47,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 09:35:47,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 09:35:47,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 09:35:47,474 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf
[2018-02-02 09:35:47,483 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 09:35:47,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 09:35:47,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 09:35:47,485 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 09:35:47,485 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 09:35:47,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 09:35:47,485 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 09:35:47,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 09:35:47,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 09:35:47,486 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 09:35:47,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 09:35:47,486 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 09:35:47,486 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 09:35:47,486 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 09:35:47,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 09:35:47,487 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 09:35:47,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 09:35:47,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 09:35:47,487 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 09:35:47,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 09:35:47,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:35:47,488 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 09:35:47,488 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-02 09:35:47,488 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 09:35:47,488 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-02 09:35:47,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 09:35:47,526 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 09:35:47,530 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 09:35:47,531 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 09:35:47,531 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 09:35:47,532 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-02 09:35:47,660 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 09:35:47,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 09:35:47,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 09:35:47,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 09:35:47,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 09:35:47,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc5225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47, skipping insertion in model container
[2018-02-02 09:35:47,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,688 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:35:47,715 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:35:47,804 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:35:47,816 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:35:47,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47 WrapperNode
[2018-02-02 09:35:47,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 09:35:47,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 09:35:47,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 09:35:47,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 09:35:47,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (1/1) ...
[2018-02-02 09:35:47,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 09:35:47,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 09:35:47,854 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 09:35:47,854 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 09:35:47,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (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 09:35:47,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 09:35:47,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 09:35:47,888 INFO L136 BoogieDeclarations]: Found implementation of procedure exit
[2018-02-02 09:35:47,888 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 09:35:47,888 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 09:35:47,888 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 09:35:47,889 INFO L128 BoogieDeclarations]: Found specification of procedure exit
[2018-02-02 09:35:47,890 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 09:35:47,890 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 09:35:47,890 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 09:35:48,017 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 09:35:48,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:35:48 BoogieIcfgContainer
[2018-02-02 09:35:48,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 09:35:48,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 09:35:48,018 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 09:35:48,021 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 09:35:48,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:35:47" (1/3) ...
[2018-02-02 09:35:48,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0e2c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:35:48, skipping insertion in model container
[2018-02-02 09:35:48,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:35:47" (2/3) ...
[2018-02-02 09:35:48,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0e2c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:35:48, skipping insertion in model container
[2018-02-02 09:35:48,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:35:48" (3/3) ...
[2018-02-02 09:35:48,024 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i
[2018-02-02 09:35:48,030 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 09:35:48,034 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations.
[2018-02-02 09:35:48,065 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 09:35:48,065 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 09:35:48,065 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 09:35:48,065 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 09:35:48,065 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 09:35:48,066 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 09:35:48,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 09:35:48,066 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 09:35:48,066 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 09:35:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states.
[2018-02-02 09:35:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-02-02 09:35:48,083 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,084 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:35:48,084 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,088 INFO L82 PathProgramCache]: Analyzing trace with hash -119107064, now seen corresponding path program 1 times
[2018-02-02 09:35:48,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:48,178 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 09:35:48,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:48,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 09:35:48,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-02-02 09:35:48,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-02-02 09:35:48,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-02-02 09:35:48,191 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states.
[2018-02-02 09:35:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:48,203 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions.
[2018-02-02 09:35:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-02-02 09:35:48,204 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9
[2018-02-02 09:35:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:48,210 INFO L225 Difference]: With dead ends: 38
[2018-02-02 09:35:48,210 INFO L226 Difference]: Without dead ends: 31
[2018-02-02 09:35:48,211 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-02 09:35:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2018-02-02 09:35:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2018-02-02 09:35:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2018-02-02 09:35:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions.
[2018-02-02 09:35:48,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 9
[2018-02-02 09:35:48,309 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:48,309 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions.
[2018-02-02 09:35:48,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-02-02 09:35:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions.
[2018-02-02 09:35:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-02-02 09:35:48,310 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,310 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:35:48,310 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918584, now seen corresponding path program 1 times
[2018-02-02 09:35:48,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:48,345 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 09:35:48,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:48,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 09:35:48,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:35:48,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:35:48,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:35:48,347 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states.
[2018-02-02 09:35:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:48,401 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions.
[2018-02-02 09:35:48,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 09:35:48,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2018-02-02 09:35:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:48,403 INFO L225 Difference]: With dead ends: 46
[2018-02-02 09:35:48,403 INFO L226 Difference]: Without dead ends: 45
[2018-02-02 09:35:48,404 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-02 09:35:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2018-02-02 09:35:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40.
[2018-02-02 09:35:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2018-02-02 09:35:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions.
[2018-02-02 09:35:48,409 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 12
[2018-02-02 09:35:48,409 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:48,409 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions.
[2018-02-02 09:35:48,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:35:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions.
[2018-02-02 09:35:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-02-02 09:35:48,410 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,410 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:35:48,410 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918540, now seen corresponding path program 1 times
[2018-02-02 09:35:48,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:48,451 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 09:35:48,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:48,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:35:48,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:35:48,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:35:48,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:35:48,452 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states.
[2018-02-02 09:35:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:48,471 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions.
[2018-02-02 09:35:48,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 09:35:48,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2018-02-02 09:35:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:48,473 INFO L225 Difference]: With dead ends: 46
[2018-02-02 09:35:48,473 INFO L226 Difference]: Without dead ends: 44
[2018-02-02 09:35:48,473 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-02 09:35:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2018-02-02 09:35:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34.
[2018-02-02 09:35:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-02-02 09:35:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions.
[2018-02-02 09:35:48,477 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12
[2018-02-02 09:35:48,477 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:48,477 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions.
[2018-02-02 09:35:48,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:35:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions.
[2018-02-02 09:35:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-02 09:35:48,478 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,478 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:35:48,478 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605995, now seen corresponding path program 1 times
[2018-02-02 09:35:48,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:48,516 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 09:35:48,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:48,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:35:48,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:35:48,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:35:48,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:35:48,517 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states.
[2018-02-02 09:35:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:48,587 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions.
[2018-02-02 09:35:48,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:35:48,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-02-02 09:35:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:48,588 INFO L225 Difference]: With dead ends: 34
[2018-02-02 09:35:48,588 INFO L226 Difference]: Without dead ends: 34
[2018-02-02 09:35:48,588 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-02 09:35:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2018-02-02 09:35:48,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32.
[2018-02-02 09:35:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-02-02 09:35:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions.
[2018-02-02 09:35:48,591 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 13
[2018-02-02 09:35:48,592 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:48,592 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions.
[2018-02-02 09:35:48,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:35:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions.
[2018-02-02 09:35:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-02 09:35:48,592 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:35:48,592 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605994, now seen corresponding path program 1 times
[2018-02-02 09:35:48,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:48,662 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 09:35:48,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:48,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:35:48,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:35:48,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:35:48,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:35:48,663 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states.
[2018-02-02 09:35:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:48,711 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions.
[2018-02-02 09:35:48,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:35:48,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-02-02 09:35:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:48,712 INFO L225 Difference]: With dead ends: 32
[2018-02-02 09:35:48,712 INFO L226 Difference]: Without dead ends: 32
[2018-02-02 09:35:48,712 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-02 09:35:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2018-02-02 09:35:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30.
[2018-02-02 09:35:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2018-02-02 09:35:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions.
[2018-02-02 09:35:48,715 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 13
[2018-02-02 09:35:48,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:48,715 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions.
[2018-02-02 09:35:48,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:35:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2018-02-02 09:35:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-02 09:35:48,716 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,716 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-02 09:35:48,716 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash -252306105, now seen corresponding path program 1 times
[2018-02-02 09:35:48,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:48,763 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-02 09:35:48,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:48,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:35:48,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:35:48,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:35:48,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:35:48,764 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states.
[2018-02-02 09:35:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:48,857 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions.
[2018-02-02 09:35:48,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:35:48,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2018-02-02 09:35:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:48,859 INFO L225 Difference]: With dead ends: 46
[2018-02-02 09:35:48,859 INFO L226 Difference]: Without dead ends: 46
[2018-02-02 09:35:48,859 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-02 09:35:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-02-02 09:35:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32.
[2018-02-02 09:35:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-02-02 09:35:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions.
[2018-02-02 09:35:48,862 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21
[2018-02-02 09:35:48,862 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:48,862 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions.
[2018-02-02 09:35:48,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:35:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions.
[2018-02-02 09:35:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-02 09:35:48,864 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,864 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-02 09:35:48,864 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash -252306061, now seen corresponding path program 1 times
[2018-02-02 09:35:48,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:48,900 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-02 09:35:48,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:48,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:35:48,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:35:48,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:35:48,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:35:48,901 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states.
[2018-02-02 09:35:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:48,943 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions.
[2018-02-02 09:35:48,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:35:48,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2018-02-02 09:35:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:48,944 INFO L225 Difference]: With dead ends: 39
[2018-02-02 09:35:48,944 INFO L226 Difference]: Without dead ends: 39
[2018-02-02 09:35:48,944 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-02 09:35:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2018-02-02 09:35:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32.
[2018-02-02 09:35:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-02-02 09:35:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions.
[2018-02-02 09:35:48,947 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21
[2018-02-02 09:35:48,947 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:48,947 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions.
[2018-02-02 09:35:48,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:35:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions.
[2018-02-02 09:35:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-02 09:35:48,948 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:48,948 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-02 09:35:48,948 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash -252306060, now seen corresponding path program 1 times
[2018-02-02 09:35:48,949 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:48,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:48,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:48,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:35:48,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:35:49,022 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-02 09:35:49,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:35:49,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:35:49,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:35:49,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:35:49,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:35:49,022 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states.
[2018-02-02 09:35:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:35:49,066 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions.
[2018-02-02 09:35:49,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:35:49,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2018-02-02 09:35:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:35:49,067 INFO L225 Difference]: With dead ends: 41
[2018-02-02 09:35:49,067 INFO L226 Difference]: Without dead ends: 41
[2018-02-02 09:35:49,067 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-02 09:35:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2018-02-02 09:35:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34.
[2018-02-02 09:35:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2018-02-02 09:35:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions.
[2018-02-02 09:35:49,069 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21
[2018-02-02 09:35:49,069 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:35:49,069 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions.
[2018-02-02 09:35:49,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:35:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions.
[2018-02-02 09:35:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-02-02 09:35:49,069 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:35:49,070 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-02 09:35:49,070 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]===
[2018-02-02 09:35:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash -633867851, now seen corresponding path program 1 times
[2018-02-02 09:35:49,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:35:49,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:35:49,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:49,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:35:49,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:35:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-02-02 09:35:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-02-02 09:35:49,107 INFO L410 BasicCegarLoop]: Counterexample might be feasible
[2018-02-02 09:35:49,119 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true)
[2018-02-02 09:35:49,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:35:49 BoogieIcfgContainer
[2018-02-02 09:35:49,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 09:35:49,130 INFO L168 Benchmark]: Toolchain (without parser) took 1469.18 ms. Allocated memory was 400.6 MB in the beginning and 613.9 MB in the end (delta: 213.4 MB). Free memory was 358.7 MB in the beginning and 483.3 MB in the end (delta: -124.5 MB). Peak memory consumption was 88.9 MB. Max. memory is 5.3 GB.
[2018-02-02 09:35:49,130 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 400.6 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:35:49,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.07 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 348.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB.
[2018-02-02 09:35:49,131 INFO L168 Benchmark]: Boogie Preprocessor took 31.11 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 345.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 09:35:49,131 INFO L168 Benchmark]: RCFGBuilder took 164.31 ms. Allocated memory is still 400.6 MB. Free memory was 345.4 MB in the beginning and 328.7 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB.
[2018-02-02 09:35:49,131 INFO L168 Benchmark]: TraceAbstraction took 1110.71 ms. Allocated memory was 400.6 MB in the beginning and 613.9 MB in the end (delta: 213.4 MB). Free memory was 328.7 MB in the beginning and 483.3 MB in the end (delta: -154.6 MB). Peak memory consumption was 58.8 MB. Max. memory is 5.3 GB.
[2018-02-02 09:35:49,133 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.16 ms. Allocated memory is still 400.6 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 160.07 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 348.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 31.11 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 345.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 164.31 ms. Allocated memory is still 400.6 MB. Free memory was 345.4 MB in the beginning and 328.7 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 1110.71 ms. Allocated memory was 400.6 MB in the beginning and 613.9 MB in the end (delta: 213.4 MB). Free memory was 328.7 MB in the beginning and 483.3 MB in the end (delta: -154.6 MB). Peak memory consumption was 58.8 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, 1.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.4s 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.2s 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, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-35-49-139.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-35-49-139.csv
Received shutdown request...