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/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:20:20,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:20:20,778 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:20:20,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:20:20,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:20:20,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:20:20,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:20:20,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:20:20,798 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:20:20,799 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:20:20,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:20:20,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:20:20,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:20:20,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:20:20,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:20:20,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:20:20,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:20:20,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:20:20,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:20:20,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:20:20,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:20:20,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:20:20,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:20:20,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:20:20,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:20:20,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:20:20,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:20:20,820 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:20:20,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:20:20,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:20:20,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:20:20,821 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:20,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:20:20,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:20:20,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:20:20,830 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:20:20,831 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:20:20,831 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:20:20,831 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:20:20,831 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:20:20,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:20:20,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:20:20,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:20:20,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:20:20,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:20:20,833 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:20:20,833 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:20:20,833 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:20:20,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:20:20,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:20:20,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:20:20,834 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:20:20,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:20:20,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:20:20,834 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:20:20,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:20:20,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:20:20,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:20:20,835 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:20:20,835 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:20:20,835 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:20:20,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:20:20,878 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:20:20,882 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:20:20,883 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:20:20,883 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:20:20,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:20:21,056 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:20:21,061 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:20:21,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:20:21,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:20:21,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:20:21,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:20:21" (1/1) ... [2018-01-25 05:20:21,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b86bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:21, skipping insertion in model container [2018-01-25 05:20:21,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:20:21" (1/1) ... [2018-01-25 05:20:21,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:20:21,122 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:20:21,243 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:20:21,260 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:20:21,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:21 WrapperNode [2018-01-25 05:20:21,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:20:21,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:20:21,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:20:21,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:20:21,286 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:21" (1/1) ... [2018-01-25 05:20:21,287 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:21" (1/1) ... [2018-01-25 05:20:21,295 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:21" (1/1) ... [2018-01-25 05:20:21,295 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:21" (1/1) ... [2018-01-25 05:20:21,299 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:21" (1/1) ... [2018-01-25 05:20:21,302 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:21" (1/1) ... [2018-01-25 05:20:21,304 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:21" (1/1) ... [2018-01-25 05:20:21,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:20:21,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:20:21,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:20:21,306 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:20:21,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:21" (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:21,352 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:20:21,353 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:20:21,353 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:20:21,353 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:20:21,353 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:20:21,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:20:21,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:20:21,354 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:20:21,354 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:20:21,354 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:20:21,354 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:20:21,354 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:20:21,568 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:20:21,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:20:21 BoogieIcfgContainer [2018-01-25 05:20:21,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:20:21,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:20:21,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:20:21,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:20:21,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:20:21" (1/3) ... [2018-01-25 05:20:21,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6089608a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:20:21, skipping insertion in model container [2018-01-25 05:20:21,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:20:21" (2/3) ... [2018-01-25 05:20:21,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6089608a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:20:21, skipping insertion in model container [2018-01-25 05:20:21,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:20:21" (3/3) ... [2018-01-25 05:20:21,575 INFO L105 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:20:21,581 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:20:21,587 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 05:20:21,632 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:20:21,632 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:20:21,633 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:20:21,633 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:20:21,633 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:20:21,633 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:20:21,633 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:20:21,633 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:20:21,634 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:20:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-25 05:20:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:20:21,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:21,658 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:21,658 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1460855103, now seen corresponding path program 1 times [2018-01-25 05:20:21,664 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:21,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:21,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:21,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:21,707 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:21,763 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:21,846 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:21,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:21,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:20:21,848 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:21,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:20:21,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:20:21,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:20:21,863 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2018-01-25 05:20:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:22,025 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-01-25 05:20:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:20:22,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:20:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:22,036 INFO L225 Difference]: With dead ends: 69 [2018-01-25 05:20:22,036 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 05:20:22,039 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:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 05:20:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-25 05:20:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 05:20:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-25 05:20:22,069 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 13 [2018-01-25 05:20:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:22,069 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-25 05:20:22,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:20:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-25 05:20:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:20:22,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:22,070 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:22,071 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174720, now seen corresponding path program 1 times [2018-01-25 05:20:22,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:22,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:22,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:22,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:22,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:22,087 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:22,128 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:22,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:22,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:20:22,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:22,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:20:22,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:20:22,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:20:22,131 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2018-01-25 05:20:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:22,188 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-01-25 05:20:22,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:20:22,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:20:22,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:22,190 INFO L225 Difference]: With dead ends: 39 [2018-01-25 05:20:22,190 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 05:20:22,191 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 05:20:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 05:20:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:20:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-25 05:20:22,197 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-01-25 05:20:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:22,198 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-25 05:20:22,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:20:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-25 05:20:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:20:22,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:22,199 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:22,199 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1955174719, now seen corresponding path program 1 times [2018-01-25 05:20:22,199 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:22,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:22,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:22,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:22,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:22,218 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:22,467 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:22,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:22,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:20:22,468 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:22,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:20:22,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:20:22,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:20:22,469 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-01-25 05:20:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:22,606 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-25 05:20:22,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:20:22,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 05:20:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:22,607 INFO L225 Difference]: With dead ends: 60 [2018-01-25 05:20:22,608 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 05:20:22,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:20:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 05:20:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-25 05:20:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 05:20:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-01-25 05:20:22,614 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2018-01-25 05:20:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:22,614 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-01-25 05:20:22,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:20:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-01-25 05:20:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:20:22,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:22,615 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:22,615 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:22,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2068353263, now seen corresponding path program 1 times [2018-01-25 05:20:22,615 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:22,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:22,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:22,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:22,616 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:22,629 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:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:22,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:22,664 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:22,665 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-01-25 05:20:22,667 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [13], [19], [23], [28], [33], [35], [37], [39], [86], [87], [88] [2018-01-25 05:20:22,707 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:20:22,707 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:20:23,585 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:20:23,587 INFO L268 AbstractInterpreter]: Visited 16 different actions 24 times. Merged at 6 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 05:20:23,607 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:20:23,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:23,607 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:23,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:23,621 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:23,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:23,686 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:23,740 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:20:23,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 8 [2018-01-25 05:20:23,740 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:23,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:20:23,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:20:23,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:20:23,741 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-01-25 05:20:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:23,796 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-25 05:20:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:20:23,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 05:20:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:23,798 INFO L225 Difference]: With dead ends: 93 [2018-01-25 05:20:23,798 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 05:20:23,799 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:20:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 05:20:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2018-01-25 05:20:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:20:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-25 05:20:23,807 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2018-01-25 05:20:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:23,807 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-25 05:20:23,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:20:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-25 05:20:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:20:23,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:23,808 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:23,808 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:23,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1639808019, now seen corresponding path program 1 times [2018-01-25 05:20:23,811 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:23,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:23,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:23,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:23,812 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:23,826 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:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:23,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:23,969 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:23,969 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-01-25 05:20:23,969 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [19], [23], [28], [33], [35], [37], [39], [86], [87], [88] [2018-01-25 05:20:23,970 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:20:23,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:20:24,780 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:20:24,781 INFO L268 AbstractInterpreter]: Visited 16 different actions 24 times. Merged at 6 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-01-25 05:20:24,783 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:20:24,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:24,783 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:24,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:24,795 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:24,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:24,836 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:24,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:24,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:20:24,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:20:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:24,903 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:25,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:25,097 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:25,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:25,113 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:25,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:25,151 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:25,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:25,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:20:25,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 05:20:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:25,277 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:25,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:20:25,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 12 [2018-01-25 05:20:25,360 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:20:25,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:20:25,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:20:25,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:20:25,362 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2018-01-25 05:20:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:25,533 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-25 05:20:25,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:20:25,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 05:20:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:25,534 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:20:25,534 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:20:25,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:20:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:20:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-25 05:20:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:20:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-25 05:20:25,541 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 19 [2018-01-25 05:20:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:25,541 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-25 05:20:25,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:20:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-25 05:20:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:20:25,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:25,543 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] [2018-01-25 05:20:25,543 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1536064265, now seen corresponding path program 1 times [2018-01-25 05:20:25,543 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:25,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:25,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:25,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:25,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:25,557 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:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:25,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:25,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:20:25,634 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:25,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:20:25,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:20:25,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:20:25,635 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 9 states. [2018-01-25 05:20:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:25,783 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-01-25 05:20:25,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:20:25,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 05:20:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:25,784 INFO L225 Difference]: With dead ends: 66 [2018-01-25 05:20:25,784 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:20:25,784 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:20:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:20:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2018-01-25 05:20:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:20:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-25 05:20:25,790 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2018-01-25 05:20:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:25,790 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-25 05:20:25,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:20:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-25 05:20:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:20:25,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:25,792 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] [2018-01-25 05:20:25,792 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1312069626, now seen corresponding path program 1 times [2018-01-25 05:20:25,792 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:25,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:25,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:25,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:25,793 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:25,803 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:25,835 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:25,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:25,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:20:25,836 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:25,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:20:25,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:20:25,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:20:25,837 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 4 states. [2018-01-25 05:20:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:25,870 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-25 05:20:25,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:20:25,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-25 05:20:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:25,871 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:20:25,871 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 05:20:25,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:20:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 05:20:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-01-25 05:20:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:20:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-25 05:20:25,879 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 24 [2018-01-25 05:20:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:25,879 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-25 05:20:25,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:20:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-25 05:20:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:20:25,880 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:25,881 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:25,881 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2040947294, now seen corresponding path program 1 times [2018-01-25 05:20:25,881 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:25,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:25,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:25,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:25,883 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:25,893 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:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:26,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:26,132 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:26,132 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 05:20:26,133 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [13], [19], [23], [26], [28], [33], [35], [39], [43], [47], [52], [56], [58], [60], [63], [77], [86], [87], [88] [2018-01-25 05:20:26,134 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:20:26,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:20:29,729 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:20:29,729 INFO L268 AbstractInterpreter]: Visited 24 different actions 77 times. Merged at 14 different actions 51 times. Widened at 2 different actions 2 times. Found 4 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-25 05:20:29,733 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:20:29,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:29,733 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:20:29,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:29,738 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:29,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:20:29,788 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:20:29,853 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:20:29,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2018-01-25 05:20:29,854 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:29,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:20:29,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:20:29,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:20:29,854 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-25 05:20:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:29,903 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-25 05:20:29,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:20:29,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-25 05:20:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:29,904 INFO L225 Difference]: With dead ends: 91 [2018-01-25 05:20:29,905 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 05:20:29,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:20:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 05:20:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-25 05:20:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 05:20:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-25 05:20:29,914 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-25 05:20:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:29,915 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-25 05:20:29,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:20:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-25 05:20:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:20:29,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:29,916 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:29,917 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2035165284, now seen corresponding path program 1 times [2018-01-25 05:20:29,917 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:29,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:29,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:29,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:29,918 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:29,929 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:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:30,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:30,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:30,179 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 05:20:30,180 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [19], [23], [26], [28], [33], [35], [39], [43], [47], [52], [56], [58], [60], [63], [77], [86], [87], [88] [2018-01-25 05:20:30,181 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:20:30,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:20:32,480 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:20:32,480 INFO L268 AbstractInterpreter]: Visited 24 different actions 77 times. Merged at 14 different actions 51 times. Widened at 2 different actions 2 times. Found 4 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-25 05:20:32,481 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:20:32,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:32,481 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:20:32,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:32,486 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:32,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:32,548 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:32,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:32,602 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:20:32,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:32,605 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:20:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:32,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:32,630 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:32,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:20:32,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 7, 7] total 17 [2018-01-25 05:20:32,656 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:20:32,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:20:32,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:20:32,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:20:32,657 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 15 states. [2018-01-25 05:20:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:32,979 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-25 05:20:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:20:32,979 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-25 05:20:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:32,980 INFO L225 Difference]: With dead ends: 112 [2018-01-25 05:20:32,980 INFO L226 Difference]: Without dead ends: 94 [2018-01-25 05:20:32,981 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:20:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-25 05:20:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2018-01-25 05:20:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:20:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-01-25 05:20:32,990 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2018-01-25 05:20:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:32,990 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-01-25 05:20:32,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:20:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-01-25 05:20:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:20:32,992 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:32,992 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:32,992 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1450783205, now seen corresponding path program 1 times [2018-01-25 05:20:32,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:32,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:32,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:32,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:32,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:33,009 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:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 05:20:33,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:20:33,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:20:33,062 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:20:33,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:20:33,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:20:33,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:20:33,063 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2018-01-25 05:20:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:33,106 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-25 05:20:33,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:20:33,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-25 05:20:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:33,109 INFO L225 Difference]: With dead ends: 73 [2018-01-25 05:20:33,110 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 05:20:33,110 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:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 05:20:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 05:20:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 05:20:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-25 05:20:33,120 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2018-01-25 05:20:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:33,120 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-25 05:20:33,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:20:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-25 05:20:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:20:33,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:20:33,122 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:20:33,122 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:20:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash 262979632, now seen corresponding path program 2 times [2018-01-25 05:20:33,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:20:33,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:33,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:20:33,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:20:33,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:20:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:20:33,133 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:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 05:20:33,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:33,245 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:20:33,245 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:20:33,245 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:20:33,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:33,245 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:20:33,253 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:20:33,254 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:20:33,263 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:20:33,268 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:20:33,269 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:20:33,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:33,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:33,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 05:20:33,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:33,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-25 05:20:33,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:33,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:20:33,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-25 05:20:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:33,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:20:33,586 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:20:33,592 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:20:33,592 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:20:33,602 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:20:33,612 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:20:33,620 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:20:33,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:20:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:33,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:20:33,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-25 05:20:33,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:33,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 05:20:33,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:20:33,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:20:33,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-25 05:20:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:20:33,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:20:33,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 8, 8] total 28 [2018-01-25 05:20:33,823 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:20:33,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 05:20:33,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 05:20:33,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:20:33,825 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 15 states. [2018-01-25 05:20:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:20:34,106 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-01-25 05:20:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:20:34,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-25 05:20:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:20:34,107 INFO L225 Difference]: With dead ends: 58 [2018-01-25 05:20:34,107 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:20:34,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2018-01-25 05:20:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:20:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:20:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:20:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:20:34,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-01-25 05:20:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:20:34,109 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:20:34,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 05:20:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:20:34,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:20:34,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:20:34,384 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 60 DAG size of output 38 [2018-01-25 05:20:34,673 WARN L146 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 68 DAG size of output 44 [2018-01-25 05:20:34,899 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 68 DAG size of output 46 [2018-01-25 05:20:34,902 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,902 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:20:34,902 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,902 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-25 05:20:34,902 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,902 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-25 05:20:34,902 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point mainErr8EnsuresViolation(lines 540 560) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 553) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L397 ceAbstractionStarter]: At program point L555'''(lines 555 557) the Hoare annotation is: (let ((.cse9 (* 4 main_~j~2)) (.cse14 (* 4 main_~length~2)) (.cse15 (+ (* 4 main_~i~2) main_~arr~2.offset)) (.cse10 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (<= .cse15 .cse10)) (.cse3 (<= (+ main_~arr~2.offset .cse14) .cse10)) (.cse4 (= .cse14 .cse10)) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| main_~arr~2.base))) (.cse8 (+ main_~arr~2.offset .cse9)) (.cse11 (<= 4 .cse15)) (.cse12 (= 0 |main_#t~malloc1.offset|)) (.cse13 (= .cse14 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 .cse8) (<= 0 main_~arr~2.offset) (<= (+ main_~arr~2.offset .cse9 4) .cse10) .cse11 .cse12 .cse13) (and .cse0 .cse1 (= main_~j~2 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 .cse8) .cse11 .cse12 .cse13)))) [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 558) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-25 05:20:34,903 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 540 560) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 540 560) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 540 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L397 ceAbstractionStarter]: At program point L554'''(lines 554 558) the Hoare annotation is: (let ((.cse12 (* 4 main_~length~2)) (.cse13 (+ (* 4 main_~i~2) main_~arr~2.offset)) (.cse14 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse2 (<= .cse13 .cse14)) (.cse3 (<= (+ main_~arr~2.offset .cse12) .cse14)) (.cse4 (= .cse12 .cse14)) (.cse5 (not (= 0 |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| main_~arr~2.base))) (.cse8 (+ main_~arr~2.offset (* 4 main_~j~2))) (.cse9 (<= 4 .cse13)) (.cse10 (= 0 |main_#t~malloc1.offset|)) (.cse11 (= .cse12 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 (= main_~j~2 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 .cse8) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 4 .cse8) (<= 0 main_~arr~2.offset) .cse9 .cse10 .cse11)))) [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L397 ceAbstractionStarter]: At program point L547''(lines 547 553) the Hoare annotation is: (let ((.cse11 (* 4 main_~length~2)) (.cse4 (select |#length| main_~arr~2.base))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= main_~arr~2.offset 0)) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse5 (= .cse11 .cse4)) (.cse6 (not (= 0 |main_#t~malloc1.base|))) (.cse7 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse8 (= 1 (select |#valid| main_~arr~2.base))) (.cse9 (= 0 |main_#t~malloc1.offset|)) (.cse10 (= .cse11 (select |#length| |main_#t~malloc1.base|)))) (or (let ((.cse3 (+ (* 4 main_~i~2) main_~arr~2.offset))) (and .cse0 .cse1 .cse2 (<= .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 (<= 4 .cse3) .cse9 .cse10)) (and .cse0 .cse1 .cse2 (<= 1 main_~length~2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= main_~i~2 0))))) [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-25 05:20:34,904 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L547'''(lines 547 553) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L554''''(lines 554 558) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-25 05:20:34,905 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 05:20:34,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,925 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,925 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,925 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,930 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,930 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,930 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,933 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,934 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,939 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,940 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:20:34 BoogieIcfgContainer [2018-01-25 05:20:34,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:20:34,943 INFO L168 Benchmark]: Toolchain (without parser) took 13886.50 ms. Allocated memory was 302.0 MB in the beginning and 965.2 MB in the end (delta: 663.2 MB). Free memory was 259.9 MB in the beginning and 634.6 MB in the end (delta: -374.7 MB). Peak memory consumption was 288.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:34,943 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 302.0 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:20:34,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.07 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 248.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:34,944 INFO L168 Benchmark]: Boogie Preprocessor took 36.55 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 247.8 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-25 05:20:34,944 INFO L168 Benchmark]: RCFGBuilder took 262.70 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 230.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:34,945 INFO L168 Benchmark]: TraceAbstraction took 13372.54 ms. Allocated memory was 302.0 MB in the beginning and 965.2 MB in the end (delta: 663.2 MB). Free memory was 229.8 MB in the beginning and 634.6 MB in the end (delta: -404.8 MB). Peak memory consumption was 258.4 MB. Max. memory is 5.3 GB. [2018-01-25 05:20:34,946 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 302.0 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.07 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 248.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 36.55 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 247.8 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 262.70 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 230.8 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13372.54 ms. Allocated memory was 302.0 MB in the beginning and 965.2 MB in the end (delta: 663.2 MB). Free memory was 229.8 MB in the beginning and 634.6 MB in the end (delta: -404.8 MB). Peak memory consumption was 258.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 121 LocStat_NO_SUPPORTING_DISEQUALITIES : 16 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 20 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 32 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.939790 RENAME_VARIABLES(MILLISECONDS) : 3.050570 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.866498 PROJECTAWAY(MILLISECONDS) : 9.063869 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.182197 DISJOIN(MILLISECONDS) : 1.200128 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.109390 ADD_EQUALITY(MILLISECONDS) : 0.054279 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009550 #CONJOIN_DISJUNCTIVE : 43 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 70 #PROJECTAWAY : 59 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 69 #ADD_EQUALITY : 32 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 138 LocStat_NO_SUPPORTING_DISEQUALITIES : 16 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 20 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 33 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 22 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 8.319559 RENAME_VARIABLES(MILLISECONDS) : 3.147708 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 8.240731 PROJECTAWAY(MILLISECONDS) : 9.320509 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.149600 DISJOIN(MILLISECONDS) : 1.274024 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.207471 ADD_EQUALITY(MILLISECONDS) : 0.046182 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009219 #CONJOIN_DISJUNCTIVE : 43 #RENAME_VARIABLES : 73 #UNFREEZE : 0 #CONJOIN : 70 #PROJECTAWAY : 59 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 69 #ADD_EQUALITY : 33 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 221 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.163142 RENAME_VARIABLES(MILLISECONDS) : 1.454360 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.111299 PROJECTAWAY(MILLISECONDS) : 2.307387 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.077437 DISJOIN(MILLISECONDS) : 0.596018 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.487928 ADD_EQUALITY(MILLISECONDS) : 0.025256 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007528 #CONJOIN_DISJUNCTIVE : 142 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 181 #PROJECTAWAY : 175 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 44 #RENAME_VARIABLES_DISJUNCTIVE : 265 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 30 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 39 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.649001 RENAME_VARIABLES(MILLISECONDS) : 1.481781 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.610184 PROJECTAWAY(MILLISECONDS) : 2.193119 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.058248 DISJOIN(MILLISECONDS) : 0.629589 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.510143 ADD_EQUALITY(MILLISECONDS) : 0.024820 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004454 #CONJOIN_DISJUNCTIVE : 142 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 181 #PROJECTAWAY : 175 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 44 #RENAME_VARIABLES_DISJUNCTIVE : 265 #ADD_EQUALITY : 39 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * 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 - 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: 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: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-25 05:20:34,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,956 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,957 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,959 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,959 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,959 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,960 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,960 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 1 <= length) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) && i == 0) - InvariantResult [Line: 554]: Loop Invariant [2018-01-25 05:20:34,962 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,962 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 <= arr + 4 * j) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= arr + 4 * j) && 0 <= arr) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 555]: Loop Invariant [2018-01-25 05:20:34,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,971 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,972 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,974 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:20:34,975 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 4 <= arr + 4 * j) && 0 <= arr) && arr + 4 * j + 4 <= unknown-#length-unknown[arr]) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((!(0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * i + arr <= unknown-#length-unknown[arr]) && arr + 4 * length <= unknown-#length-unknown[arr]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 0 <= arr + 4 * j) && 4 <= 4 * i + arr) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 9 error locations. SAFE Result, 13.2s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 310 SDtfs, 1119 SDslu, 622 SDs, 0 SdLazy, 600 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 368 SyntacticMatches, 20 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 441 HoareAnnotationTreeSize, 7 FomulaSimplifications, 648 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 935 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 631 ConstructedInterpolants, 56 QuantifiedInterpolants, 120997 SizeOfPredicates, 30 NumberOfNonLiveVariables, 642 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 83/153 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/count_down-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-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-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-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-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-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-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-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-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-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-20-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-20-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-20-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-20-34-982.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-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-34-982.csv Received shutdown request...