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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-1cceb4a
[2018-01-29 22:42:54,312 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-01-29 22:42:54,313 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-29 22:42:54,329 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-29 22:42:54,329 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-29 22:42:54,330 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-29 22:42:54,331 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-29 22:42:54,333 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-29 22:42:54,335 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-29 22:42:54,336 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-29 22:42:54,337 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-29 22:42:54,337 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-29 22:42:54,338 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-29 22:42:54,339 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-29 22:42:54,340 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-29 22:42:54,342 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-29 22:42:54,344 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-29 22:42:54,347 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-29 22:42:54,348 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-29 22:42:54,349 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-29 22:42:54,351 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-29 22:42:54,352 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-29 22:42:54,352 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-29 22:42:54,353 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-29 22:42:54,354 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-29 22:42:54,355 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-29 22:42:54,355 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-29 22:42:54,356 INFO  L177        SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-29 22:42:54,356 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-29 22:42:54,357 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-29 22:42:54,357 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-01-29 22:42:54,358 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-29 22:42:54,366 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-01-29 22:42:54,366 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-29 22:42:54,367 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-29 22:42:54,367 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-01-29 22:42:54,367 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-29 22:42:54,367 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-29 22:42:54,367 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-01-29 22:42:54,368 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-29 22:42:54,368 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-01-29 22:42:54,368 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-01-29 22:42:54,368 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-01-29 22:42:54,368 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-01-29 22:42:54,369 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-01-29 22:42:54,369 INFO  L133        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2018-01-29 22:42:54,369 INFO  L133        SettingsManager]:  * Bitprecise bitfields=true
[2018-01-29 22:42:54,369 INFO  L133        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2018-01-29 22:42:54,369 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-29 22:42:54,369 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-01-29 22:42:54,369 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-29 22:42:54,370 INFO  L133        SettingsManager]:  * Size of a code block=SingleStatement
[2018-01-29 22:42:54,370 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-01-29 22:42:54,370 INFO  L133        SettingsManager]:  * Add additional assume for each assert=false
[2018-01-29 22:42:54,370 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-01-29 22:42:54,370 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 22:42:54,371 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-29 22:42:54,371 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-01-29 22:42:54,371 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-01-29 22:42:54,371 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-29 22:42:54,371 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-01-29 22:42:54,371 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-29 22:42:54,371 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-29 22:42:54,372 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-29 22:42:54,372 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-29 22:42:54,372 INFO  L133        SettingsManager]:  * TransformationType=HEAP_SEPARATOR
[2018-01-29 22:42:54,404 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-29 22:42:54,415 INFO  L266   ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-29 22:42:54,418 INFO  L222   ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-29 22:42:54,419 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-01-29 22:42:54,420 INFO  L276        PluginConnector]: CDTParser initialized
[2018-01-29 22:42:54,421 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:42:54,573 INFO  L304   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-29 22:42:54,578 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-29 22:42:54,579 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-29 22:42:54,579 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-29 22:42:54,584 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-29 22:42:54,585 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,588 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bfa5b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54, skipping insertion in model container
[2018-01-29 22:42:54,588 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,600 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-29 22:42:54,638 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-29 22:42:54,765 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-29 22:42:54,783 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-29 22:42:54,791 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54 WrapperNode
[2018-01-29 22:42:54,791 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-29 22:42:54,792 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-29 22:42:54,792 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-29 22:42:54,793 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-01-29 22:42:54,811 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,811 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,820 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,820 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,824 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,827 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,828 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
[2018-01-29 22:42:54,831 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-29 22:42:54,831 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-29 22:42:54,831 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-01-29 22:42:54,832 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-01-29 22:42:54,833 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (1/1) ...
No working directory specified, using /storage/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-01-29 22:42:54,884 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-29 22:42:54,884 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-29 22:42:54,884 INFO  L136     BoogieDeclarations]: Found implementation of procedure cmemchr
[2018-01-29 22:42:54,884 INFO  L136     BoogieDeclarations]: Found implementation of procedure main
[2018-01-29 22:42:54,884 INFO  L128     BoogieDeclarations]: Found specification of procedure write~int
[2018-01-29 22:42:54,884 INFO  L128     BoogieDeclarations]: Found specification of procedure read~int
[2018-01-29 22:42:54,884 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-29 22:42:54,884 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-29 22:42:54,885 INFO  L128     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-29 22:42:54,885 INFO  L128     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-29 22:42:54,885 INFO  L128     BoogieDeclarations]: Found specification of procedure cmemchr
[2018-01-29 22:42:54,885 INFO  L128     BoogieDeclarations]: Found specification of procedure main
[2018-01-29 22:42:54,885 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-29 22:42:54,885 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-29 22:42:55,082 INFO  L257             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-29 22:42:55,083 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:42:55 BoogieIcfgContainer
[2018-01-29 22:42:55,083 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-29 22:42:55,084 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-29 22:42:55,084 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-01-29 22:42:55,087 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-01-29 22:42:55,087 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:42:54" (1/3) ...
[2018-01-29 22:42:55,088 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700d33ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:42:55, skipping insertion in model container
[2018-01-29 22:42:55,088 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:42:54" (2/3) ...
[2018-01-29 22:42:55,088 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700d33ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:42:55, skipping insertion in model container
[2018-01-29 22:42:55,088 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:42:55" (3/3) ...
[2018-01-29 22:42:55,090 INFO  L107   eAbstractionObserver]: Analyzing ICFG openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:42:55,097 INFO  L128   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-29 22:42:55,104 INFO  L140   ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations.
[2018-01-29 22:42:55,158 INFO  L322      AbstractCegarLoop]: Interprodecural is true
[2018-01-29 22:42:55,159 INFO  L323      AbstractCegarLoop]: Hoare is true
[2018-01-29 22:42:55,159 INFO  L324      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-29 22:42:55,159 INFO  L325      AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-29 22:42:55,159 INFO  L326      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-29 22:42:55,159 INFO  L327      AbstractCegarLoop]: Difference is false
[2018-01-29 22:42:55,159 INFO  L328      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-29 22:42:55,160 INFO  L333      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-29 22:42:55,161 INFO  L87    2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-29 22:42:55,181 INFO  L276                IsEmpty]: Start isEmpty. Operand 56 states.
[2018-01-29 22:42:55,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-01-29 22:42:55,189 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-29 22:42:55,190 INFO  L350         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:42:55,190 INFO  L371      AbstractCegarLoop]: === Iteration 1 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:42:55,196 INFO  L82        PathProgramCache]: Analyzing trace with hash -453553776, now seen corresponding path program 1 times
[2018-01-29 22:42:55,199 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:42:55,200 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:42:55,258 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:55,258 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:42:55,258 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:55,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:42:55,321 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:42:55,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:42:55,553 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:42:55,554 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-29 22:42:55,556 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 22:42:55,571 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 22:42:55,572 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:42:55,575 INFO  L87              Difference]: Start difference. First operand 56 states. Second operand 8 states.
[2018-01-29 22:42:55,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:42:55,880 INFO  L93              Difference]: Finished difference Result 71 states and 75 transitions.
[2018-01-29 22:42:55,880 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2018-01-29 22:42:55,881 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 29
[2018-01-29 22:42:55,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:42:55,893 INFO  L225             Difference]: With dead ends: 71
[2018-01-29 22:42:55,893 INFO  L226             Difference]: Without dead ends: 55
[2018-01-29 22:42:55,896 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2018-01-29 22:42:55,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2018-01-29 22:42:55,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52.
[2018-01-29 22:42:55,926 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-01-29 22:42:55,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions.
[2018-01-29 22:42:55,929 INFO  L78                 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 29
[2018-01-29 22:42:55,930 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:42:55,930 INFO  L432      AbstractCegarLoop]: Abstraction has 52 states and 56 transitions.
[2018-01-29 22:42:55,930 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 22:42:55,930 INFO  L276                IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions.
[2018-01-29 22:42:55,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-01-29 22:42:55,931 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-29 22:42:55,931 INFO  L350         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:42:55,931 INFO  L371      AbstractCegarLoop]: === Iteration 2 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:42:55,932 INFO  L82        PathProgramCache]: Analyzing trace with hash -453553775, now seen corresponding path program 1 times
[2018-01-29 22:42:55,932 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:42:55,932 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:42:55,933 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:55,933 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:42:55,933 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:55,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:42:55,960 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:42:56,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:42:56,155 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:42:56,155 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 22:42:56,158 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 22:42:56,158 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 22:42:56,159 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-01-29 22:42:56,159 INFO  L87              Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 9 states.
[2018-01-29 22:42:56,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:42:56,338 INFO  L93              Difference]: Finished difference Result 60 states and 65 transitions.
[2018-01-29 22:42:56,338 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2018-01-29 22:42:56,338 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 29
[2018-01-29 22:42:56,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:42:56,340 INFO  L225             Difference]: With dead ends: 60
[2018-01-29 22:42:56,340 INFO  L226             Difference]: Without dead ends: 59
[2018-01-29 22:42:56,341 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182
[2018-01-29 22:42:56,342 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-01-29 22:42:56,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56.
[2018-01-29 22:42:56,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-01-29 22:42:56,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions.
[2018-01-29 22:42:56,350 INFO  L78                 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 29
[2018-01-29 22:42:56,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:42:56,350 INFO  L432      AbstractCegarLoop]: Abstraction has 56 states and 60 transitions.
[2018-01-29 22:42:56,350 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 22:42:56,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions.
[2018-01-29 22:42:56,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-01-29 22:42:56,352 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-29 22:42:56,352 INFO  L350         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:42:56,352 INFO  L371      AbstractCegarLoop]: === Iteration 3 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:42:56,352 INFO  L82        PathProgramCache]: Analyzing trace with hash 234120788, now seen corresponding path program 1 times
[2018-01-29 22:42:56,352 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:42:56,353 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:42:56,354 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:56,354 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:42:56,354 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:56,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:42:56,375 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:42:56,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:42:56,449 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:42:56,449 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 22:42:56,449 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 22:42:56,450 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 22:42:56,450 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 22:42:56,450 INFO  L87              Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states.
[2018-01-29 22:42:56,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:42:56,543 INFO  L93              Difference]: Finished difference Result 56 states and 60 transitions.
[2018-01-29 22:42:56,543 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-01-29 22:42:56,544 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 32
[2018-01-29 22:42:56,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:42:56,545 INFO  L225             Difference]: With dead ends: 56
[2018-01-29 22:42:56,545 INFO  L226             Difference]: Without dead ends: 43
[2018-01-29 22:42:56,546 INFO  L553         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-01-29 22:42:56,546 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2018-01-29 22:42:56,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2018-01-29 22:42:56,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2018-01-29 22:42:56,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions.
[2018-01-29 22:42:56,553 INFO  L78                 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 32
[2018-01-29 22:42:56,554 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:42:56,554 INFO  L432      AbstractCegarLoop]: Abstraction has 43 states and 45 transitions.
[2018-01-29 22:42:56,554 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 22:42:56,554 INFO  L276                IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions.
[2018-01-29 22:42:56,555 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-01-29 22:42:56,555 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-29 22:42:56,556 INFO  L350         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:42:56,556 INFO  L371      AbstractCegarLoop]: === Iteration 4 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:42:56,556 INFO  L82        PathProgramCache]: Analyzing trace with hash -1405293010, now seen corresponding path program 1 times
[2018-01-29 22:42:56,556 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:42:56,556 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:42:56,557 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:56,558 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:42:56,558 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:56,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:42:56,582 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:42:56,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:42:56,915 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:42:56,915 INFO  L209   onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:42:56,922 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:42:56,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:42:56,970 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:42:57,027 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 22:42:57,030 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-01-29 22:42:57,040 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-01-29 22:42:57,040 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 22:42:57,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:42:57,375 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:42:57,400 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26
[2018-01-29 22:42:57,401 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-01-29 22:42:57,401 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-01-29 22:42:57,401 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702
[2018-01-29 22:42:57,401 INFO  L87              Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 27 states.
[2018-01-29 22:42:58,108 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:42:58,108 INFO  L93              Difference]: Finished difference Result 57 states and 59 transitions.
[2018-01-29 22:42:58,109 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2018-01-29 22:42:58,109 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states. Word has length 40
[2018-01-29 22:42:58,109 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:42:58,110 INFO  L225             Difference]: With dead ends: 57
[2018-01-29 22:42:58,110 INFO  L226             Difference]: Without dead ends: 56
[2018-01-29 22:42:58,111 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640
[2018-01-29 22:42:58,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2018-01-29 22:42:58,116 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54.
[2018-01-29 22:42:58,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-01-29 22:42:58,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions.
[2018-01-29 22:42:58,118 INFO  L78                 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 40
[2018-01-29 22:42:58,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:42:58,118 INFO  L432      AbstractCegarLoop]: Abstraction has 54 states and 56 transitions.
[2018-01-29 22:42:58,119 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-01-29 22:42:58,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions.
[2018-01-29 22:42:58,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-29 22:42:58,120 INFO  L342         BasicCegarLoop]: Found error trace
[2018-01-29 22:42:58,120 INFO  L350         BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:42:58,121 INFO  L371      AbstractCegarLoop]: === Iteration 5 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-29 22:42:58,121 INFO  L82        PathProgramCache]: Analyzing trace with hash 277888369, now seen corresponding path program 2 times
[2018-01-29 22:42:58,121 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:42:58,121 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:42:58,122 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:58,122 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:42:58,122 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:42:58,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:42:58,147 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:42:58,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:42:58,497 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:42:58,497 INFO  L209   onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:42:58,509 INFO  L101   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 22:42:58,527 INFO  L201   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:42:58,533 INFO  L214   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:42:58,536 INFO  L239   tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 22:42:58,539 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:42:58,542 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 22:42:58,543 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-01-29 22:42:58,547 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-01-29 22:42:58,547 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 22:42:58,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:42:58,884 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:42:58,884 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26
[2018-01-29 22:42:58,884 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-01-29 22:42:58,885 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-01-29 22:42:58,885 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702
[2018-01-29 22:42:58,885 INFO  L87              Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 27 states.
[2018-01-29 22:43:00,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:00,003 INFO  L93              Difference]: Finished difference Result 67 states and 70 transitions.
[2018-01-29 22:43:00,003 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2018-01-29 22:43:00,004 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states. Word has length 51
[2018-01-29 22:43:00,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:00,004 INFO  L225             Difference]: With dead ends: 67
[2018-01-29 22:43:00,004 INFO  L226             Difference]: Without dead ends: 0
[2018-01-29 22:43:00,005 INFO  L553         BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=314, Invalid=2338, Unknown=0, NotChecked=0, Total=2652
[2018-01-29 22:43:00,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-01-29 22:43:00,006 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-01-29 22:43:00,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-01-29 22:43:00,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-01-29 22:43:00,006 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51
[2018-01-29 22:43:00,007 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:00,007 INFO  L432      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-01-29 22:43:00,007 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-01-29 22:43:00,007 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-01-29 22:43:00,007 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-01-29 22:43:00,012 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-01-29 22:43:00,259 WARN  L146               SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 84 DAG size of output 56
[2018-01-29 22:43:00,271 INFO  L399   ceAbstractionStarter]: For program point  L546''''''(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,271 INFO  L399   ceAbstractionStarter]: For program point  L540(lines 540 551)  no Hoare annotation was computed.
[2018-01-29 22:43:00,271 INFO  L399   ceAbstractionStarter]: For program point  cmemchrEXIT(lines 540 551)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L546(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L545(lines 545 548)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L544(line 544)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  cmemchrFINAL(lines 540 551)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L543(lines 543 549)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L546'''''(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L548(line 548)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L547(line 547)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L402   ceAbstractionStarter]: At program point  cmemchrENTRY(lines 540 551)  the Hoare annotation is:  true
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L546'(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  L548'(line 548)  no Hoare annotation was computed.
[2018-01-29 22:43:00,272 INFO  L399   ceAbstractionStarter]: For program point  cmemchrErr1RequiresViolation(lines 1 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L546''''(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L395   ceAbstractionStarter]: At program point  L545'''(lines 545 548)  the Hoare annotation is:  (let ((.cse8 (select |#length| cmemchr_~s.base))) (let ((.cse3 (select |#length| cmemchr_~p~3.base)) (.cse0 (= 1 (select |#valid| cmemchr_~p~3.base))) (.cse1 (= 0 cmemchr_~s.offset)) (.cse4 (= .cse8 |cmemchr_#in~n|)) (.cse5 (= 1 (select |#valid| cmemchr_~s.base))) (.cse7 (select |#length| |cmemchr_#in~s.base|))) (or (let ((.cse2 (+ cmemchr_~p~3.offset cmemchr_~n))) (and (<= 2 cmemchr_~p~3.offset) .cse0 .cse1 (<= .cse2 .cse3) (<= .cse3 .cse2) .cse4 .cse5 (<= 1 cmemchr_~n))) (let ((.cse6 (+ cmemchr_~n 1))) (and (<= .cse6 .cse3) (= cmemchr_~p~3.offset 1) .cse0 .cse1 (not (= (mod (+ .cse3 4294967295) 4294967296) 0)) .cse4 .cse5 (<= 1 .cse3) (<= .cse3 .cse6))) (< |cmemchr_#in~n| .cse7) (and (= cmemchr_~n .cse3) .cse0 .cse1 (= cmemchr_~n .cse8) .cse4 .cse5 (= cmemchr_~p~3.offset 0)) (not (= 0 |cmemchr_#in~s.offset|)) (< .cse7 |cmemchr_#in~n|) (not (= (select |#valid| |cmemchr_#in~s.base|) 1)) (< .cse7 1))))
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L540'(lines 540 551)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L546'''''''(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  cmemchrErr0RequiresViolation(lines 1 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L546''(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L543'(lines 543 549)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L545'(lines 545 548)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L546'''(line 546)  no Hoare annotation was computed.
[2018-01-29 22:43:00,273 INFO  L399   ceAbstractionStarter]: For program point  L548''(line 548)  no Hoare annotation was computed.
[2018-01-29 22:43:00,274 INFO  L399   ceAbstractionStarter]: For program point  L1(lines 1 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,274 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.initEXIT(lines 1 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,274 INFO  L395   ceAbstractionStarter]: At program point  ULTIMATE.initENTRY(lines 1 565)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-29 22:43:00,274 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.initFINAL(lines 1 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,274 INFO  L402   ceAbstractionStarter]: At program point  ULTIMATE.startENTRY(lines 1 565)  the Hoare annotation is:  true
[2018-01-29 22:43:00,274 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(lines 1 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,274 INFO  L402   ceAbstractionStarter]: At program point  L1(lines 1 565)  the Hoare annotation is:  true
[2018-01-29 22:43:00,274 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(lines 1 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,274 INFO  L399   ceAbstractionStarter]: For program point  L560(line 560)  no Hoare annotation was computed.
[2018-01-29 22:43:00,275 INFO  L399   ceAbstractionStarter]: For program point  L564(line 564)  no Hoare annotation was computed.
[2018-01-29 22:43:00,275 INFO  L395   ceAbstractionStarter]: At program point  L563(line 563)  the Hoare annotation is:  (and (= main_~n~5 (select |#length| main_~nondetArea~5.base)) (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~5) (= main_~n~5 (select |#length| |main_#t~malloc6.base|)) (= 0 main_~nondetArea~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= 1 (select |#valid| main_~nondetArea~5.base)) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|))
[2018-01-29 22:43:00,275 INFO  L399   ceAbstractionStarter]: For program point  L562(line 562)  no Hoare annotation was computed.
[2018-01-29 22:43:00,275 INFO  L399   ceAbstractionStarter]: For program point  L563'(line 563)  no Hoare annotation was computed.
[2018-01-29 22:43:00,275 INFO  L399   ceAbstractionStarter]: For program point  L553'(line 553)  no Hoare annotation was computed.
[2018-01-29 22:43:00,275 INFO  L399   ceAbstractionStarter]: For program point  L554'(line 554)  no Hoare annotation was computed.
[2018-01-29 22:43:00,275 INFO  L399   ceAbstractionStarter]: For program point  L554''(line 554)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  L555''(line 555)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  L556''(lines 556 558)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  mainErr0EnsuresViolation(lines 552 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  L553(line 553)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  L562'(line 562)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  L557(line 557)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  mainFINAL(lines 552 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,276 INFO  L399   ceAbstractionStarter]: For program point  L556(lines 556 558)  no Hoare annotation was computed.
[2018-01-29 22:43:00,277 INFO  L399   ceAbstractionStarter]: For program point  L555(line 555)  no Hoare annotation was computed.
[2018-01-29 22:43:00,277 INFO  L399   ceAbstractionStarter]: For program point  L554(line 554)  no Hoare annotation was computed.
[2018-01-29 22:43:00,277 INFO  L399   ceAbstractionStarter]: For program point  mainEXIT(lines 552 565)  no Hoare annotation was computed.
[2018-01-29 22:43:00,277 INFO  L395   ceAbstractionStarter]: At program point  mainENTRY(lines 552 565)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-29 22:43:00,277 INFO  L399   ceAbstractionStarter]: For program point  L562''(line 562)  no Hoare annotation was computed.
[2018-01-29 22:43:00,277 INFO  L399   ceAbstractionStarter]: For program point  L555'(line 555)  no Hoare annotation was computed.
[2018-01-29 22:43:00,277 INFO  L399   ceAbstractionStarter]: For program point  L559'(lines 559 561)  no Hoare annotation was computed.
[2018-01-29 22:43:00,286 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,287 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,287 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,288 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,288 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,288 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,288 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,289 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,289 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,289 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,289 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,289 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,289 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,290 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,295 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,296 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,296 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,296 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,296 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,297 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,297 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,297 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,297 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,298 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,298 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,298 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,298 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,299 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,302 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:43:00 BoogieIcfgContainer
[2018-01-29 22:43:00,302 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-29 22:43:00,303 INFO  L168              Benchmark]: Toolchain (without parser) took 5729.33 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 263.1 MB in the beginning and 502.8 MB in the end (delta: -239.7 MB). Peak memory consumption was 188.8 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:00,304 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-29 22:43:00,304 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 212.88 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:00,305 INFO  L168              Benchmark]: Boogie Preprocessor took 38.72 ms. Allocated memory is still 303.0 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:00,305 INFO  L168              Benchmark]: RCFGBuilder took 252.08 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 233.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:00,305 INFO  L168              Benchmark]: TraceAbstraction took 5217.85 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 233.4 MB in the beginning and 502.8 MB in the end (delta: -269.4 MB). Peak memory consumption was 159.1 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:00,307 INFO  L344   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
 * CACSL2BoogieTranslator took 212.88 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB.
 * Boogie Preprocessor took 38.72 ms. Allocated memory is still 303.0 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
 * RCFGBuilder took 252.08 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 233.4 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB.
 * TraceAbstraction took 5217.85 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 233.4 MB in the beginning and 502.8 MB in the end (delta: -269.4 MB). Peak memory consumption was 159.1 MB. Max. memory is 5.3 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 552]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - AllSpecificationsHoldResult: All specifications hold
    3 specifications checked. All of them hold
  - InvariantResult [Line: 545]: Loop Invariant
[2018-01-29 22:43:00,313 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,313 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,314 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,314 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,314 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,314 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,314 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,315 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,315 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,315 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,315 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,315 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,316 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,316 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,320 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,320 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,320 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,321 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,321 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,321 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,321 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,322 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,322 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,322 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,322 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,322 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,323 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:00,323 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
    Derived loop invariant: (((((((((((((2 <= p && 1 == \valid[p]) && 0 == s) && p + n <= unknown-#length-unknown[p]) && unknown-#length-unknown[p] <= p + n) && unknown-#length-unknown[s] == \old(n)) && 1 == \valid[s]) && 1 <= n) || ((((((((n + 1 <= unknown-#length-unknown[p] && p == 1) && 1 == \valid[p]) && 0 == s) && !((unknown-#length-unknown[p] + 4294967295) % 4294967296 == 0)) && unknown-#length-unknown[s] == \old(n)) && 1 == \valid[s]) && 1 <= unknown-#length-unknown[p]) && unknown-#length-unknown[p] <= n + 1)) || \old(n) < unknown-#length-unknown[s]) || ((((((n == unknown-#length-unknown[p] && 1 == \valid[p]) && 0 == s) && n == unknown-#length-unknown[s]) && unknown-#length-unknown[s] == \old(n)) && 1 == \valid[s]) && p == 0)) || !(0 == s)) || unknown-#length-unknown[s] < \old(n)) || !(\valid[s] == 1)) || unknown-#length-unknown[s] < 1
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 56 locations, 3 error locations. SAFE Result, 5.1s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 215 SDtfs, 467 SDslu, 1556 SDs, 0 SdLazy, 835 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, 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, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 196 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 265 ConstructedInterpolants, 5 QuantifiedInterpolants, 93763 SizeOfPredicates, 34 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 0/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-43-00-327.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-43-00-327.csv
Received shutdown request...