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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:48:25,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:48:25,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:48:25,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:48:25,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:48:25,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:48:25,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:48:25,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:48:25,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:48:25,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:48:25,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:48:25,190 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:48:25,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:48:25,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:48:25,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:48:25,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:48:25,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:48:25,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:48:25,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:48:25,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:48:25,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:48:25,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:48:25,205 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:48:25,206 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:48:25,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:48:25,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:48:25,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:48:25,210 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:48:25,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:48:25,210 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:48:25,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:48:25,211 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:48:25,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:48:25,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:48:25,224 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:48:25,224 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:48:25,224 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:48:25,224 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:48:25,224 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:48:25,225 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:48:25,225 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:48:25,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:48:25,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:48:25,226 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:48:25,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:48:25,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:48:25,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:48:25,227 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:48:25,227 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:48:25,227 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:48:25,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:48:25,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:48:25,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:48:25,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:48:25,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:48:25,228 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:48:25,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:48:25,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:48:25,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:48:25,229 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:48:25,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:48:25,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:48:25,230 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:48:25,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:48:25,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:48:25,230 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:48:25,231 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:48:25,231 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:48:25,232 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:48:25,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:48:25,276 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:48:25,279 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:48:25,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:48:25,281 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:48:25,282 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-25 02:48:25,460 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:48:25,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:48:25,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:48:25,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:48:25,472 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:48:25,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f741a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25, skipping insertion in model container [2018-01-25 02:48:25,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,493 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:48:25,534 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:48:25,675 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:48:25,690 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:48:25,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25 WrapperNode [2018-01-25 02:48:25,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:48:25,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:48:25,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:48:25,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:48:25,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (1/1) ... [2018-01-25 02:48:25,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:48:25,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:48:25,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:48:25,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:48:25,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (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-25 02:48:25,781 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:48:25,782 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:48:25,782 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-01-25 02:48:25,782 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:48:25,782 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:48:25,782 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:48:25,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:48:25,782 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:48:25,782 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:48:25,782 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:48:25,782 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-01-25 02:48:25,783 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:48:25,783 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:48:25,783 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:48:25,953 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:48:25,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:48:25 BoogieIcfgContainer [2018-01-25 02:48:25,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:48:25,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:48:25,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:48:25,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:48:25,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:48:25" (1/3) ... [2018-01-25 02:48:25,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@943ce67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:48:25, skipping insertion in model container [2018-01-25 02:48:25,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:25" (2/3) ... [2018-01-25 02:48:25,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@943ce67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:48:25, skipping insertion in model container [2018-01-25 02:48:25,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:48:25" (3/3) ... [2018-01-25 02:48:25,959 INFO L105 eAbstractionObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:48:25,966 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:48:25,971 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 02:48:26,011 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:48:26,011 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:48:26,011 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:48:26,011 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:48:26,012 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:48:26,012 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:48:26,012 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:48:26,012 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:48:26,013 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:48:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-25 02:48:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:48:26,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:26,042 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:26,043 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:48:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times [2018-01-25 02:48:26,051 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:26,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:26,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:26,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:26,097 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:26,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:26,388 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-25 02:48:26,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:26,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:48:26,391 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:26,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:48:26,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:48:26,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:48:26,413 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 7 states. [2018-01-25 02:48:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:26,787 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-25 02:48:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:48:26,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 02:48:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:26,801 INFO L225 Difference]: With dead ends: 67 [2018-01-25 02:48:26,801 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 02:48:26,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:48:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 02:48:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-01-25 02:48:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 02:48:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-25 02:48:26,843 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-25 02:48:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:26,843 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-25 02:48:26,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:48:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-25 02:48:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:48:26,844 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:26,844 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:26,844 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:48:26,845 INFO L82 PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times [2018-01-25 02:48:26,845 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:26,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:26,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:26,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:26,846 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:26,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:27,016 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-25 02:48:27,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:27,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:48:27,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:27,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:48:27,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:48:27,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:48:27,020 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-01-25 02:48:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:27,209 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-25 02:48:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:48:27,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 02:48:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:27,211 INFO L225 Difference]: With dead ends: 53 [2018-01-25 02:48:27,211 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:48:27,212 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-25 02:48:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:48:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-01-25 02:48:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:48:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 02:48:27,222 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15 [2018-01-25 02:48:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:27,223 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 02:48:27,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:48:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 02:48:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:48:27,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:27,224 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-25 02:48:27,224 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:48:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times [2018-01-25 02:48:27,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:27,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:27,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:27,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:27,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:27,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:27,322 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-25 02:48:27,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:27,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:48:27,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:27,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:48:27,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:48:27,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:48:27,324 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-01-25 02:48:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:27,358 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-25 02:48:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:48:27,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 02:48:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:27,360 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:48:27,360 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 02:48:27,360 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-25 02:48:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 02:48:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-01-25 02:48:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:48:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 02:48:27,369 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-25 02:48:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:27,370 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 02:48:27,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:48:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 02:48:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:48:27,371 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:27,371 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-25 02:48:27,371 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:48:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times [2018-01-25 02:48:27,372 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:27,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:27,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:27,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:27,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:27,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:27,540 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-25 02:48:27,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:27,540 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:48:27,541 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 02:48:27,543 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [48], [52], [53], [60], [61], [62], [64] [2018-01-25 02:48:27,601 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:48:27,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:48:28,245 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:48:28,247 INFO L268 AbstractInterpreter]: Visited 18 different actions 25 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 02:48:28,259 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:48:28,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:28,259 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-25 02:48:28,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:28,276 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:48:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:28,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:48:28,492 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-25 02:48:28,492 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:48:28,555 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-25 02:48:28,581 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 02:48:28,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 15 [2018-01-25 02:48:28,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:28,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:48:28,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:48:28,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:48:28,582 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-25 02:48:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:28,682 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-25 02:48:28,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:48:28,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 02:48:28,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:28,684 INFO L225 Difference]: With dead ends: 86 [2018-01-25 02:48:28,684 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 02:48:28,685 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:48:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 02:48:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-25 02:48:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 02:48:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-25 02:48:28,696 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2018-01-25 02:48:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:28,696 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-25 02:48:28,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:48:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-25 02:48:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:48:28,697 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:28,698 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-25 02:48:28,698 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:48:28,698 INFO L82 PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times [2018-01-25 02:48:28,699 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:28,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:28,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:28,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:28,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:28,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:28,891 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-25 02:48:28,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:28,892 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:48:28,892 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 02:48:28,892 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [50], [52], [53], [60], [61], [62], [64] [2018-01-25 02:48:28,893 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:48:28,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:48:29,384 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:48:29,384 INFO L268 AbstractInterpreter]: Visited 18 different actions 25 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 02:48:29,391 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:48:29,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:29,392 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-25 02:48:29,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:29,400 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:48:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:29,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:48:29,458 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-25 02:48:29,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:29,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:29,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:48:29,892 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-25 02:48:29,892 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:48:30,180 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-25 02:48:30,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:30,205 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-25 02:48:30,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:30,211 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:48:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:30,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:48:30,255 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-25 02:48:30,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:30,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:30,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:48:30,366 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-25 02:48:30,366 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:48:30,449 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-25 02:48:30,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:48:30,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 19 [2018-01-25 02:48:30,452 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:48:30,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 02:48:30,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 02:48:30,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-01-25 02:48:30,453 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 14 states. [2018-01-25 02:48:30,914 WARN L146 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 33 DAG size of output 31 [2018-01-25 02:48:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:31,229 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-25 02:48:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:48:31,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-01-25 02:48:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:31,230 INFO L225 Difference]: With dead ends: 66 [2018-01-25 02:48:31,231 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 02:48:31,231 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-01-25 02:48:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 02:48:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2018-01-25 02:48:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:48:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-25 02:48:31,242 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21 [2018-01-25 02:48:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:31,242 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-25 02:48:31,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 02:48:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-25 02:48:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:48:31,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:31,244 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-25 02:48:31,244 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:48:31,244 INFO L82 PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times [2018-01-25 02:48:31,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:31,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:31,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:31,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:31,246 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:31,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:31,317 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-25 02:48:31,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:31,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:48:31,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:31,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:48:31,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:48:31,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:48:31,318 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-01-25 02:48:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:31,388 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-25 02:48:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:48:31,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 02:48:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:31,389 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:48:31,389 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 02:48:31,389 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-25 02:48:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 02:48:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 02:48:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 02:48:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 02:48:31,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-25 02:48:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:31,390 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 02:48:31,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:48:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 02:48:31,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 02:48:31,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 02:48:31,909 WARN L146 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 74 DAG size of output 49 [2018-01-25 02:48:32,112 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-01-25 02:48:32,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,116 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:48:32,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,116 INFO L401 ceAbstractionStarter]: For program point L550'''(line 550) no Hoare annotation was computed. [2018-01-25 02:48:32,116 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 552) no Hoare annotation was computed. [2018-01-25 02:48:32,116 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,116 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 551) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesFINAL(lines 540 554) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 552) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesEXIT(lines 540 554) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,117 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_4 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |sumOfThirdBytes_#in~numbers.base|)) (<= |sumOfThirdBytes_#in~array_size| v_main_~array_size~5_BEFORE_CALL_4))))) (.cse1 (not (= (select |#valid| |sumOfThirdBytes_#in~numbers.base|) 1))) (.cse5 (not (= 0 |sumOfThirdBytes_#in~numbers.offset|)))) (and (let ((.cse2 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= sumOfThirdBytes_~array_size v_main_~array_size~5_BEFORE_CALL_4) (= (select |#length| |sumOfThirdBytes_~#numbers.base|) (* 4 v_main_~array_size~5_BEFORE_CALL_4))))) (.cse3 (= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|))) (.cse4 (= |sumOfThirdBytes_~#numbers.offset| 0))) (or .cse0 .cse1 (and .cse2 (<= 1 sumOfThirdBytes_~i~2) (<= sumOfThirdBytes_~p~2.offset (+ |sumOfThirdBytes_~#numbers.offset| (* 4 sumOfThirdBytes_~i~2) 2)) .cse3 .cse4) .cse5 (and .cse2 (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size) (= sumOfThirdBytes_~i~2 0) .cse3 .cse4))) (or .cse0 .cse1 (<= sumOfThirdBytes_~array_size 1) (< 1 |sumOfThirdBytes_#in~array_size|) .cse5))) [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-25 02:48:32,117 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr5RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,118 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,118 INFO L404 ceAbstractionStarter]: At program point sumOfThirdBytesENTRY(lines 540 554) the Hoare annotation is: true [2018-01-25 02:48:32,118 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr4RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,118 INFO L401 ceAbstractionStarter]: For program point L545''(lines 545 552) no Hoare annotation was computed. [2018-01-25 02:48:32,118 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_4 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |sumOfThirdBytes_#in~numbers.base|)) (<= |sumOfThirdBytes_#in~array_size| v_main_~array_size~5_BEFORE_CALL_4))))) (.cse1 (not (= (select |#valid| |sumOfThirdBytes_#in~numbers.base|) 1))) (.cse8 (not (= 0 |sumOfThirdBytes_#in~numbers.offset|))) (.cse7 (= sumOfThirdBytes_~i~2 0))) (and (or .cse0 .cse1 (let ((.cse3 (= 1 (select |#valid| sumOfThirdBytes_~p~2.base))) (.cse2 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= sumOfThirdBytes_~array_size v_main_~array_size~5_BEFORE_CALL_4) (= (select |#length| |sumOfThirdBytes_~#numbers.base|) (* 4 v_main_~array_size~5_BEFORE_CALL_4))))) (.cse4 (<= sumOfThirdBytes_~p~2.offset (+ |sumOfThirdBytes_~#numbers.offset| (* 4 sumOfThirdBytes_~i~2) 2))) (.cse5 (= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|))) (.cse6 (= |sumOfThirdBytes_~#numbers.offset| 0))) (or (and .cse2 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int) (sumOfThirdBytes_~i~2 Int)) (and (<= (+ sumOfThirdBytes_~i~2 1) v_main_~array_size~5_BEFORE_CALL_4) (<= 1 sumOfThirdBytes_~i~2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| sumOfThirdBytes_~p~2.base)) (= (+ (* 4 sumOfThirdBytes_~i~2) 2) sumOfThirdBytes_~p~2.offset))) .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse7 (<= 2 sumOfThirdBytes_~p~2.offset) (<= (+ sumOfThirdBytes_~p~2.offset 2) (select |#length| sumOfThirdBytes_~p~2.base)) .cse2 (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size) .cse4 .cse5 .cse6))) .cse8) (or .cse0 .cse1 (< 1 |sumOfThirdBytes_#in~array_size|) .cse8 (and .cse7 (<= sumOfThirdBytes_~array_size 1))))) [2018-01-25 02:48:32,118 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-25 02:48:32,118 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,118 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-25 02:48:32,118 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 02:48:32,118 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-25 02:48:32,118 INFO L401 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-25 02:48:32,119 INFO L401 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-25 02:48:32,119 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-25 02:48:32,119 INFO L401 ceAbstractionStarter]: For program point L557(lines 557 559) no Hoare annotation was computed. [2018-01-25 02:48:32,119 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 555 562) no Hoare annotation was computed. [2018-01-25 02:48:32,119 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 555 562) no Hoare annotation was computed. [2018-01-25 02:48:32,119 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 555 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:48:32,119 INFO L401 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-25 02:48:32,119 INFO L401 ceAbstractionStarter]: For program point L557''(lines 557 559) no Hoare annotation was computed. [2018-01-25 02:48:32,119 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 555 562) no Hoare annotation was computed. [2018-01-25 02:48:32,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,140 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,140 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,140 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,145 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,146 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,147 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,148 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,149 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,149 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,149 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,149 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,150 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,150 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,158 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:48:32 BoogieIcfgContainer [2018-01-25 02:48:32,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:48:32,161 INFO L168 Benchmark]: Toolchain (without parser) took 6700.28 ms. Allocated memory was 299.9 MB in the beginning and 553.6 MB in the end (delta: 253.8 MB). Free memory was 256.8 MB in the beginning and 339.8 MB in the end (delta: -83.0 MB). Peak memory consumption was 170.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:32,162 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 299.9 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:48:32,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.19 ms. Allocated memory is still 299.9 MB. Free memory was 256.8 MB in the beginning and 246.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:32,163 INFO L168 Benchmark]: Boogie Preprocessor took 35.28 ms. Allocated memory is still 299.9 MB. Free memory was 246.6 MB in the beginning and 244.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:32,163 INFO L168 Benchmark]: RCFGBuilder took 221.21 ms. Allocated memory is still 299.9 MB. Free memory was 244.6 MB in the beginning and 229.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:32,164 INFO L168 Benchmark]: TraceAbstraction took 6206.23 ms. Allocated memory was 299.9 MB in the beginning and 553.6 MB in the end (delta: 253.8 MB). Free memory was 227.7 MB in the beginning and 339.8 MB in the end (delta: -112.2 MB). Peak memory consumption was 141.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:32,166 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.21 ms. Allocated memory is still 299.9 MB. Free memory is still 262.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.19 ms. Allocated memory is still 299.9 MB. Free memory was 256.8 MB in the beginning and 246.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.28 ms. Allocated memory is still 299.9 MB. Free memory was 246.6 MB in the beginning and 244.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 221.21 ms. Allocated memory is still 299.9 MB. Free memory was 244.6 MB in the beginning and 229.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6206.23 ms. Allocated memory was 299.9 MB in the beginning and 553.6 MB in the end (delta: 253.8 MB). Free memory was 227.7 MB in the beginning and 339.8 MB in the end (delta: -112.2 MB). Peak memory consumption was 141.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 155 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.235881 RENAME_VARIABLES(MILLISECONDS) : 0.324663 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.171906 PROJECTAWAY(MILLISECONDS) : 0.237292 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.115643 DISJOIN(MILLISECONDS) : 0.213401 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.364749 ADD_EQUALITY(MILLISECONDS) : 0.041920 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.029156 #CONJOIN_DISJUNCTIVE : 40 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 68 #PROJECTAWAY : 58 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 41 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 148 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.641313 RENAME_VARIABLES(MILLISECONDS) : 0.141123 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.610812 PROJECTAWAY(MILLISECONDS) : 0.152068 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.087240 DISJOIN(MILLISECONDS) : 0.242080 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.160846 ADD_EQUALITY(MILLISECONDS) : 0.016008 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011224 #CONJOIN_DISJUNCTIVE : 40 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 68 #PROJECTAWAY : 58 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * 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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,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_4,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_4,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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,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_4,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_4,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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,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-25 02:48:32,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[numbers] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4) || !(\valid[numbers] == 1)) || (((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: array_size <= v_main_~array_size~5_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~5_BEFORE_CALL_4) && 1 <= i) && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && numbers == 0)) || !(0 == numbers)) || (((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: array_size <= v_main_~array_size~5_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~5_BEFORE_CALL_4) && \old(array_size) <= array_size) && i == 0) && 1 == \valid[numbers]) && numbers == 0)) && ((((!(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[numbers] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4) || !(\valid[numbers] == 1)) || array_size <= 1) || 1 < \old(array_size)) || !(0 == numbers)) - InvariantResult [Line: 548]: Loop Invariant [2018-01-25 02:48:32,201 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,205 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,206 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,207 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 02:48:32,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:48:32,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:48:32,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((!(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[numbers] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4) || !(\valid[numbers] == 1)) || ((((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: array_size <= v_main_~array_size~5_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~5_BEFORE_CALL_4) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int, sumOfThirdBytes_~i~2 : int :: ((sumOfThirdBytes_~i~2 + 1 <= v_main_~array_size~5_BEFORE_CALL_4 && 1 <= sumOfThirdBytes_~i~2) && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[p]) && 4 * sumOfThirdBytes_~i~2 + 2 == p)) && 1 == \valid[p]) && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && numbers == 0) || ((((((((1 == \valid[p] && i == 0) && 2 <= p) && p + 2 <= unknown-#length-unknown[p]) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: array_size <= v_main_~array_size~5_BEFORE_CALL_4 && unknown-#length-unknown[numbers] == 4 * v_main_~array_size~5_BEFORE_CALL_4)) && \old(array_size) <= array_size) && p <= numbers + 4 * i + 2) && 1 == \valid[numbers]) && numbers == 0)) || !(0 == numbers)) && ((((!(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[numbers] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4) || !(\valid[numbers] == 1)) || 1 < \old(array_size)) || !(0 == numbers)) || (i == 0 && array_size <= 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 7 error locations. SAFE Result, 6.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 262 SDslu, 484 SDs, 0 SdLazy, 334 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.1s 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, 1.2s AbstIntTime, 2 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.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s 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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-48-32-221.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-48-32-221.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-48-32-221.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_02-48-32-221.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_02-48-32-221.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-48-32-221.csv Received shutdown request...