java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:18:12,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:18:12,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:18:12,186 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:18:12,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:18:12,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:18:12,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:18:12,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:18:12,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:18:12,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:18:12,194 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:18:12,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:18:12,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:18:12,197 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:18:12,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:18:12,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:18:12,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:18:12,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:18:12,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:18:12,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:18:12,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:18:12,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:18:12,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:18:12,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:18:12,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:18:12,213 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:18:12,213 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:18:12,214 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:18:12,214 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:18:12,214 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:18:12,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:18:12,215 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:18:12,226 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:18:12,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:18:12,227 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:18:12,227 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:18:12,228 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:18:12,228 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:18:12,228 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:18:12,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:18:12,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:18:12,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:18:12,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:18:12,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:18:12,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:18:12,230 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:18:12,230 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:18:12,230 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:18:12,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:18:12,231 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:18:12,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:18:12,231 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:18:12,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:18:12,231 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:18:12,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:18:12,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:18:12,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:18:12,232 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:18:12,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:18:12,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:18:12,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:18:12,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:18:12,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:18:12,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:18:12,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:18:12,234 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:18:12,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:18:12,283 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:18:12,289 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:18:12,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:18:12,291 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:18:12,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:18:12,572 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:18:12,580 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:18:12,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:12,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:18:12,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:18:12,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56530028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12, skipping insertion in model container [2018-01-31 08:18:12,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,617 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:12,666 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:12,814 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:12,831 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:12,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12 WrapperNode [2018-01-31 08:18:12,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:12,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:18:12,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:18:12,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:18:12,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (1/1) ... [2018-01-31 08:18:12,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:18:12,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:18:12,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:18:12,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:18:12,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (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-31 08:18:12,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:18:12,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:18:12,942 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-31 08:18:12,943 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:18:12,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:18:12,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:18:12,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:18:12,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:18:12,943 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:18:12,943 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:18:12,944 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-31 08:18:12,944 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:18:12,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:18:12,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:18:13,382 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:18:13,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:13 BoogieIcfgContainer [2018-01-31 08:18:13,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:18:13,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:18:13,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:18:13,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:18:13,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:18:12" (1/3) ... [2018-01-31 08:18:13,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a2b728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:13, skipping insertion in model container [2018-01-31 08:18:13,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:12" (2/3) ... [2018-01-31 08:18:13,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a2b728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:13, skipping insertion in model container [2018-01-31 08:18:13,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:13" (3/3) ... [2018-01-31 08:18:13,391 INFO L107 eAbstractionObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:18:13,401 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:18:13,409 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-31 08:18:13,455 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:18:13,455 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:18:13,456 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:18:13,456 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:18:13,456 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:18:13,456 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:18:13,456 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:18:13,456 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:18:13,457 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:18:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-31 08:18:13,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:18:13,476 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:13,478 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:13,478 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:18:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 841446010, now seen corresponding path program 1 times [2018-01-31 08:18:13,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:13,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:13,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:13,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:13,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:13,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:13,984 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-31 08:18:13,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:13,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:18:13,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:18:14,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:18:14,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:18:14,007 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 6 states. [2018-01-31 08:18:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:14,562 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-01-31 08:18:14,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:18:14,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-31 08:18:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:14,573 INFO L225 Difference]: With dead ends: 88 [2018-01-31 08:18:14,573 INFO L226 Difference]: Without dead ends: 49 [2018-01-31 08:18:14,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:18:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-31 08:18:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-31 08:18:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 08:18:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-01-31 08:18:14,615 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 22 [2018-01-31 08:18:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:14,615 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-01-31 08:18:14,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:18:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-01-31 08:18:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:18:14,616 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:14,616 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:14,617 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:18:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash 841446011, now seen corresponding path program 1 times [2018-01-31 08:18:14,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:14,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:14,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:14,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:14,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:14,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:14,903 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-31 08:18:14,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:14,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:18:14,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:18:14,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:18:14,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:18:14,906 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 8 states. [2018-01-31 08:18:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:15,173 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-01-31 08:18:15,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:18:15,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-31 08:18:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:15,178 INFO L225 Difference]: With dead ends: 72 [2018-01-31 08:18:15,178 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 08:18:15,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:18:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 08:18:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-01-31 08:18:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 08:18:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-01-31 08:18:15,190 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 22 [2018-01-31 08:18:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:15,191 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-01-31 08:18:15,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:18:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-01-31 08:18:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:18:15,194 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:15,195 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:15,195 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:18:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1470561202, now seen corresponding path program 1 times [2018-01-31 08:18:15,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:15,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:15,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:15,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:15,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:15,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:15,284 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-31 08:18:15,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:15,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:18:15,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:18:15,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:18:15,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:18:15,285 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-01-31 08:18:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:15,684 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-01-31 08:18:15,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:18:15,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-31 08:18:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:15,685 INFO L225 Difference]: With dead ends: 75 [2018-01-31 08:18:15,686 INFO L226 Difference]: Without dead ends: 66 [2018-01-31 08:18:15,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:18:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-31 08:18:15,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-01-31 08:18:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 08:18:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-01-31 08:18:15,695 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 28 [2018-01-31 08:18:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:15,695 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-01-31 08:18:15,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:18:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-01-31 08:18:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:18:15,697 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:15,697 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:15,697 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:18:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2139955263, now seen corresponding path program 1 times [2018-01-31 08:18:15,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:15,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:15,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:15,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:15,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:15,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:16,121 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-31 08:18:16,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:16,122 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:16,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:16,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:16,224 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-31 08:18:16,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:16,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:16,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:16,758 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-31 08:18:16,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:16,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-31 08:18:16,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:18:16,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:18:16,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:18:16,789 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 18 states. [2018-01-31 08:18:17,254 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 34 DAG size of output 29 [2018-01-31 08:18:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:17,808 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-01-31 08:18:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:18:17,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-01-31 08:18:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:17,810 INFO L225 Difference]: With dead ends: 67 [2018-01-31 08:18:17,810 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 08:18:17,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:18:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 08:18:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-01-31 08:18:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-31 08:18:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-31 08:18:17,819 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 31 [2018-01-31 08:18:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:17,819 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-31 08:18:17,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:18:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-31 08:18:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:18:17,821 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:17,821 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:17,821 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-31 08:18:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1404154094, now seen corresponding path program 1 times [2018-01-31 08:18:17,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:17,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:17,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:17,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:17,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:17,929 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-31 08:18:17,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:17,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:18:17,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:17,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:17,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:17,930 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 4 states. [2018-01-31 08:18:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:17,983 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-31 08:18:17,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:18:17,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-31 08:18:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:17,984 INFO L225 Difference]: With dead ends: 48 [2018-01-31 08:18:17,984 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:18:17,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:18:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:18:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:18:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:18:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:18:17,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-31 08:18:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:17,986 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:18:17,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:18:17,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:18:17,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:18:18,326 WARN L143 SmtUtils]: Spent 225ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-31 08:18:18,930 WARN L146 SmtUtils]: Spent 601ms on a formula simplification. DAG size of input: 57 DAG size of output 51 [2018-01-31 08:18:19,415 WARN L146 SmtUtils]: Spent 475ms on a formula simplification. DAG size of input: 51 DAG size of output 46 [2018-01-31 08:18:19,438 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,438 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,438 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:18:19,438 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,438 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 08:18:19,438 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 551) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point L545(lines 545 548) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-31 08:18:19,439 INFO L395 ceAbstractionStarter]: At program point L545'''''(lines 545 548) the Hoare annotation is: (or (not (= (select |#valid| |test_fun_#in~a.base|) 1)) (let ((.cse0 (= test_fun_~a.offset 0)) (.cse1 (= 1 (select |#valid| test_fun_~a.base))) (.cse2 (<= |test_fun_#in~N| test_fun_~N))) (or (and .cse0 .cse1 .cse2 (<= 1 test_fun_~i~2) (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| test_fun_~a.base)) (<= (+ test_fun_~i~2 1) v_main_~array_size~5_BEFORE_CALL_1))) (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_1)))) (let ((.cse3 (select |#length| test_fun_~a.base))) (and (<= 4 .cse3) .cse0 (= 0 test_fun_~i~2) .cse1 .cse2 (<= (* 4 test_fun_~N) .cse3) (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| test_fun_~a.base)) (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_1))))))) (not (= 0 |test_fun_#in~a.offset|)) (not (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |test_fun_#in~a.base|))))) (< (select |#length| |test_fun_#in~a.base|) 4)) [2018-01-31 08:18:19,439 INFO L399 ceAbstractionStarter]: For program point test_funEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-31 08:18:19,440 INFO L399 ceAbstractionStarter]: For program point L544'''''''(lines 544 549) no Hoare annotation was computed. [2018-01-31 08:18:19,440 INFO L399 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,440 INFO L402 ceAbstractionStarter]: At program point test_funENTRY(lines 540 551) the Hoare annotation is: true [2018-01-31 08:18:19,440 INFO L395 ceAbstractionStarter]: At program point L544''''''(lines 544 549) the Hoare annotation is: (let ((.cse4 (select |#length| test_fun_~a.base))) (let ((.cse0 (<= 4 .cse4)) (.cse1 (= test_fun_~a.offset 0)) (.cse2 (= 1 (select |#valid| test_fun_~a.base))) (.cse3 (<= |test_fun_#in~N| test_fun_~N))) (or (not (= (select |#valid| |test_fun_#in~a.base|) 1)) (not (= 0 |test_fun_#in~a.offset|)) (not (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |test_fun_#in~a.base|))))) (and .cse0 .cse1 (= 0 test_fun_~i~2) .cse2 .cse3 (<= (* 4 test_fun_~N) .cse4) (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| test_fun_~a.base)) (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_1)))) (and .cse0 .cse1 .cse2 .cse3 (<= 1 test_fun_~i~2) (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_1)))) (< (select |#length| |test_fun_#in~a.base|) 4)))) [2018-01-31 08:18:19,440 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-31 08:18:19,440 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-31 08:18:19,440 INFO L399 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,440 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L544'''(lines 544 549) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point test_funFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L544'(lines 544 549) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,441 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-31 08:18:19,442 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-31 08:18:19,442 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,442 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-31 08:18:19,442 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-31 08:18:19,442 INFO L399 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-31 08:18:19,442 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-31 08:18:19,442 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-31 08:18:19,443 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 552 559) no Hoare annotation was computed. [2018-01-31 08:18:19,443 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-31 08:18:19,443 INFO L399 ceAbstractionStarter]: For program point L554(lines 554 556) no Hoare annotation was computed. [2018-01-31 08:18:19,443 INFO L395 ceAbstractionStarter]: At program point L558(line 558) 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|)) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|))) [2018-01-31 08:18:19,443 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 552 559) no Hoare annotation was computed. [2018-01-31 08:18:19,443 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 552 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:18:19,443 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-31 08:18:19,444 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-31 08:18:19,444 INFO L399 ceAbstractionStarter]: For program point L554''(lines 554 556) no Hoare annotation was computed. [2018-01-31 08:18:19,444 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-31 08:18:19,444 INFO L399 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-31 08:18:19,444 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 559) no Hoare annotation was computed. [2018-01-31 08:18:19,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,454 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,454 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,454 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,455 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,469 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,470 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,470 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,470 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,471 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,472 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,474 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,475 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,476 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,476 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,477 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,477 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,477 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,478 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,478 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,478 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,478 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,480 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,481 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,481 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,481 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,482 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,483 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:18:19 BoogieIcfgContainer [2018-01-31 08:18:19,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:18:19,486 INFO L168 Benchmark]: Toolchain (without parser) took 6913.76 ms. Allocated memory was 306.2 MB in the beginning and 493.9 MB in the end (delta: 187.7 MB). Free memory was 265.9 MB in the beginning and 442.5 MB in the end (delta: -176.6 MB). Peak memory consumption was 129.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:19,488 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:18:19,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.71 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:19,488 INFO L168 Benchmark]: Boogie Preprocessor took 37.59 ms. Allocated memory is still 306.2 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:19,489 INFO L168 Benchmark]: RCFGBuilder took 504.44 ms. Allocated memory is still 306.2 MB. Free memory was 252.8 MB in the beginning and 235.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:19,489 INFO L168 Benchmark]: TraceAbstraction took 6101.29 ms. Allocated memory was 306.2 MB in the beginning and 493.9 MB in the end (delta: 187.7 MB). Free memory was 235.8 MB in the beginning and 442.5 MB in the end (delta: -206.6 MB). Peak memory consumption was 99.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:19,491 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.17 ms. Allocated memory is still 306.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.71 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.59 ms. Allocated memory is still 306.2 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 504.44 ms. Allocated memory is still 306.2 MB. Free memory was 252.8 MB in the beginning and 235.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6101.29 ms. Allocated memory was 306.2 MB in the beginning and 493.9 MB in the end (delta: 187.7 MB). Free memory was 235.8 MB in the beginning and 442.5 MB in the end (delta: -206.6 MB). Peak memory consumption was 99.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,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 - 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: 552]: 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-31 08:18:19,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,500 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,500 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,501 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,503 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,503 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,504 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,504 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,504 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,504 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,505 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,505 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((!(\valid[a] == 1) || (((((a == 0 && 1 == \valid[a]) && \old(N) <= N) && 1 <= i) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && i + 1 <= v_main_~array_size~5_BEFORE_CALL_1)) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && N <= v_main_~array_size~5_BEFORE_CALL_1)) || ((((((4 <= unknown-#length-unknown[a] && a == 0) && 0 == i) && 1 == \valid[a]) && \old(N) <= N) && 4 * N <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && \old(N) <= v_main_~array_size~5_BEFORE_CALL_1))) || !(0 == a)) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4 - InvariantResult [Line: 544]: Loop Invariant [2018-01-31 08:18:19,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,508 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,512 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,512 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,512 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,513 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,513 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,513 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:18:19,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:19,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(\valid[a] == 1) || !(0 == a)) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a])) || ((((((4 <= unknown-#length-unknown[a] && a == 0) && 0 == i) && 1 == \valid[a]) && \old(N) <= N) && 4 * N <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && \old(N) <= v_main_~array_size~5_BEFORE_CALL_1))) || (((((4 <= unknown-#length-unknown[a] && a == 0) && 1 == \valid[a]) && \old(N) <= N) && 1 <= i) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && N <= v_main_~array_size~5_BEFORE_CALL_1))) || unknown-#length-unknown[a] < 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 7 error locations. SAFE Result, 5.9s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 482 SDslu, 646 SDs, 0 SdLazy, 365 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 11 NumberOfFragments, 261 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 230 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 165 ConstructedInterpolants, 18 QuantifiedInterpolants, 27477 SizeOfPredicates, 8 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 4/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-18-19-520.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-18-19-520.csv Received shutdown request...