java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label21.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 20:32:08,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 20:32:08,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 20:32:08,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 20:32:08,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 20:32:08,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 20:32:08,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 20:32:08,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 20:32:08,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 20:32:08,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 20:32:08,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 20:32:08,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 20:32:08,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 20:32:08,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 20:32:08,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 20:32:08,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 20:32:08,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 20:32:08,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 20:32:08,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 20:32:08,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 20:32:08,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 20:32:08,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 20:32:08,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 20:32:08,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 20:32:08,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 20:32:08,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 20:32:08,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 20:32:08,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 20:32:08,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 20:32:08,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 20:32:08,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 20:32:08,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 20:32:08,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 20:32:08,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 20:32:08,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 20:32:08,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 20:32:08,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 20:32:08,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 20:32:08,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 20:32:08,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 20:32:08,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 20:32:08,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 20:32:08,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 20:32:08,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 20:32:08,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 20:32:08,151 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 20:32:08,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 20:32:08,151 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 20:32:08,152 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 20:32:08,152 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 20:32:08,152 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 20:32:08,152 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 20:32:08,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 20:32:08,155 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 20:32:08,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 20:32:08,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 20:32:08,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 20:32:08,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 20:32:08,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 20:32:08,156 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 20:32:08,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 20:32:08,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 20:32:08,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 20:32:08,157 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 20:32:08,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 20:32:08,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:32:08,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 20:32:08,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 20:32:08,158 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 20:32:08,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 20:32:08,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 20:32:08,158 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 20:32:08,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 20:32:08,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 20:32:08,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 20:32:08,221 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 20:32:08,222 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 20:32:08,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label21.c [2019-10-02 20:32:08,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26bf4cec/d0b38c2e3c194d128c139bd41bfd95d4/FLAG4d0b54f2b [2019-10-02 20:32:08,905 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 20:32:08,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label21.c [2019-10-02 20:32:08,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26bf4cec/d0b38c2e3c194d128c139bd41bfd95d4/FLAG4d0b54f2b [2019-10-02 20:32:09,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26bf4cec/d0b38c2e3c194d128c139bd41bfd95d4 [2019-10-02 20:32:09,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 20:32:09,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 20:32:09,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 20:32:09,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 20:32:09,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 20:32:09,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:09,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a34d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09, skipping insertion in model container [2019-10-02 20:32:09,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:09,146 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 20:32:09,214 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 20:32:09,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:32:09,776 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 20:32:09,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:32:09,925 INFO L192 MainTranslator]: Completed translation [2019-10-02 20:32:09,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09 WrapperNode [2019-10-02 20:32:09,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 20:32:09,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 20:32:09,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 20:32:09,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 20:32:09,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:09,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:09,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:09,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:10,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:10,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:10,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... [2019-10-02 20:32:10,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 20:32:10,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 20:32:10,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 20:32:10,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 20:32:10,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-02 20:32:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 20:32:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 20:32:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 20:32:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 20:32:10,150 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 20:32:10,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 20:32:10,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 20:32:10,151 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 20:32:10,151 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 20:32:10,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 20:32:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 20:32:11,734 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 20:32:11,734 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 20:32:11,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:32:11 BoogieIcfgContainer [2019-10-02 20:32:11,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 20:32:11,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 20:32:11,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 20:32:11,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 20:32:11,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:32:09" (1/3) ... [2019-10-02 20:32:11,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2480cc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:32:11, skipping insertion in model container [2019-10-02 20:32:11,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:32:09" (2/3) ... [2019-10-02 20:32:11,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2480cc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:32:11, skipping insertion in model container [2019-10-02 20:32:11,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:32:11" (3/3) ... [2019-10-02 20:32:11,745 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label21.c [2019-10-02 20:32:11,755 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 20:32:11,766 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 20:32:11,783 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 20:32:11,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 20:32:11,822 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 20:32:11,823 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 20:32:11,823 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 20:32:11,823 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 20:32:11,823 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 20:32:11,823 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 20:32:11,824 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 20:32:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 20:32:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 20:32:11,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:32:11,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:32:11,871 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:32:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:32:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash -736368013, now seen corresponding path program 1 times [2019-10-02 20:32:11,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:32:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:11,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:32:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:11,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:32:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:32:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:32:12,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:32:12,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:32:12,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:32:12,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:32:12,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:32:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:32:12,246 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 20:32:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:32:13,828 INFO L93 Difference]: Finished difference Result 440 states and 713 transitions. [2019-10-02 20:32:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:32:13,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-02 20:32:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:32:13,867 INFO L225 Difference]: With dead ends: 440 [2019-10-02 20:32:13,867 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 20:32:13,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:32:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 20:32:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 20:32:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 20:32:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 596 transitions. [2019-10-02 20:32:13,969 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 596 transitions. Word has length 40 [2019-10-02 20:32:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:32:13,970 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 596 transitions. [2019-10-02 20:32:13,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:32:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 596 transitions. [2019-10-02 20:32:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 20:32:13,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:32:13,976 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:32:13,977 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:32:13,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:32:13,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1744454378, now seen corresponding path program 1 times [2019-10-02 20:32:13,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:32:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:13,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:32:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:13,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:32:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:32:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:32:14,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:32:14,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 20:32:14,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:32:14,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 20:32:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 20:32:14,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 20:32:14,222 INFO L87 Difference]: Start difference. First operand 372 states and 596 transitions. Second operand 5 states. [2019-10-02 20:32:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:32:15,536 INFO L93 Difference]: Finished difference Result 574 states and 848 transitions. [2019-10-02 20:32:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 20:32:15,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-02 20:32:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:32:15,546 INFO L225 Difference]: With dead ends: 574 [2019-10-02 20:32:15,547 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 20:32:15,550 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 20:32:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 20:32:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 564. [2019-10-02 20:32:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 20:32:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 831 transitions. [2019-10-02 20:32:15,616 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 831 transitions. Word has length 116 [2019-10-02 20:32:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:32:15,617 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 831 transitions. [2019-10-02 20:32:15,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 20:32:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 831 transitions. [2019-10-02 20:32:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 20:32:15,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:32:15,622 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:32:15,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:32:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:32:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1787764330, now seen corresponding path program 1 times [2019-10-02 20:32:15,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:32:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:15,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:32:15,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:15,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:32:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:32:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:32:15,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:32:15,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:32:15,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:32:15,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:32:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:32:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:32:15,885 INFO L87 Difference]: Start difference. First operand 564 states and 831 transitions. Second operand 6 states. [2019-10-02 20:32:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:32:17,436 INFO L93 Difference]: Finished difference Result 968 states and 1421 transitions. [2019-10-02 20:32:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:32:17,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-10-02 20:32:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:32:17,444 INFO L225 Difference]: With dead ends: 968 [2019-10-02 20:32:17,444 INFO L226 Difference]: Without dead ends: 968 [2019-10-02 20:32:17,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 20:32:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-02 20:32:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 942. [2019-10-02 20:32:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-10-02 20:32:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1352 transitions. [2019-10-02 20:32:17,489 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1352 transitions. Word has length 180 [2019-10-02 20:32:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:32:17,490 INFO L475 AbstractCegarLoop]: Abstraction has 942 states and 1352 transitions. [2019-10-02 20:32:17,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:32:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1352 transitions. [2019-10-02 20:32:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 20:32:17,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:32:17,495 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:32:17,496 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:32:17,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:32:17,496 INFO L82 PathProgramCache]: Analyzing trace with hash 122382904, now seen corresponding path program 1 times [2019-10-02 20:32:17,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:32:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:17,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:32:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:32:17,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:32:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:32:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:32:17,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:32:17,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:32:17,682 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2019-10-02 20:32:17,683 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:32:17,723 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:32:17,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:32:22,034 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:32:22,036 INFO L272 AbstractInterpreter]: Visited 88 different actions 88 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 13. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 20:32:22,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:32:22,040 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:32:26,126 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 77.99% of their original sizes. [2019-10-02 20:32:26,126 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:32:26,209 INFO L420 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2019-10-02 20:32:26,209 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:32:26,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:32:26,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-02 20:32:26,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:32:26,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:32:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:32:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:32:26,212 INFO L87 Difference]: Start difference. First operand 942 states and 1352 transitions. Second operand 10 states. [2019-10-02 20:33:46,862 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:36:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:36:28,183 INFO L93 Difference]: Finished difference Result 1128 states and 1547 transitions. [2019-10-02 20:36:28,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 20:36:28,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2019-10-02 20:36:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:36:28,190 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 20:36:28,191 INFO L226 Difference]: Without dead ends: 1128 [2019-10-02 20:36:28,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-02 20:36:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-10-02 20:36:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1124. [2019-10-02 20:36:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-02 20:36:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1541 transitions. [2019-10-02 20:36:28,221 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1541 transitions. Word has length 199 [2019-10-02 20:36:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:36:28,222 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1541 transitions. [2019-10-02 20:36:28,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:36:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1541 transitions. [2019-10-02 20:36:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 20:36:28,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:36:28,227 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:36:28,228 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:36:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:36:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash 814508401, now seen corresponding path program 1 times [2019-10-02 20:36:28,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:36:28,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:36:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:36:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:36:28,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:36:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:36:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 184 proven. 146 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:36:29,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:36:29,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:36:29,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2019-10-02 20:36:29,037 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:36:29,047 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:36:29,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:36:32,237 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:36:32,239 INFO L272 AbstractInterpreter]: Visited 93 different actions 181 times. Merged at 4 different actions 5 times. Never widened. Performed 400 root evaluator evaluations with a maximum evaluation depth of 13. Performed 400 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:36:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:36:32,239 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:36:34,588 INFO L227 lantSequenceWeakener]: Weakened 280 states. On average, predicates are now at 77.65% of their original sizes. [2019-10-02 20:36:34,588 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:36:34,663 INFO L420 sIntCurrentIteration]: We unified 282 AI predicates to 282 [2019-10-02 20:36:34,664 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:36:34,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:36:34,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 20:36:34,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:36:34,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:36:34,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:36:34,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:36:34,666 INFO L87 Difference]: Start difference. First operand 1124 states and 1541 transitions. Second operand 11 states. [2019-10-02 20:37:08,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:37:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:37:35,400 INFO L93 Difference]: Finished difference Result 1340 states and 1768 transitions. [2019-10-02 20:37:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 20:37:35,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 283 [2019-10-02 20:37:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:37:35,408 INFO L225 Difference]: With dead ends: 1340 [2019-10-02 20:37:35,408 INFO L226 Difference]: Without dead ends: 1340 [2019-10-02 20:37:35,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:37:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-10-02 20:37:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1124. [2019-10-02 20:37:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-02 20:37:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1541 transitions. [2019-10-02 20:37:35,445 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1541 transitions. Word has length 283 [2019-10-02 20:37:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:37:35,446 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1541 transitions. [2019-10-02 20:37:35,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:37:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1541 transitions. [2019-10-02 20:37:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 20:37:35,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:37:35,452 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:37:35,452 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:37:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:37:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash 549068485, now seen corresponding path program 1 times [2019-10-02 20:37:35,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:37:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:37:35,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:37:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:37:35,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:37:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:37:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 156 proven. 125 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 20:37:35,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:37:35,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:37:35,949 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2019-10-02 20:37:35,954 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:37:35,970 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:37:35,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:37:50,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:37:50,508 INFO L272 AbstractInterpreter]: Visited 119 different actions 233 times. Merged at 4 different actions 5 times. Never widened. Performed 557 root evaluator evaluations with a maximum evaluation depth of 13. Performed 557 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:37:50,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:37:50,508 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:37:58,488 INFO L227 lantSequenceWeakener]: Weakened 306 states. On average, predicates are now at 77.62% of their original sizes. [2019-10-02 20:37:58,489 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:37:58,567 INFO L420 sIntCurrentIteration]: We unified 308 AI predicates to 308 [2019-10-02 20:37:58,568 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:37:58,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:37:58,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-10-02 20:37:58,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:37:58,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:37:58,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:37:58,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:37:58,569 INFO L87 Difference]: Start difference. First operand 1124 states and 1541 transitions. Second operand 11 states. [2019-10-02 20:38:40,484 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:39:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:39:51,523 INFO L93 Difference]: Finished difference Result 1492 states and 1931 transitions. [2019-10-02 20:39:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 20:39:51,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 309 [2019-10-02 20:39:51,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:39:51,530 INFO L225 Difference]: With dead ends: 1492 [2019-10-02 20:39:51,530 INFO L226 Difference]: Without dead ends: 1492 [2019-10-02 20:39:51,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-02 20:39:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-10-02 20:39:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1490. [2019-10-02 20:39:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-10-02 20:39:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1929 transitions. [2019-10-02 20:39:51,566 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1929 transitions. Word has length 309 [2019-10-02 20:39:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:39:51,567 INFO L475 AbstractCegarLoop]: Abstraction has 1490 states and 1929 transitions. [2019-10-02 20:39:51,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:39:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1929 transitions. [2019-10-02 20:39:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-02 20:39:51,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:39:51,573 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:39:51,573 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:39:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:39:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1127436145, now seen corresponding path program 1 times [2019-10-02 20:39:51,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:39:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:39:51,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:39:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:39:51,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:39:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:39:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 252 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 20:39:51,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:39:51,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:39:51,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2019-10-02 20:39:51,883 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:39:51,888 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:39:51,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:40:05,705 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:40:22,655 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:40:22,656 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 6 different actions 19 times. Never widened. Performed 866 root evaluator evaluations with a maximum evaluation depth of 22. Performed 866 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:40:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:40:22,656 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:40:30,193 INFO L227 lantSequenceWeakener]: Weakened 332 states. On average, predicates are now at 77.59% of their original sizes. [2019-10-02 20:40:30,194 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:40:30,270 INFO L420 sIntCurrentIteration]: We unified 334 AI predicates to 334 [2019-10-02 20:40:30,270 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:40:30,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:40:30,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-10-02 20:40:30,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:40:30,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:40:30,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:40:30,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:40:30,272 INFO L87 Difference]: Start difference. First operand 1490 states and 1929 transitions. Second operand 10 states. [2019-10-02 20:42:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:42:26,118 INFO L93 Difference]: Finished difference Result 1683 states and 2160 transitions. [2019-10-02 20:42:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 20:42:26,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 335 [2019-10-02 20:42:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:42:26,127 INFO L225 Difference]: With dead ends: 1683 [2019-10-02 20:42:26,127 INFO L226 Difference]: Without dead ends: 1683 [2019-10-02 20:42:26,127 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:42:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-10-02 20:42:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1676. [2019-10-02 20:42:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-10-02 20:42:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2153 transitions. [2019-10-02 20:42:26,166 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2153 transitions. Word has length 335 [2019-10-02 20:42:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:42:26,166 INFO L475 AbstractCegarLoop]: Abstraction has 1676 states and 2153 transitions. [2019-10-02 20:42:26,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:42:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2153 transitions. [2019-10-02 20:42:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-02 20:42:26,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:42:26,183 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:42:26,183 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:42:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:42:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash -500229570, now seen corresponding path program 1 times [2019-10-02 20:42:26,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:42:26,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:42:26,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:42:26,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:42:26,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:42:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:42:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 222 proven. 157 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-02 20:42:26,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:42:26,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:42:26,484 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 394 with the following transitions: [2019-10-02 20:42:26,484 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:42:26,486 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:42:26,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:42:46,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:42:46,043 INFO L272 AbstractInterpreter]: Visited 121 different actions 473 times. Merged at 6 different actions 22 times. Never widened. Performed 848 root evaluator evaluations with a maximum evaluation depth of 13. Performed 848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:42:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:42:46,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:42:46,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:42:46,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-10-02 20:42:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:42:46,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:42:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:42:46,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:42:46,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:42:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 464 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 20:42:46,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:42:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 222 proven. 157 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 20:42:46,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-02 20:42:46,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2019-10-02 20:42:46,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-02 20:42:46,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 20:42:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 20:42:46,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:42:46,620 INFO L87 Difference]: Start difference. First operand 1676 states and 2153 transitions. Second operand 9 states. [2019-10-02 20:42:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:42:50,658 INFO L93 Difference]: Finished difference Result 3016 states and 3578 transitions. [2019-10-02 20:42:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 20:42:50,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 393 [2019-10-02 20:42:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:42:50,674 INFO L225 Difference]: With dead ends: 3016 [2019-10-02 20:42:50,675 INFO L226 Difference]: Without dead ends: 2832 [2019-10-02 20:42:50,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 802 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-10-02 20:42:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2019-10-02 20:42:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2640. [2019-10-02 20:42:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2019-10-02 20:42:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3120 transitions. [2019-10-02 20:42:50,736 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3120 transitions. Word has length 393 [2019-10-02 20:42:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:42:50,736 INFO L475 AbstractCegarLoop]: Abstraction has 2640 states and 3120 transitions. [2019-10-02 20:42:50,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 20:42:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3120 transitions. [2019-10-02 20:42:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-10-02 20:42:50,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:42:50,747 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:42:50,747 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:42:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:42:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1174705073, now seen corresponding path program 1 times [2019-10-02 20:42:50,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:42:50,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:42:50,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:42:50,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:42:50,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:42:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:42:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 222 proven. 166 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-02 20:42:51,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:42:51,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:42:51,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 441 with the following transitions: [2019-10-02 20:42:51,024 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:42:51,026 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:42:51,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:43:06,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:43:06,335 INFO L272 AbstractInterpreter]: Visited 123 different actions 364 times. Merged at 6 different actions 17 times. Never widened. Performed 661 root evaluator evaluations with a maximum evaluation depth of 13. Performed 661 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2019-10-02 20:43:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:43:06,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:43:06,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:43:06,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-10-02 20:43:06,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:43:06,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:43:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:43:06,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:43:06,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:43:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 518 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-02 20:43:06,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:43:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 222 proven. 166 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-10-02 20:43:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-02 20:43:06,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2019-10-02 20:43:06,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-02 20:43:06,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 20:43:06,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 20:43:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:43:06,775 INFO L87 Difference]: Start difference. First operand 2640 states and 3120 transitions. Second operand 9 states. [2019-10-02 20:43:08,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:43:08,924 INFO L93 Difference]: Finished difference Result 3956 states and 4650 transitions. [2019-10-02 20:43:08,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 20:43:08,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 440 [2019-10-02 20:43:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:43:08,941 INFO L225 Difference]: With dead ends: 3956 [2019-10-02 20:43:08,942 INFO L226 Difference]: Without dead ends: 3956 [2019-10-02 20:43:08,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 881 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-10-02 20:43:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2019-10-02 20:43:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3580. [2019-10-02 20:43:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-10-02 20:43:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4155 transitions. [2019-10-02 20:43:09,025 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4155 transitions. Word has length 440 [2019-10-02 20:43:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:43:09,026 INFO L475 AbstractCegarLoop]: Abstraction has 3580 states and 4155 transitions. [2019-10-02 20:43:09,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 20:43:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4155 transitions. [2019-10-02 20:43:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-10-02 20:43:09,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:43:09,033 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:43:09,033 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:43:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:43:09,034 INFO L82 PathProgramCache]: Analyzing trace with hash -455675864, now seen corresponding path program 1 times [2019-10-02 20:43:09,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:43:09,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:43:09,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:43:09,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:43:09,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:43:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:43:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 238 proven. 449 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:43:09,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:43:09,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:43:09,884 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 444 with the following transitions: [2019-10-02 20:43:09,885 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:43:09,887 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:43:09,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:43:28,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:43:28,651 INFO L272 AbstractInterpreter]: Visited 123 different actions 359 times. Merged at 6 different actions 12 times. Never widened. Performed 724 root evaluator evaluations with a maximum evaluation depth of 13. Performed 724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:43:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:43:28,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:43:28,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:43:28,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 20:43:28,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:43:28,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:43:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:43:28,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:43:28,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:43:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-10-02 20:43:28,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:43:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-10-02 20:43:29,050 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:43:29,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [16] total 18 [2019-10-02 20:43:29,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:43:29,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:43:29,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:43:29,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:43:29,052 INFO L87 Difference]: Start difference. First operand 3580 states and 4155 transitions. Second operand 3 states. [2019-10-02 20:43:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:43:29,835 INFO L93 Difference]: Finished difference Result 4680 states and 5355 transitions. [2019-10-02 20:43:29,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:43:29,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 443 [2019-10-02 20:43:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:43:29,857 INFO L225 Difference]: With dead ends: 4680 [2019-10-02 20:43:29,857 INFO L226 Difference]: Without dead ends: 4680 [2019-10-02 20:43:29,857 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 885 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:43:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-10-02 20:43:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 3758. [2019-10-02 20:43:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3758 states. [2019-10-02 20:43:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 4287 transitions. [2019-10-02 20:43:29,932 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 4287 transitions. Word has length 443 [2019-10-02 20:43:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:43:29,933 INFO L475 AbstractCegarLoop]: Abstraction has 3758 states and 4287 transitions. [2019-10-02 20:43:29,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:43:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 4287 transitions. [2019-10-02 20:43:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-10-02 20:43:29,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:43:29,940 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:43:29,940 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:43:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:43:29,941 INFO L82 PathProgramCache]: Analyzing trace with hash -401591373, now seen corresponding path program 1 times [2019-10-02 20:43:29,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:43:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:43:29,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:43:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:43:29,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:43:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:43:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 238 proven. 471 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:43:30,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:43:30,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:43:30,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 455 with the following transitions: [2019-10-02 20:43:30,687 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [638], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:43:30,690 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:43:30,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:43:49,467 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:43:49,467 INFO L272 AbstractInterpreter]: Visited 123 different actions 359 times. Merged at 6 different actions 12 times. Never widened. Performed 724 root evaluator evaluations with a maximum evaluation depth of 13. Performed 724 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:43:49,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:43:49,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:43:49,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:43:49,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-10-02 20:43:49,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:43:49,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:43:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:43:49,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 20:43:49,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:43:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-10-02 20:43:49,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:43:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-10-02 20:43:49,862 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:43:49,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [16] total 17 [2019-10-02 20:43:49,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:43:49,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:43:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:43:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-02 20:43:49,863 INFO L87 Difference]: Start difference. First operand 3758 states and 4287 transitions. Second operand 3 states. [2019-10-02 20:43:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:43:50,575 INFO L93 Difference]: Finished difference Result 4498 states and 5119 transitions. [2019-10-02 20:43:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:43:50,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 454 [2019-10-02 20:43:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:43:50,577 INFO L225 Difference]: With dead ends: 4498 [2019-10-02 20:43:50,577 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 20:43:50,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 907 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-10-02 20:43:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 20:43:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 20:43:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 20:43:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 20:43:50,578 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 454 [2019-10-02 20:43:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:43:50,579 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 20:43:50,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:43:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 20:43:50,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 20:43:50,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 08:43:50 BoogieIcfgContainer [2019-10-02 20:43:50,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 20:43:50,585 INFO L168 Benchmark]: Toolchain (without parser) took 701455.54 ms. Allocated memory was 133.7 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 86.4 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-02 20:43:50,586 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 106.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 20:43:50,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.76 ms. Allocated memory was 133.7 MB in the beginning and 202.9 MB in the end (delta: 69.2 MB). Free memory was 86.0 MB in the beginning and 157.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-10-02 20:43:50,588 INFO L168 Benchmark]: Boogie Preprocessor took 123.28 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 151.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-10-02 20:43:50,589 INFO L168 Benchmark]: RCFGBuilder took 1685.53 ms. Allocated memory was 202.9 MB in the beginning and 229.1 MB in the end (delta: 26.2 MB). Free memory was 151.8 MB in the beginning and 146.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. [2019-10-02 20:43:50,589 INFO L168 Benchmark]: TraceAbstraction took 698846.28 ms. Allocated memory was 229.1 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 146.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-02 20:43:50,593 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 106.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.76 ms. Allocated memory was 133.7 MB in the beginning and 202.9 MB in the end (delta: 69.2 MB). Free memory was 86.0 MB in the beginning and 157.5 MB in the end (delta: -71.5 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.28 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 151.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1685.53 ms. Allocated memory was 202.9 MB in the beginning and 229.1 MB in the end (delta: 26.2 MB). Free memory was 151.8 MB in the beginning and 146.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 698846.28 ms. Allocated memory was 229.1 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 146.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 106]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 698.7s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 543.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 913 SDtfs, 6279 SDslu, 462 SDs, 0 SdLazy, 11615 SolverSat, 2293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 530.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4731 GetRequests, 4570 SyntacticMatches, 11 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3758occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 125.3s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9968208339749844 AbsIntWeakeningRatio, 0.10873440285204991 AbsIntAvgWeakeningVarsNumRemoved, 8.258467023172905 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1755 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 4922 NumberOfCodeBlocks, 4922 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6633 ConstructedInterpolants, 0 QuantifiedInterpolants, 9036392 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2759 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 7479/9324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...