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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i


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


This is Ultimate 0.1.23-6b94a2f
[2018-01-24 12:56:45,594 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-01-24 12:56:45,596 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-24 12:56:45,611 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-24 12:56:45,611 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-24 12:56:45,612 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-24 12:56:45,613 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-24 12:56:45,615 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-24 12:56:45,617 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-24 12:56:45,617 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-24 12:56:45,618 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-24 12:56:45,619 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-24 12:56:45,619 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-24 12:56:45,621 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-24 12:56:45,621 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-24 12:56:45,624 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-24 12:56:45,626 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-24 12:56:45,628 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-24 12:56:45,629 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-24 12:56:45,631 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-24 12:56:45,633 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-24 12:56:45,633 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-24 12:56:45,633 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-24 12:56:45,634 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-24 12:56:45,635 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-24 12:56:45,637 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-24 12:56:45,637 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-24 12:56:45,638 INFO  L177        SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-24 12:56:45,638 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-24 12:56:45,638 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-24 12:56:45,639 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-01-24 12:56:45,639 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf
[2018-01-24 12:56:45,648 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-01-24 12:56:45,648 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-24 12:56:45,649 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-24 12:56:45,649 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-01-24 12:56:45,649 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-24 12:56:45,649 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-24 12:56:45,649 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-01-24 12:56:45,650 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-24 12:56:45,650 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-01-24 12:56:45,650 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-01-24 12:56:45,650 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-01-24 12:56:45,650 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-01-24 12:56:45,650 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-01-24 12:56:45,651 INFO  L133        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2018-01-24 12:56:45,651 INFO  L133        SettingsManager]:  * Bitprecise bitfields=true
[2018-01-24 12:56:45,651 INFO  L133        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2018-01-24 12:56:45,651 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-24 12:56:45,651 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-01-24 12:56:45,651 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-24 12:56:45,651 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-01-24 12:56:45,652 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-01-24 12:56:45,652 INFO  L133        SettingsManager]:  * Add additional assume for each assert=false
[2018-01-24 12:56:45,652 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-01-24 12:56:45,652 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-24 12:56:45,652 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-24 12:56:45,653 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-01-24 12:56:45,653 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-01-24 12:56:45,653 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-24 12:56:45,653 INFO  L133        SettingsManager]:  * Trace refinement strategy=RUBBER_TAIPAN
[2018-01-24 12:56:45,653 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-24 12:56:45,653 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-24 12:56:45,653 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-24 12:56:45,654 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-24 12:56:45,654 INFO  L133        SettingsManager]:  * TransformationType=HEAP_SEPARATOR
[2018-01-24 12:56:45,687 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-24 12:56:45,697 INFO  L266   ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-24 12:56:45,700 INFO  L222   ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-24 12:56:45,701 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-01-24 12:56:45,701 INFO  L276        PluginConnector]: CDTParser initialized
[2018-01-24 12:56:45,702 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i
[2018-01-24 12:56:45,898 INFO  L304   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-24 12:56:45,902 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-24 12:56:45,902 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-24 12:56:45,903 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-24 12:56:45,908 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-24 12:56:45,909 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:45" (1/1) ...
[2018-01-24 12:56:45,912 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d63a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:45, skipping insertion in model container
[2018-01-24 12:56:45,912 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:45" (1/1) ...
[2018-01-24 12:56:45,926 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-24 12:56:45,964 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-24 12:56:46,080 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-24 12:56:46,098 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-24 12:56:46,105 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46 WrapperNode
[2018-01-24 12:56:46,105 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-24 12:56:46,106 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-24 12:56:46,106 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-24 12:56:46,107 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-01-24 12:56:46,123 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (1/1) ...
[2018-01-24 12:56:46,124 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (1/1) ...
[2018-01-24 12:56:46,132 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (1/1) ...
[2018-01-24 12:56:46,133 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (1/1) ...
[2018-01-24 12:56:46,136 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (1/1) ...
[2018-01-24 12:56:46,140 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (1/1) ...
[2018-01-24 12:56:46,141 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (1/1) ...
[2018-01-24 12:56:46,143 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-24 12:56:46,143 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-24 12:56:46,143 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-01-24 12:56:46,144 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-01-24 12:56:46,145 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (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-24 12:56:46,192 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-24 12:56:46,192 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-24 12:56:46,192 INFO  L136     BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes
[2018-01-24 12:56:46,192 INFO  L136     BoogieDeclarations]: Found implementation of procedure main
[2018-01-24 12:56:46,192 INFO  L128     BoogieDeclarations]: Found specification of procedure write~int
[2018-01-24 12:56:46,192 INFO  L128     BoogieDeclarations]: Found specification of procedure read~int
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure sumOfThirdBytes
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure main
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-24 12:56:46,193 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-24 12:56:46,365 INFO  L257             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-24 12:56:46,365 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:46 BoogieIcfgContainer
[2018-01-24 12:56:46,365 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-24 12:56:46,366 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-24 12:56:46,366 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-01-24 12:56:46,368 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-01-24 12:56:46,368 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:56:45" (1/3) ...
[2018-01-24 12:56:46,369 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a89aace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:46, skipping insertion in model container
[2018-01-24 12:56:46,369 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:46" (2/3) ...
[2018-01-24 12:56:46,369 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a89aace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:46, skipping insertion in model container
[2018-01-24 12:56:46,369 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:46" (3/3) ...
[2018-01-24 12:56:46,371 INFO  L105   eAbstractionObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i
[2018-01-24 12:56:46,378 INFO  L130   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-24 12:56:46,384 INFO  L142   ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations.
[2018-01-24 12:56:46,425 INFO  L322      AbstractCegarLoop]: Interprodecural is true
[2018-01-24 12:56:46,425 INFO  L323      AbstractCegarLoop]: Hoare is true
[2018-01-24 12:56:46,425 INFO  L324      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-24 12:56:46,426 INFO  L325      AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-24 12:56:46,426 INFO  L326      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-24 12:56:46,426 INFO  L327      AbstractCegarLoop]: Difference is false
[2018-01-24 12:56:46,426 INFO  L328      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-24 12:56:46,426 INFO  L333      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-24 12:56:46,427 INFO  L87    2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-24 12:56:46,448 INFO  L276                IsEmpty]: Start isEmpty. Operand 38 states.
[2018-01-24 12:56:46,455 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-01-24 12:56:46,455 INFO  L314         BasicCegarLoop]: Found error trace
[2018-01-24 12:56:46,456 INFO  L322         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 12:56:46,456 INFO  L371      AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-24 12:56:46,460 INFO  L82        PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times
[2018-01-24 12:56:46,463 INFO  L67    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-01-24 12:56:46,510 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:46,510 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:46,511 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:46,511 INFO  L280   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 12:56:46,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:46,570 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-24 12:56:46,756 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-24 12:56:46,758 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 12:56:46,758 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-24 12:56:46,759 INFO  L252   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 12:56:46,762 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-24 12:56:46,776 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-24 12:56:46,777 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-24 12:56:46,779 INFO  L87              Difference]: Start difference. First operand 38 states. Second operand 7 states.
[2018-01-24 12:56:47,064 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 12:56:47,065 INFO  L93              Difference]: Finished difference Result 67 states and 79 transitions.
[2018-01-24 12:56:47,066 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-01-24 12:56:47,067 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2018-01-24 12:56:47,068 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 12:56:47,079 INFO  L225             Difference]: With dead ends: 67
[2018-01-24 12:56:47,079 INFO  L226             Difference]: Without dead ends: 37
[2018-01-24 12:56:47,083 INFO  L525         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2018-01-24 12:56:47,098 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2018-01-24 12:56:47,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32.
[2018-01-24 12:56:47,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2018-01-24 12:56:47,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions.
[2018-01-24 12:56:47,118 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15
[2018-01-24 12:56:47,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-24 12:56:47,118 INFO  L432      AbstractCegarLoop]: Abstraction has 32 states and 34 transitions.
[2018-01-24 12:56:47,118 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-24 12:56:47,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions.
[2018-01-24 12:56:47,119 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-01-24 12:56:47,119 INFO  L314         BasicCegarLoop]: Found error trace
[2018-01-24 12:56:47,119 INFO  L322         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 12:56:47,120 INFO  L371      AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-24 12:56:47,120 INFO  L82        PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times
[2018-01-24 12:56:47,120 INFO  L67    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-01-24 12:56:47,121 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:47,121 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:47,121 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:47,121 INFO  L280   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 12:56:47,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:47,146 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-24 12:56:47,289 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-24 12:56:47,290 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 12:56:47,290 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-24 12:56:47,290 INFO  L252   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 12:56:47,292 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-24 12:56:47,292 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-24 12:56:47,293 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-24 12:56:47,293 INFO  L87              Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states.
[2018-01-24 12:56:47,535 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 12:56:47,535 INFO  L93              Difference]: Finished difference Result 53 states and 58 transitions.
[2018-01-24 12:56:47,536 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-01-24 12:56:47,536 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2018-01-24 12:56:47,536 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 12:56:47,537 INFO  L225             Difference]: With dead ends: 53
[2018-01-24 12:56:47,537 INFO  L226             Difference]: Without dead ends: 50
[2018-01-24 12:56:47,538 INFO  L525         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2018-01-24 12:56:47,538 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-01-24 12:56:47,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41.
[2018-01-24 12:56:47,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2018-01-24 12:56:47,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions.
[2018-01-24 12:56:47,548 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15
[2018-01-24 12:56:47,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-24 12:56:47,548 INFO  L432      AbstractCegarLoop]: Abstraction has 41 states and 45 transitions.
[2018-01-24 12:56:47,549 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-24 12:56:47,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions.
[2018-01-24 12:56:47,549 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-24 12:56:47,550 INFO  L314         BasicCegarLoop]: Found error trace
[2018-01-24 12:56:47,550 INFO  L322         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 12:56:47,550 INFO  L371      AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-24 12:56:47,550 INFO  L82        PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times
[2018-01-24 12:56:47,550 INFO  L67    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-01-24 12:56:47,551 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:47,552 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:47,552 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:47,552 INFO  L280   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 12:56:47,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:47,566 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-24 12:56:47,656 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-24 12:56:47,656 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 12:56:47,656 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-24 12:56:47,656 INFO  L252   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 12:56:47,657 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-24 12:56:47,657 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-24 12:56:47,657 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-24 12:56:47,657 INFO  L87              Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states.
[2018-01-24 12:56:47,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 12:56:47,688 INFO  L93              Difference]: Finished difference Result 50 states and 53 transitions.
[2018-01-24 12:56:47,688 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-01-24 12:56:47,689 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-01-24 12:56:47,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 12:56:47,690 INFO  L225             Difference]: With dead ends: 50
[2018-01-24 12:56:47,690 INFO  L226             Difference]: Without dead ends: 42
[2018-01-24 12:56:47,690 INFO  L525         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-24 12:56:47,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2018-01-24 12:56:47,697 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41.
[2018-01-24 12:56:47,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2018-01-24 12:56:47,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions.
[2018-01-24 12:56:47,698 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20
[2018-01-24 12:56:47,699 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-24 12:56:47,699 INFO  L432      AbstractCegarLoop]: Abstraction has 41 states and 44 transitions.
[2018-01-24 12:56:47,699 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-24 12:56:47,699 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions.
[2018-01-24 12:56:47,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-01-24 12:56:47,700 INFO  L314         BasicCegarLoop]: Found error trace
[2018-01-24 12:56:47,700 INFO  L322         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 12:56:47,700 INFO  L371      AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-24 12:56:47,700 INFO  L82        PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times
[2018-01-24 12:56:47,701 INFO  L67    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-01-24 12:56:47,702 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:47,702 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:47,702 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:47,702 INFO  L280   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 12:56:47,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:47,717 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-24 12:56:47,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 12:56:47,841 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-24 12:56:47,841 INFO  L187   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
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-24 12:56:47,846 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:47,847 INFO  L280   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-01-24 12:56:47,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:47,869 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-01-24 12:56:47,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 12:56:47,925 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-01-24 12:56:47,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 12:56:47,995 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences.
[2018-01-24 12:56:47,996 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 15
[2018-01-24 12:56:47,996 INFO  L252   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 12:56:47,996 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-24 12:56:47,996 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-24 12:56:47,996 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2018-01-24 12:56:47,996 INFO  L87              Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states.
[2018-01-24 12:56:48,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 12:56:48,040 INFO  L93              Difference]: Finished difference Result 86 states and 91 transitions.
[2018-01-24 12:56:48,041 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-01-24 12:56:48,041 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2018-01-24 12:56:48,041 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 12:56:48,043 INFO  L225             Difference]: With dead ends: 86
[2018-01-24 12:56:48,043 INFO  L226             Difference]: Without dead ends: 65
[2018-01-24 12:56:48,043 INFO  L525         BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272
[2018-01-24 12:56:48,044 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2018-01-24 12:56:48,052 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60.
[2018-01-24 12:56:48,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-01-24 12:56:48,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions.
[2018-01-24 12:56:48,054 INFO  L78                 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21
[2018-01-24 12:56:48,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-24 12:56:48,054 INFO  L432      AbstractCegarLoop]: Abstraction has 60 states and 64 transitions.
[2018-01-24 12:56:48,054 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-24 12:56:48,055 INFO  L276                IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions.
[2018-01-24 12:56:48,055 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-01-24 12:56:48,056 INFO  L314         BasicCegarLoop]: Found error trace
[2018-01-24 12:56:48,056 INFO  L322         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-24 12:56:48,056 INFO  L371      AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-24 12:56:48,056 INFO  L82        PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times
[2018-01-24 12:56:48,056 INFO  L67    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-01-24 12:56:48,057 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:48,057 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:48,058 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:48,058 INFO  L280   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 12:56:48,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:48,072 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-24 12:56:48,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 12:56:48,239 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-24 12:56:48,239 INFO  L187   anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
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-24 12:56:48,252 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:48,252 INFO  L280   anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-01-24 12:56:48,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:48,274 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-01-24 12:56:48,301 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 8 treesize of output 7
[2018-01-24 12:56:48,302 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-01-24 12:56:48,307 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-01-24 12:56:48,307 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11
[2018-01-24 12:56:48,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 12:56:48,640 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-01-24 12:56:48,913 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-24 12:56:48,934 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-24 12:56:48,934 INFO  L187   anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000
[2018-01-24 12:56:48,939 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:48,939 INFO  L280   anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2018-01-24 12:56:48,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:48,965 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-01-24 12:56:48,969 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 8 treesize of output 7
[2018-01-24 12:56:48,969 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-01-24 12:56:48,979 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-01-24 12:56:48,979 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11
[2018-01-24 12:56:49,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-24 12:56:49,012 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-01-24 12:56:49,070 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-24 12:56:49,072 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences.
[2018-01-24 12:56:49,072 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 19
[2018-01-24 12:56:49,072 INFO  L247   anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2018-01-24 12:56:49,073 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-24 12:56:49,073 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-24 12:56:49,073 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=316, Unknown=1, NotChecked=0, Total=380
[2018-01-24 12:56:49,074 INFO  L87              Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 14 states.
[2018-01-24 12:56:49,391 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 12:56:49,392 INFO  L93              Difference]: Finished difference Result 66 states and 71 transitions.
[2018-01-24 12:56:49,392 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2018-01-24 12:56:49,392 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 21
[2018-01-24 12:56:49,392 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 12:56:49,393 INFO  L225             Difference]: With dead ends: 66
[2018-01-24 12:56:49,393 INFO  L226             Difference]: Without dead ends: 63
[2018-01-24 12:56:49,394 INFO  L525         BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=474, Unknown=1, NotChecked=0, Total=600
[2018-01-24 12:56:49,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2018-01-24 12:56:49,402 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50.
[2018-01-24 12:56:49,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-01-24 12:56:49,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions.
[2018-01-24 12:56:49,404 INFO  L78                 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21
[2018-01-24 12:56:49,404 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-24 12:56:49,404 INFO  L432      AbstractCegarLoop]: Abstraction has 50 states and 53 transitions.
[2018-01-24 12:56:49,404 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-24 12:56:49,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions.
[2018-01-24 12:56:49,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-24 12:56:49,405 INFO  L314         BasicCegarLoop]: Found error trace
[2018-01-24 12:56:49,406 INFO  L322         BasicCegarLoop]: trace histogram [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]
[2018-01-24 12:56:49,406 INFO  L371      AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-24 12:56:49,406 INFO  L82        PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times
[2018-01-24 12:56:49,406 INFO  L67    tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy
[2018-01-24 12:56:49,407 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:49,407 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-24 12:56:49,408 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-24 12:56:49,408 INFO  L280   anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2018-01-24 12:56:49,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-24 12:56:49,422 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-24 12:56:49,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-24 12:56:49,467 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-24 12:56:49,467 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-24 12:56:49,467 INFO  L252   anRefinementStrategy]: Using the first perfect interpolant sequence
[2018-01-24 12:56:49,467 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-24 12:56:49,467 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-24 12:56:49,468 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-24 12:56:49,468 INFO  L87              Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states.
[2018-01-24 12:56:49,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-24 12:56:49,584 INFO  L93              Difference]: Finished difference Result 50 states and 53 transitions.
[2018-01-24 12:56:49,585 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-01-24 12:56:49,585 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 26
[2018-01-24 12:56:49,585 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-24 12:56:49,585 INFO  L225             Difference]: With dead ends: 50
[2018-01-24 12:56:49,585 INFO  L226             Difference]: Without dead ends: 0
[2018-01-24 12:56:49,586 INFO  L525         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-24 12:56:49,586 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-01-24 12:56:49,586 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-01-24 12:56:49,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-01-24 12:56:49,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-01-24 12:56:49,587 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26
[2018-01-24 12:56:49,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-24 12:56:49,587 INFO  L432      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-01-24 12:56:49,587 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-24 12:56:49,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-01-24 12:56:49,588 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-01-24 12:56:49,593 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-01-24 12:56:50,116 WARN  L146               SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 74 DAG size of output 49
[2018-01-24 12:56:50,401 WARN  L146               SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 77 DAG size of output 65
[2018-01-24 12:56:50,404 INFO  L401   ceAbstractionStarter]: For program point  ULTIMATE.initEXIT(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,404 INFO  L397   ceAbstractionStarter]: At program point  ULTIMATE.initENTRY(lines 1 562)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  ULTIMATE.initFINAL(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  L550'''(line 550)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  L545(lines 545 552)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesErr3RequiresViolation(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  L548(lines 548 551)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesFINAL(lines 540 554)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesErr2RequiresViolation(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  L545''''(lines 545 552)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  L550''(line 550)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesEXIT(lines 540 554)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  L548'(line 548)  no Hoare annotation was computed.
[2018-01-24 12:56:50,405 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesErr1RequiresViolation(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,406 INFO  L397   ceAbstractionStarter]: At program point  L545'''(lines 545 552)  the Hoare annotation is:  (let ((.cse0 (not (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (<= |sumOfThirdBytes_#in~array_size| v_main_~array_size~5_BEFORE_CALL_2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |sumOfThirdBytes_#in~numbers.base|)))))) (.cse1 (not (= (select |#valid| |sumOfThirdBytes_#in~numbers.base|) 1))) (.cse2 (not (= 0 |sumOfThirdBytes_#in~numbers.offset|)))) (and (or (<= sumOfThirdBytes_~array_size 1) .cse0 .cse1 (< 1 |sumOfThirdBytes_#in~array_size|) .cse2) (let ((.cse3 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (<= sumOfThirdBytes_~array_size v_main_~array_size~5_BEFORE_CALL_2)))) (.cse4 (= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|))) (.cse5 (= |sumOfThirdBytes_~#numbers.offset| 0))) (or .cse0 .cse1 (and (<= 1 sumOfThirdBytes_~i~2) .cse3 (<= sumOfThirdBytes_~p~2.offset (+ |sumOfThirdBytes_~#numbers.offset| (* 4 sumOfThirdBytes_~i~2) 2)) .cse4 .cse5) .cse2 (and (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size) (= sumOfThirdBytes_~i~2 0) .cse3 .cse4 .cse5)))))
[2018-01-24 12:56:50,406 INFO  L401   ceAbstractionStarter]: For program point  L550'(line 550)  no Hoare annotation was computed.
[2018-01-24 12:56:50,406 INFO  L401   ceAbstractionStarter]: For program point  L550(line 550)  no Hoare annotation was computed.
[2018-01-24 12:56:50,406 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesErr5RequiresViolation(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,406 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesErr0RequiresViolation(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,406 INFO  L404   ceAbstractionStarter]: At program point  sumOfThirdBytesENTRY(lines 540 554)  the Hoare annotation is:  true
[2018-01-24 12:56:50,406 INFO  L401   ceAbstractionStarter]: For program point  sumOfThirdBytesErr4RequiresViolation(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,406 INFO  L401   ceAbstractionStarter]: For program point  L545''(lines 545 552)  no Hoare annotation was computed.
[2018-01-24 12:56:50,406 INFO  L397   ceAbstractionStarter]: At program point  L548'''(lines 548 551)  the Hoare annotation is:  (let ((.cse0 (not (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (<= |sumOfThirdBytes_#in~array_size| v_main_~array_size~5_BEFORE_CALL_2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |sumOfThirdBytes_#in~numbers.base|)))))) (.cse1 (not (= (select |#valid| |sumOfThirdBytes_#in~numbers.base|) 1))) (.cse2 (= sumOfThirdBytes_~i~2 0)) (.cse3 (not (= 0 |sumOfThirdBytes_#in~numbers.offset|)))) (and (or .cse0 .cse1 (and .cse2 (<= sumOfThirdBytes_~array_size 1)) (< 1 |sumOfThirdBytes_#in~array_size|) .cse3) (or .cse0 .cse1 (let ((.cse4 (= 1 (select |#valid| sumOfThirdBytes_~p~2.base))) (.cse5 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (<= sumOfThirdBytes_~array_size v_main_~array_size~5_BEFORE_CALL_2)))) (.cse6 (<= sumOfThirdBytes_~p~2.offset (+ |sumOfThirdBytes_~#numbers.offset| (* 4 sumOfThirdBytes_~i~2) 2))) (.cse7 (= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|))) (.cse8 (= |sumOfThirdBytes_~#numbers.offset| 0))) (or (and .cse4 .cse5 .cse6 .cse7 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int) (sumOfThirdBytes_~i~2 Int)) (and (<= 1 sumOfThirdBytes_~i~2) (<= (+ sumOfThirdBytes_~i~2 1) v_main_~array_size~5_BEFORE_CALL_2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| sumOfThirdBytes_~p~2.base)) (= (+ (* 4 sumOfThirdBytes_~i~2) 2) sumOfThirdBytes_~p~2.offset))) .cse8) (and .cse4 .cse2 .cse5 (<= 2 sumOfThirdBytes_~p~2.offset) (<= (+ sumOfThirdBytes_~p~2.offset 2) (select |#length| sumOfThirdBytes_~p~2.base)) (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size) .cse6 .cse7 .cse8))) .cse3)))
[2018-01-24 12:56:50,406 INFO  L404   ceAbstractionStarter]: At program point  ULTIMATE.startENTRY(lines 1 562)  the Hoare annotation is:  true
[2018-01-24 12:56:50,406 INFO  L401   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L404   ceAbstractionStarter]: At program point  L1(lines 1 562)  the Hoare annotation is:  true
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(lines 1 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  L560(line 560)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  L560'(line 560)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  L561'(line 561)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L397   ceAbstractionStarter]: At program point  L561(line 561)  the Hoare annotation is:  (let ((.cse0 (* 4 main_~array_size~5))) (and (= .cse0 (select |#length| main_~numbers~5.base)) (= 0 main_~numbers~5.offset) (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| main_~numbers~5.base)) (<= 1 main_~array_size~5) (= .cse0 (select |#length| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|) (= 1 (select |#valid| |main_#t~malloc6.base|))))
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  L557(lines 557 559)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  mainFINAL(lines 555 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  mainEXIT(lines 555 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L397   ceAbstractionStarter]: At program point  mainENTRY(lines 555 562)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  L560''(line 560)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  L557''(lines 557 559)  no Hoare annotation was computed.
[2018-01-24 12:56:50,407 INFO  L401   ceAbstractionStarter]: For program point  mainErr0EnsuresViolation(lines 555 562)  no Hoare annotation was computed.
[2018-01-24 12:56:50,414 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,415 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,415 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,415 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,415 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,416 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,416 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,416 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,417 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,418 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,418 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,418 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,423 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,424 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,424 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,424 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,425 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,425 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,425 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,425 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,426 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,426 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,426 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,427 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,431 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,431 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,431 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,432 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,432 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,432 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,433 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,433 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,433 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,433 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,433 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,434 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,434 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,434 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,435 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,435 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,435 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,436 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,436 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,438 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,439 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,439 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,439 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,440 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,440 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,440 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,440 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,441 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,441 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,441 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,441 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,442 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,442 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,442 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,443 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,443 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,443 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,443 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,446 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:56:50 BoogieIcfgContainer
[2018-01-24 12:56:50,446 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-24 12:56:50,447 INFO  L168              Benchmark]: Toolchain (without parser) took 4548.68 ms. Allocated memory was 306.2 MB in the beginning and 498.6 MB in the end (delta: 192.4 MB). Free memory was 266.1 MB in the beginning and 378.0 MB in the end (delta: -111.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 5.3 GB.
[2018-01-24 12:56:50,448 INFO  L168              Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-24 12:56:50,449 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 203.52 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 254.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB.
[2018-01-24 12:56:50,449 INFO  L168              Benchmark]: Boogie Preprocessor took 36.61 ms. Allocated memory is still 306.2 MB. Free memory was 254.8 MB in the beginning and 253.8 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB.
[2018-01-24 12:56:50,449 INFO  L168              Benchmark]: RCFGBuilder took 222.12 ms. Allocated memory is still 306.2 MB. Free memory was 253.8 MB in the beginning and 237.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 5.3 GB.
[2018-01-24 12:56:50,450 INFO  L168              Benchmark]: TraceAbstraction took 4080.01 ms. Allocated memory was 306.2 MB in the beginning and 498.6 MB in the end (delta: 192.4 MB). Free memory was 237.6 MB in the beginning and 378.0 MB in the end (delta: -140.4 MB). Peak memory consumption was 52.0 MB. Max. memory is 5.3 GB.
[2018-01-24 12:56:50,451 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.12 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
 * CACSL2BoogieTranslator took 203.52 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 254.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB.
 * Boogie Preprocessor took 36.61 ms. Allocated memory is still 306.2 MB. Free memory was 254.8 MB in the beginning and 253.8 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB.
 * RCFGBuilder took 222.12 ms. Allocated memory is still 306.2 MB. Free memory was 253.8 MB in the beginning and 237.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 5.3 GB.
 * TraceAbstraction took 4080.01 ms. Allocated memory was 306.2 MB in the beginning and 498.6 MB in the end (delta: 192.4 MB). Free memory was 237.6 MB in the beginning and 378.0 MB in the end (delta: -140.4 MB). Peak memory consumption was 52.0 MB. Max. memory is 5.3 GB.
 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor:
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
 * 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
 * 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: 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: 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: 555]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - AllSpecificationsHoldResult: All specifications hold
    7 specifications checked. All of them hold
  - InvariantResult [Line: 545]: Loop Invariant
[2018-01-24 12:56:50,457 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,457 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,458 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,458 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,458 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,458 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,459 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,459 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,459 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,459 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,460 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,460 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,461 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,461 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,462 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,462 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,462 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,462 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,462 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,462 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,462 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,463 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,463 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,463 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
    Derived loop invariant: ((((array_size <= 1 || !(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers])) || !(\valid[numbers] == 1)) || 1 < \old(array_size)) || !(0 == numbers)) && ((((!(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers]) || !(\valid[numbers] == 1)) || ((((1 <= i && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && numbers == 0)) || !(0 == numbers)) || ((((\old(array_size) <= array_size && i == 0) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && 1 == \valid[numbers]) && numbers == 0))
  - InvariantResult [Line: 548]: Loop Invariant
[2018-01-24 12:56:50,465 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,465 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,466 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,466 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,466 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,466 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,466 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,467 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,467 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,467 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,467 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,467 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,468 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,468 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,468 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,469 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,469 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,469 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,469 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,471 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,471 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,472 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,472 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,472 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,472 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,473 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,473 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,473 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,473 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,473 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED]
[2018-01-24 12:56:50,474 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,474 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED]
[2018-01-24 12:56:50,474 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,474 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,475 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,475 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,475 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-24 12:56:50,475 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
    Derived loop invariant: ((((!(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers]) || !(\valid[numbers] == 1)) || (i == 0 && array_size <= 1)) || 1 < \old(array_size)) || !(0 == numbers)) && (((!(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers]) || !(\valid[numbers] == 1)) || (((((1 == \valid[p] && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int, sumOfThirdBytes_~i~2 : int :: ((1 <= sumOfThirdBytes_~i~2 && sumOfThirdBytes_~i~2 + 1 <= v_main_~array_size~5_BEFORE_CALL_2) && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[p]) && 4 * sumOfThirdBytes_~i~2 + 2 == p)) && numbers == 0) || ((((((((1 == \valid[p] && i == 0) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[numbers] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && 2 <= p) && p + 2 <= unknown-#length-unknown[p]) && \old(array_size) <= array_size) && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && numbers == 0)) || !(0 == numbers))
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 38 locations, 7 error locations. SAFE Result, 3.9s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 262 SDslu, 484 SDs, 0 SdLazy, 334 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 338 HoareAnnotationTreeSize, 11 FomulaSimplifications, 293 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 612 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 232 ConstructedInterpolants, 40 QuantifiedInterpolants, 40620 SizeOfPredicates, 25 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 18/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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/stroeder2-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-56-50-481.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder2-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-56-50-481.csv
Received shutdown request...