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_smtcomp.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 05:32:05,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:32:05,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:32:05,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:32:05,237 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:32:05,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:32:05,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:32:05,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:32:05,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:32:05,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:32:05,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:32:05,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:32:05,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:32:05,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:32:05,244 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:32:05,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:32:05,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:32:05,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:32:05,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:32:05,253 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:32:05,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:32:05,256 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:32:05,256 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:32:05,257 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:32:05,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:32:05,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:32:05,259 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:32:05,260 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:32:05,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:32:05,260 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:32:05,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:32:05,261 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_smtcomp.epf [2018-01-25 05:32:05,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:32:05,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:32:05,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:32:05,272 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:32:05,272 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:32:05,272 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:32:05,272 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:32:05,273 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:32:05,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:32:05,274 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:32:05,274 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:32:05,274 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:32:05,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:32:05,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:32:05,274 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:32:05,275 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:32:05,275 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:32:05,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:32:05,275 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:32:05,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:32:05,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:32:05,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:32:05,276 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:32:05,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:32:05,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:32:05,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:32:05,277 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:32:05,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:32:05,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:32:05,277 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:32:05,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:32:05,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:32:05,278 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:32:05,278 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:32:05,279 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:32:05,279 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:32:05,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:32:05,327 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:32:05,331 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:32:05,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:32:05,346 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:32:05,347 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 05:32:05,532 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:32:05,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:32:05,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:05,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:32:05,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:32:05,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b86bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05, skipping insertion in model container [2018-01-25 05:32:05,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,567 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:05,607 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:05,710 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:05,724 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:05,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05 WrapperNode [2018-01-25 05:32:05,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:05,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:32:05,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:32:05,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:32:05,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (1/1) ... [2018-01-25 05:32:05,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:32:05,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:32:05,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:32:05,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:32:05,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (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 05:32:05,807 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:32:05,807 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:32:05,808 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-01-25 05:32:05,808 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-01-25 05:32:05,808 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:32:05,809 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:32:05,809 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:32:05,978 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:32:05,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:05 BoogieIcfgContainer [2018-01-25 05:32:05,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:32:05,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:32:05,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:32:05,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:32:05,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:32:05" (1/3) ... [2018-01-25 05:32:05,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326e732c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:05, skipping insertion in model container [2018-01-25 05:32:05,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:05" (2/3) ... [2018-01-25 05:32:05,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326e732c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:05, skipping insertion in model container [2018-01-25 05:32:05,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:05" (3/3) ... [2018-01-25 05:32:05,984 INFO L105 eAbstractionObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:32:05,991 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:32:05,997 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 05:32:06,039 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:32:06,039 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:32:06,040 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:32:06,040 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:32:06,040 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:32:06,040 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:32:06,040 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:32:06,040 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:32:06,041 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:32:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-25 05:32:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:32:06,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:06,060 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:06,060 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times [2018-01-25 05:32:06,068 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:06,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:06,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:06,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:06,112 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:06,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:06,338 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 05:32:06,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:06,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:32:06,341 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:06,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:32:06,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:32:06,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:32:06,359 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 7 states. [2018-01-25 05:32:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:06,590 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-25 05:32:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:32:06,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 05:32:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:06,604 INFO L225 Difference]: With dead ends: 67 [2018-01-25 05:32:06,604 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 05:32:06,607 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:32:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 05:32:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-01-25 05:32:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 05:32:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-25 05:32:06,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-25 05:32:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:06,635 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-25 05:32:06,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:32:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-25 05:32:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:32:06,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:06,636 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:06,636 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times [2018-01-25 05:32:06,637 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:06,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:06,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:06,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:06,638 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:06,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:06,794 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 05:32:06,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:06,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:32:06,794 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:06,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:32:06,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:32:06,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:32:06,797 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-01-25 05:32:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:07,028 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-25 05:32:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:32:07,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 05:32:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:07,029 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:32:07,030 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:32:07,031 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 05:32:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:32:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-01-25 05:32:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:32:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 05:32:07,040 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15 [2018-01-25 05:32:07,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:07,040 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 05:32:07,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:32:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 05:32:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:32:07,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:07,041 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 05:32:07,042 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:07,042 INFO L82 PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times [2018-01-25 05:32:07,042 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:07,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:07,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:07,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:07,043 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:07,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:07,102 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 05:32:07,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:07,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:32:07,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:07,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:07,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:07,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:07,103 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-01-25 05:32:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:07,130 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-25 05:32:07,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:07,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 05:32:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:07,132 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:32:07,132 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 05:32:07,132 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 05:32:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 05:32:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-01-25 05:32:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:32:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 05:32:07,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-25 05:32:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:07,140 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 05:32:07,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 05:32:07,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:07,141 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:07,142 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 05:32:07,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times [2018-01-25 05:32:07,142 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:07,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:07,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:07,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:07,143 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:07,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:07,288 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 05:32:07,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:07,289 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:07,289 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 05:32:07,291 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [48], [52], [53], [60], [61], [62], [64] [2018-01-25 05:32:07,337 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:07,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:07,597 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:07,599 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 05:32:07,615 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:07,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:07,615 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 05:32:07,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:07,622 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:07,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:07,731 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 05:32:07,732 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:07,775 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 05:32:07,799 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:32:07,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 15 [2018-01-25 05:32:07,799 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:07,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:07,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:07,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:32:07,800 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-25 05:32:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:07,846 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-25 05:32:07,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:07,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 05:32:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:07,849 INFO L225 Difference]: With dead ends: 86 [2018-01-25 05:32:07,849 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 05:32:07,850 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:32:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 05:32:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-25 05:32:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 05:32:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-25 05:32:07,860 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2018-01-25 05:32:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:07,861 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-25 05:32:07,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-25 05:32:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:07,862 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:07,862 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 05:32:07,862 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times [2018-01-25 05:32:07,863 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:07,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:07,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:07,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:07,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:07,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:08,019 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 05:32:08,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:08,020 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:08,020 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 05:32:08,020 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [50], [52], [53], [60], [61], [62], [64] [2018-01-25 05:32:08,021 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:08,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:08,148 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:08,148 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 05:32:08,155 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:08,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:08,155 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 05:32:08,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:08,162 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:08,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:08,201 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 05:32:08,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:08,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:08,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:32:08,377 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 05:32:08,377 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:08,623 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 05:32:08,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:08,658 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 05:32:08,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:08,664 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:08,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:08,705 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 05:32:08,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:08,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:08,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:32:08,755 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 05:32:08,755 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:08,835 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 05:32:08,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:32:08,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 19 [2018-01-25 05:32:08,837 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:32:08,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:32:08,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:32:08,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:32:08,838 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 14 states. [2018-01-25 05:32:09,225 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 33 DAG size of output 31 [2018-01-25 05:32:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:09,456 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-25 05:32:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:32:09,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-01-25 05:32:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:09,458 INFO L225 Difference]: With dead ends: 66 [2018-01-25 05:32:09,458 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:32:09,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:32:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:32:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2018-01-25 05:32:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:32:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-25 05:32:09,468 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21 [2018-01-25 05:32:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:09,469 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-25 05:32:09,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:32:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-25 05:32:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:32:09,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:09,470 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 05:32:09,470 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:32:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times [2018-01-25 05:32:09,471 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:09,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:09,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:09,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:09,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:09,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:09,545 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 05:32:09,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:09,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:09,546 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:09,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:09,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:09,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:09,547 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-01-25 05:32:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:09,631 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-25 05:32:09,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:09,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 05:32:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:09,632 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:32:09,632 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:32:09,632 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 05:32:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:32:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:32:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:32:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:32:09,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-25 05:32:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:09,633 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:32:09,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:32:09,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:32:09,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:32:09,989 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 74 DAG size of output 49 [2018-01-25 05:32:10,214 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-01-25 05:32:10,217 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,217 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point L550'''(line 550) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 552) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 551) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesFINAL(lines 540 554) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 552) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesEXIT(lines 540 554) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-25 05:32:10,218 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,219 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 05:32:10,219 INFO L401 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-25 05:32:10,219 INFO L401 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-25 05:32:10,219 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr5RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,219 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,219 INFO L404 ceAbstractionStarter]: At program point sumOfThirdBytesENTRY(lines 540 554) the Hoare annotation is: true [2018-01-25 05:32:10,219 INFO L401 ceAbstractionStarter]: For program point sumOfThirdBytesErr4RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,220 INFO L401 ceAbstractionStarter]: For program point L545''(lines 545 552) no Hoare annotation was computed. [2018-01-25 05:32:10,220 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 05:32:10,220 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-25 05:32:10,220 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,220 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-25 05:32:10,220 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-25 05:32:10,220 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-25 05:32:10,220 INFO L401 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-25 05:32:10,220 INFO L401 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-25 05:32:10,221 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 05:32:10,221 INFO L401 ceAbstractionStarter]: For program point L557(lines 557 559) no Hoare annotation was computed. [2018-01-25 05:32:10,221 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 555 562) no Hoare annotation was computed. [2018-01-25 05:32:10,221 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 555 562) no Hoare annotation was computed. [2018-01-25 05:32:10,221 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 555 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:32:10,221 INFO L401 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-25 05:32:10,221 INFO L401 ceAbstractionStarter]: For program point L557''(lines 557 559) no Hoare annotation was computed. [2018-01-25 05:32:10,221 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 555 562) no Hoare annotation was computed. [2018-01-25 05:32:10,227 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 05:32:10,228 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 05:32:10,229 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 05:32:10,229 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 05:32:10,229 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 05:32:10,229 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 05:32:10,230 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 05:32:10,230 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 05:32:10,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,239 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 05:32:10,239 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 05:32:10,240 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 05:32:10,240 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 05:32:10,241 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 05:32:10,241 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 05:32:10,241 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 05:32:10,241 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 05:32:10,242 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,242 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,243 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,243 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,246 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 05:32:10,247 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 05:32:10,247 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 05:32:10,247 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 05:32:10,248 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,248 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 05:32:10,248 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,248 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 05:32:10,249 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,249 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 05:32:10,250 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 05:32:10,250 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 05:32:10,250 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 05:32:10,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,255 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 05:32:10,256 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 05:32:10,256 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 05:32:10,256 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 05:32:10,256 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,257 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 05:32:10,257 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,257 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 05:32:10,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,258 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 05:32:10,259 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 05:32:10,259 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 05:32:10,259 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 05:32:10,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:32:10 BoogieIcfgContainer [2018-01-25 05:32:10,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:32:10,265 INFO L168 Benchmark]: Toolchain (without parser) took 4732.57 ms. Allocated memory was 305.7 MB in the beginning and 507.5 MB in the end (delta: 201.9 MB). Free memory was 265.7 MB in the beginning and 321.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 146.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:10,266 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:32:10,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.03 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:10,267 INFO L168 Benchmark]: Boogie Preprocessor took 32.77 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 253.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 05:32:10,267 INFO L168 Benchmark]: RCFGBuilder took 216.23 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 238.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:10,268 INFO L168 Benchmark]: TraceAbstraction took 4284.70 ms. Allocated memory was 305.7 MB in the beginning and 507.5 MB in the end (delta: 201.9 MB). Free memory was 237.0 MB in the beginning and 321.5 MB in the end (delta: -84.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:10,270 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.03 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.77 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 253.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 216.23 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 238.0 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4284.70 ms. Allocated memory was 305.7 MB in the beginning and 507.5 MB in the end (delta: 201.9 MB). Free memory was 237.0 MB in the beginning and 321.5 MB in the end (delta: -84.4 MB). Peak memory consumption was 117.4 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.451473 RENAME_VARIABLES(MILLISECONDS) : 0.310734 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.402572 PROJECTAWAY(MILLISECONDS) : 0.275569 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.206451 DISJOIN(MILLISECONDS) : 0.448015 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.352576 ADD_EQUALITY(MILLISECONDS) : 0.036355 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.040974 #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) : 1.374792 RENAME_VARIABLES(MILLISECONDS) : 0.246731 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.313559 PROJECTAWAY(MILLISECONDS) : 0.273969 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.102565 DISJOIN(MILLISECONDS) : 0.359788 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.276641 ADD_EQUALITY(MILLISECONDS) : 0.021099 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015015 #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 05:32:10,281 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 05:32:10,282 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 05:32:10,282 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 05:32:10,282 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 05:32:10,282 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 05:32:10,283 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 05:32:10,283 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 05:32:10,283 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 05:32:10,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,286 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 05:32:10,287 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 05:32:10,287 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 05:32:10,287 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 05:32:10,288 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 05:32:10,288 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 05:32:10,288 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 05:32:10,288 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 05:32:10,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,290 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 05:32:10,292 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 05:32:10,292 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 05:32:10,292 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 05:32:10,293 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 05:32:10,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,293 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 05:32:10,293 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,294 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 05:32:10,294 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,294 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 05:32:10,295 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 05:32:10,295 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 05:32:10,295 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 05:32:10,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,300 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 05:32:10,300 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 05:32:10,301 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 05:32:10,301 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 05:32:10,301 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,301 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 05:32:10,302 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,302 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 05:32:10,302 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sumOfThirdBytes_~i~2,QUANTIFIED] [2018-01-25 05:32:10,303 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 05:32:10,303 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 05:32:10,303 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 05:32:10,304 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 05:32:10,304 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,304 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,304 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,305 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,305 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:32:10,306 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, 4.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 262 SDslu, 484 SDs, 0 SdLazy, 334 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s 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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-32-10-311.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-32-10-311.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-32-10-311.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-32-10-311.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-32-10-311.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-32-10-311.csv Received shutdown request...