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/array03-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:20:04,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:20:04,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:20:04,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:20:04,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:20:04,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:20:04,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:20:04,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:20:04,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:20:04,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:20:04,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:20:04,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:20:04,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:20:04,037 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:20:04,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:20:04,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:20:04,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:20:04,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:20:04,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:20:04,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:20:04,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:20:04,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:20:04,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:20:04,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:20:04,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:20:04,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:20:04,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:20:04,053 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:20:04,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:20:04,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:20:04,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:20:04,054 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:20:04,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:20:04,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:20:04,065 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:20:04,065 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:20:04,065 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:20:04,065 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:20:04,066 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:20:04,066 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:20:04,066 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:20:04,067 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:20:04,067 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:20:04,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:20:04,067 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:20:04,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:20:04,068 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:20:04,068 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:20:04,068 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:20:04,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:20:04,068 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:20:04,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:20:04,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:20:04,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:20:04,069 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:20:04,069 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:20:04,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:20:04,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:20:04,070 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:20:04,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:20:04,070 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:20:04,070 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:20:04,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:20:04,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:20:04,071 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:20:04,071 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:20:04,072 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:20:04,072 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:20:04,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:20:04,116 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:20:04,120 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:20:04,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:20:04,122 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:20:04,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:20:04,336 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:20:04,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:20:04,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:20:04,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:20:04,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:20:04,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04, skipping insertion in model container [2018-01-25 05:20:04,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,362 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:20:04,398 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:20:04,510 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:20:04,525 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:20:04,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04 WrapperNode [2018-01-25 05:20:04,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:20:04,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:20:04,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:20:04,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:20:04,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (1/1) ... [2018-01-25 05:20:04,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:20:04,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:20:04,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:20:04,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:20:04,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (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:20:04,615 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:20:04,615 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:20:04,615 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-25 05:20:04,615 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:20:04,615 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:20:04,615 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:20:04,615 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:20:04,615 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:20:04,615 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:20:04,616 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:20:04,616 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-25 05:20:04,616 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:20:04,616 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:20:04,616 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:20:04,839 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:20:04,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:20:04 BoogieIcfgContainer [2018-01-25 05:20:04,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:20:04,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:20:04,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:20:04,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:20:04,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:20:04" (1/3) ... [2018-01-25 05:20:04,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d298a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:20:04, skipping insertion in model container [2018-01-25 05:20:04,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:04" (2/3) ... [2018-01-25 05:20:04,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d298a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:20:04, skipping insertion in model container [2018-01-25 05:20:04,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:20:04" (3/3) ... [2018-01-25 05:20:04,845 INFO L105 eAbstractionObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:20:04,851 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:20:04,857 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 05:20:04,891 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:20:04,891 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:20:04,892 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:20:04,892 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:20:04,892 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:20:04,892 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:20:04,892 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:20:04,892 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:20:04,893 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:20:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-01-25 05:20:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:20:04,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:04,921 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:04,921 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:20:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393893, now seen corresponding path program 1 times [2018-01-25 05:20:04,927 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:04,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:04,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:04,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:04,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:05,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:05,146 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:20:05,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:05,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:20:05,149 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:05,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:20:05,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:20:05,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:20:05,163 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 6 states. [2018-01-25 05:20:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:05,462 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-01-25 05:20:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:20:05,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-25 05:20:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:05,472 INFO L225 Difference]: With dead ends: 84 [2018-01-25 05:20:05,473 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:20:05,475 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:20:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:20:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 05:20:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:20:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 05:20:05,507 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-01-25 05:20:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:05,508 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 05:20:05,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:20:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 05:20:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:20:05,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:05,509 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:05,509 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:20:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393894, now seen corresponding path program 1 times [2018-01-25 05:20:05,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:05,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:05,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:05,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:05,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:05,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:05,668 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:20:05,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:05,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:20:05,670 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:05,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:20:05,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:20:05,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:20:05,673 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-25 05:20:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:05,912 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-01-25 05:20:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:20:05,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 05:20:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:05,916 INFO L225 Difference]: With dead ends: 67 [2018-01-25 05:20:05,916 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 05:20:05,917 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:20:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 05:20:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-25 05:20:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:20:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-01-25 05:20:05,926 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2018-01-25 05:20:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:05,927 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-01-25 05:20:05,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:20:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-01-25 05:20:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:20:05,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:05,928 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:05,928 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:20:05,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1978668179, now seen corresponding path program 1 times [2018-01-25 05:20:05,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:05,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:05,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:05,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:05,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:05,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:05,990 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:20:05,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:05,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:20:05,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:05,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:20:05,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:20:05,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:20:05,992 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 5 states. [2018-01-25 05:20:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:06,074 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-01-25 05:20:06,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:20:06,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:20:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:06,075 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:20:06,075 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 05:20:06,075 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:20:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 05:20:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-01-25 05:20:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:20:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-25 05:20:06,081 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 18 [2018-01-25 05:20:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:06,081 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-25 05:20:06,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:20:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-25 05:20:06,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:20:06,082 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:06,082 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:06,082 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:20:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash 35069262, now seen corresponding path program 1 times [2018-01-25 05:20:06,083 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:06,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:06,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:06,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:06,084 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:06,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:06,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:06,205 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:06,207 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 05:20:06,209 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [17], [31], [33], [38], [56], [60], [68], [71], [75], [76], [82], [83], [84], [86] [2018-01-25 05:20:06,257 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:20:06,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:20:08,122 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:20:08,123 INFO L268 AbstractInterpreter]: Visited 21 different actions 61 times. Merged at 10 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 05:20:08,137 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:20:08,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:08,137 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:20:08,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:08,149 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:08,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:08,399 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:08,597 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:20:08,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 14 [2018-01-25 05:20:08,598 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:08,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:20:08,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:20:08,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:20:08,599 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-01-25 05:20:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:08,906 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-25 05:20:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:20:08,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 05:20:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:08,908 INFO L225 Difference]: With dead ends: 116 [2018-01-25 05:20:08,908 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 05:20:08,908 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:20:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 05:20:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-01-25 05:20:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 05:20:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-25 05:20:08,917 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 23 [2018-01-25 05:20:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:08,917 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-25 05:20:08,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:20:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-25 05:20:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:20:08,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:08,919 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:08,919 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:20:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1553278640, now seen corresponding path program 1 times [2018-01-25 05:20:08,919 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:08,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:08,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:08,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:08,921 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:08,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:09,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:09,095 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:09,096 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 05:20:09,096 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [17], [31], [33], [38], [56], [60], [68], [73], [75], [76], [82], [83], [84], [86] [2018-01-25 05:20:09,097 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:20:09,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:20:10,955 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:20:10,956 INFO L268 AbstractInterpreter]: Visited 21 different actions 61 times. Merged at 10 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 05:20:10,970 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:20:10,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:10,970 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:20:10,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:10,982 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:11,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:11,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:20:11,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:11,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:20:11,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:20:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:11,197 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:11,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:11,547 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:20:11,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:11,552 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:11,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:11,593 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:20:11,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:11,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:20:11,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:20:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:11,643 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:11,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:20:11,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-25 05:20:11,771 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:20:11,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:20:11,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:20:11,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:20:11,772 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 13 states. [2018-01-25 05:20:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:12,100 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-01-25 05:20:12,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:20:12,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-25 05:20:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:12,102 INFO L225 Difference]: With dead ends: 83 [2018-01-25 05:20:12,103 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 05:20:12,103 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:20:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 05:20:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-01-25 05:20:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 05:20:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-01-25 05:20:12,120 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-01-25 05:20:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:12,120 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-01-25 05:20:12,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:20:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-01-25 05:20:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:20:12,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:12,122 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, 1] [2018-01-25 05:20:12,122 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 05:20:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1156880581, now seen corresponding path program 1 times [2018-01-25 05:20:12,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:12,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:12,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:12,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:12,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:12,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:20:12,216 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:20:12,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:12,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:20:12,216 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:12,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:20:12,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:20:12,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:20:12,217 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 4 states. [2018-01-25 05:20:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:12,289 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-01-25 05:20:12,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:20:12,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 05:20:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:12,290 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:20:12,291 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:20:12,291 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:20:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:20:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:20:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:20:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:20:12,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-25 05:20:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:12,293 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:20:12,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:20:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:20:12,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:20:12,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:20:12,621 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 56 DAG size of output 47 [2018-01-25 05:20:12,653 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,653 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:20:12,653 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point test_funErr6RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point test_funErr12RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 556) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point test_funErr7RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,654 INFO L401 ceAbstractionStarter]: For program point test_funErr11RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,655 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 05:20:12,655 INFO L401 ceAbstractionStarter]: For program point test_funErr8RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,655 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-25 05:20:12,655 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,655 INFO L401 ceAbstractionStarter]: For program point L551'''(lines 551 554) no Hoare annotation was computed. [2018-01-25 05:20:12,655 INFO L404 ceAbstractionStarter]: At program point test_funENTRY(lines 540 557) the Hoare annotation is: true [2018-01-25 05:20:12,655 INFO L401 ceAbstractionStarter]: For program point L551''''(lines 551 554) no Hoare annotation was computed. [2018-01-25 05:20:12,655 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point L544'''(lines 544 556) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point test_funErr10RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 05:20:12,656 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 554) no Hoare annotation was computed. [2018-01-25 05:20:12,657 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-25 05:20:12,657 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-25 05:20:12,657 INFO L401 ceAbstractionStarter]: For program point L553'''(line 553) no Hoare annotation was computed. [2018-01-25 05:20:12,657 INFO L401 ceAbstractionStarter]: For program point test_funErr9RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,657 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,657 INFO L397 ceAbstractionStarter]: At program point L544''(lines 544 556) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse1 (not (= 0 |test_fun_#in~a.offset|))) (.cse2 (not (exists ((v_main_~array_size~7_BEFORE_CALL_4 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~7_BEFORE_CALL_4) (= (* 4 v_main_~array_size~7_BEFORE_CALL_4) (select |#length| |test_fun_#in~a.base|)))))) (.cse3 (< (select |#length| |test_fun_#in~a.base|) 4))) (and (or .cse0 .cse1 (<= test_fun_~N 1) (< 1 |test_fun_#in~N|) .cse2 .cse3) (let ((.cse4 (= test_fun_~a.offset 0)) (.cse5 (= 1 (select |#valid| test_fun_~a.base))) (.cse6 (exists ((v_main_~array_size~7_BEFORE_CALL_4 Int)) (and (= (* 4 v_main_~array_size~7_BEFORE_CALL_4) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~7_BEFORE_CALL_4))))) (or .cse0 .cse1 .cse2 (and (<= 4 (select |#length| test_fun_~a.base)) .cse4 .cse5 (<= |test_fun_#in~N| test_fun_~N) .cse6 (<= 0 test_fun_~i~2)) .cse3 (and .cse4 .cse5 .cse6 (<= 1 test_fun_~i~2)))))) [2018-01-25 05:20:12,658 INFO L401 ceAbstractionStarter]: For program point test_funErr13RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,658 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-25 05:20:12,658 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,658 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-25 05:20:12,658 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-25 05:20:12,658 INFO L401 ceAbstractionStarter]: For program point L560(lines 560 562) no Hoare annotation was computed. [2018-01-25 05:20:12,658 INFO L397 ceAbstractionStarter]: At program point L564(line 564) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~7))) (and (= 0 |main_#t~malloc9.offset|) (= .cse0 (select |#length| main_~numbers~7.base)) (= 0 main_~numbers~7.offset) (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (<= 1 main_~array_size~7) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= 1 (select |#valid| main_~numbers~7.base)))) [2018-01-25 05:20:12,659 INFO L401 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-25 05:20:12,659 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-25 05:20:12,659 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-25 05:20:12,659 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 558 565) no Hoare annotation was computed. [2018-01-25 05:20:12,659 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 558 565) no Hoare annotation was computed. [2018-01-25 05:20:12,659 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 558 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:20:12,659 INFO L401 ceAbstractionStarter]: For program point L560''(lines 560 562) no Hoare annotation was computed. [2018-01-25 05:20:12,659 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 558 565) no Hoare annotation was computed. [2018-01-25 05:20:12,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,668 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,676 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,676 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,679 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:20:12 BoogieIcfgContainer [2018-01-25 05:20:12,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:20:12,684 INFO L168 Benchmark]: Toolchain (without parser) took 8346.62 ms. Allocated memory was 303.0 MB in the beginning and 727.7 MB in the end (delta: 424.7 MB). Free memory was 263.1 MB in the beginning and 656.8 MB in the end (delta: -393.7 MB). Peak memory consumption was 374.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:12,684 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:20:12,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.12 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:12,685 INFO L168 Benchmark]: Boogie Preprocessor took 35.11 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 250.8 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:20:12,686 INFO L168 Benchmark]: RCFGBuilder took 272.34 ms. Allocated memory is still 303.0 MB. Free memory was 250.8 MB in the beginning and 232.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:12,686 INFO L168 Benchmark]: TraceAbstraction took 7842.15 ms. Allocated memory was 303.0 MB in the beginning and 727.7 MB in the end (delta: 424.7 MB). Free memory was 232.2 MB in the beginning and 656.8 MB in the end (delta: -424.7 MB). Peak memory consumption was 343.9 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:12,688 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 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.12 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.11 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 250.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 272.34 ms. Allocated memory is still 303.0 MB. Free memory was 250.8 MB in the beginning and 232.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7842.15 ms. Allocated memory was 303.0 MB in the beginning and 727.7 MB in the end (delta: 424.7 MB). Free memory was 232.2 MB in the beginning and 656.8 MB in the end (delta: -424.7 MB). Peak memory consumption was 343.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 173 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 45 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.179724 RENAME_VARIABLES(MILLISECONDS) : 0.746530 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.139528 PROJECTAWAY(MILLISECONDS) : 0.831052 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.128905 DISJOIN(MILLISECONDS) : 0.548849 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.776601 ADD_EQUALITY(MILLISECONDS) : 0.082489 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.029574 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 212 #UNFREEZE : 0 #CONJOIN : 151 #PROJECTAWAY : 138 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 21 #RENAME_VARIABLES_DISJUNCTIVE : 203 #ADD_EQUALITY : 46 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 165 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 46 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.784912 RENAME_VARIABLES(MILLISECONDS) : 0.848572 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.725235 PROJECTAWAY(MILLISECONDS) : 1.159587 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.120352 DISJOIN(MILLISECONDS) : 0.810489 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.880395 ADD_EQUALITY(MILLISECONDS) : 0.048956 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015146 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 212 #UNFREEZE : 0 #CONJOIN : 151 #PROJECTAWAY : 138 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 21 #RENAME_VARIABLES_DISJUNCTIVE : 203 #ADD_EQUALITY : 47 #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~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_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 * 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: 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: 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: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-25 05:20:12,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,698 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,699 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,699 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,699 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,700 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,700 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,700 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,701 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 05:20:12,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,706 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:12,707 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[a] == 1) || !(0 == a)) || N <= 1) || 1 < \old(N)) || !(\exists v_main_~array_size~7_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~7_BEFORE_CALL_4 && 4 * v_main_~array_size~7_BEFORE_CALL_4 == unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4) && (((((!(\valid[a] == 1) || !(0 == a)) || !(\exists v_main_~array_size~7_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~7_BEFORE_CALL_4 && 4 * v_main_~array_size~7_BEFORE_CALL_4 == unknown-#length-unknown[a])) || (((((4 <= unknown-#length-unknown[a] && a == 0) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~7_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~7_BEFORE_CALL_4 == unknown-#length-unknown[a] && N <= v_main_~array_size~7_BEFORE_CALL_4)) && 0 <= i)) || unknown-#length-unknown[a] < 4) || (((a == 0 && 1 == \valid[a]) && (\exists v_main_~array_size~7_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~7_BEFORE_CALL_4 == unknown-#length-unknown[a] && N <= v_main_~array_size~7_BEFORE_CALL_4)) && 1 <= i)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 15 error locations. SAFE Result, 7.7s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 181 SDtfs, 366 SDslu, 474 SDs, 0 SdLazy, 448 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 173 HoareAnnotationTreeSize, 9 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 342 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 245 ConstructedInterpolants, 50 QuantifiedInterpolants, 51166 SizeOfPredicates, 19 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 15/26 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/array03-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-20-12-713.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-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-20-12-713.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-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-20-12-713.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-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-20-12-713.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-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-20-12-713.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-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-20-12-713.csv Received shutdown request...