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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:46:13,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:46:13,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:46:13,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:46:13,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:46:13,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:46:13,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:46:13,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:46:13,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:46:13,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:46:13,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:46:13,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:46:13,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:46:13,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:46:13,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:46:13,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:46:13,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:46:13,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:46:13,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:46:13,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:46:13,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:46:13,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:46:13,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:46:13,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:46:13,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:46:13,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:46:13,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:46:13,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:46:13,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:46:13,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:46:13,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:46:13,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:46:13,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:46:13,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:46:13,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:46:13,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:46:13,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:46:13,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:46:13,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:46:13,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:46:13,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:46:13,091 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-09-10 06:46:13,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:46:13,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:46:13,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:46:13,117 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:46:13,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:46:13,118 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:46:13,118 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:46:13,118 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:46:13,119 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:46:13,119 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:46:13,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:46:13,120 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:46:13,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:46:13,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:46:13,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:46:13,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:46:13,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:46:13,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:46:13,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:46:13,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:46:13,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:46:13,122 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:46:13,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:46:13,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:46:13,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:46:13,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:46:13,123 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:46:13,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:46:13,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:46:13,124 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:46:13,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:46:13,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:46:13,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:46:13,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:46:13,179 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:46:13,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:46:13,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d770be/84df18991db64c29b07c77027f3743fd/FLAG2553e6a53 [2019-09-10 06:46:13,992 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:46:13,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:46:14,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d770be/84df18991db64c29b07c77027f3743fd/FLAG2553e6a53 [2019-09-10 06:46:14,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003d770be/84df18991db64c29b07c77027f3743fd [2019-09-10 06:46:14,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:46:14,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:46:14,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:46:14,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:46:14,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:46:14,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:46:14" (1/1) ... [2019-09-10 06:46:14,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22835673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:14, skipping insertion in model container [2019-09-10 06:46:14,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:46:14" (1/1) ... [2019-09-10 06:46:14,157 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:46:14,294 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:46:15,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:46:15,316 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:46:15,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:46:15,705 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:46:15,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15 WrapperNode [2019-09-10 06:46:15,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:46:15,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:46:15,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:46:15,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:46:15,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (1/1) ... [2019-09-10 06:46:15,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (1/1) ... [2019-09-10 06:46:15,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (1/1) ... [2019-09-10 06:46:15,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (1/1) ... [2019-09-10 06:46:15,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (1/1) ... [2019-09-10 06:46:15,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (1/1) ... [2019-09-10 06:46:15,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (1/1) ... [2019-09-10 06:46:15,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:46:15,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:46:15,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:46:15,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:46:15,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (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-09-10 06:46:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:46:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:46:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:46:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:46:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:46:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:46:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:46:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:46:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:46:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:46:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:46:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:46:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:46:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:46:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:46:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:46:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:46:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:46:19,629 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:46:19,629 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:46:19,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:46:19 BoogieIcfgContainer [2019-09-10 06:46:19,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:46:19,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:46:19,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:46:19,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:46:19,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:46:14" (1/3) ... [2019-09-10 06:46:19,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb17195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:46:19, skipping insertion in model container [2019-09-10 06:46:19,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:46:15" (2/3) ... [2019-09-10 06:46:19,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb17195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:46:19, skipping insertion in model container [2019-09-10 06:46:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:46:19" (3/3) ... [2019-09-10 06:46:19,641 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:46:19,651 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:46:19,661 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 06:46:19,684 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 06:46:19,719 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:46:19,719 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:46:19,719 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:46:19,719 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:46:19,720 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:46:19,720 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:46:19,720 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:46:19,720 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:46:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-09-10 06:46:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:46:19,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:19,793 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:19,796 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-09-10 06:46:19,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:19,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:19,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:19,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:20,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:20,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:20,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:20,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:20,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:20,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:20,531 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-09-10 06:46:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:22,675 INFO L93 Difference]: Finished difference Result 1606 states and 2695 transitions. [2019-09-10 06:46:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:22,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 06:46:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:22,706 INFO L225 Difference]: With dead ends: 1606 [2019-09-10 06:46:22,706 INFO L226 Difference]: Without dead ends: 1594 [2019-09-10 06:46:22,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:46:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-09-10 06:46:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2019-09-10 06:46:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-09-10 06:46:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2070 transitions. [2019-09-10 06:46:22,843 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2070 transitions. Word has length 56 [2019-09-10 06:46:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:22,844 INFO L475 AbstractCegarLoop]: Abstraction has 1588 states and 2070 transitions. [2019-09-10 06:46:22,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2070 transitions. [2019-09-10 06:46:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:46:22,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:22,849 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:22,849 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-09-10 06:46:22,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:22,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:22,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:22,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:22,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:23,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:23,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:23,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:23,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:23,116 INFO L87 Difference]: Start difference. First operand 1588 states and 2070 transitions. Second operand 6 states. [2019-09-10 06:46:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:24,405 INFO L93 Difference]: Finished difference Result 2603 states and 3432 transitions. [2019-09-10 06:46:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:24,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:46:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:24,423 INFO L225 Difference]: With dead ends: 2603 [2019-09-10 06:46:24,424 INFO L226 Difference]: Without dead ends: 2603 [2019-09-10 06:46:24,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-09-10 06:46:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2580. [2019-09-10 06:46:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2019-09-10 06:46:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3414 transitions. [2019-09-10 06:46:24,505 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3414 transitions. Word has length 57 [2019-09-10 06:46:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:24,506 INFO L475 AbstractCegarLoop]: Abstraction has 2580 states and 3414 transitions. [2019-09-10 06:46:24,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3414 transitions. [2019-09-10 06:46:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:46:24,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:24,511 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:24,511 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-09-10 06:46:24,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:24,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:24,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:24,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:24,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:24,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:24,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:24,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:24,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:24,769 INFO L87 Difference]: Start difference. First operand 2580 states and 3414 transitions. Second operand 6 states. [2019-09-10 06:46:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:25,917 INFO L93 Difference]: Finished difference Result 4454 states and 5932 transitions. [2019-09-10 06:46:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:25,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:46:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:25,942 INFO L225 Difference]: With dead ends: 4454 [2019-09-10 06:46:25,952 INFO L226 Difference]: Without dead ends: 4454 [2019-09-10 06:46:25,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-09-10 06:46:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4438. [2019-09-10 06:46:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-10 06:46:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5921 transitions. [2019-09-10 06:46:26,114 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5921 transitions. Word has length 57 [2019-09-10 06:46:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:26,114 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5921 transitions. [2019-09-10 06:46:26,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:26,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5921 transitions. [2019-09-10 06:46:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:46:26,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:26,118 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:26,118 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-09-10 06:46:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:26,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:26,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:26,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:26,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:46:26,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:26,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:46:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:46:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:46:26,336 INFO L87 Difference]: Start difference. First operand 4438 states and 5921 transitions. Second operand 9 states. [2019-09-10 06:46:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:29,308 INFO L93 Difference]: Finished difference Result 8486 states and 12028 transitions. [2019-09-10 06:46:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:46:29,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:46:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:29,348 INFO L225 Difference]: With dead ends: 8486 [2019-09-10 06:46:29,348 INFO L226 Difference]: Without dead ends: 8486 [2019-09-10 06:46:29,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:46:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-09-10 06:46:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4438. [2019-09-10 06:46:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-10 06:46:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5920 transitions. [2019-09-10 06:46:29,502 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5920 transitions. Word has length 59 [2019-09-10 06:46:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:29,504 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5920 transitions. [2019-09-10 06:46:29,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:46:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5920 transitions. [2019-09-10 06:46:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:46:29,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:29,512 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:29,512 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-09-10 06:46:29,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:29,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:29,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:29,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:29,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:29,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:29,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:46:29,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:29,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:46:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:46:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:46:29,737 INFO L87 Difference]: Start difference. First operand 4438 states and 5920 transitions. Second operand 9 states. [2019-09-10 06:46:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:33,092 INFO L93 Difference]: Finished difference Result 11461 states and 16045 transitions. [2019-09-10 06:46:33,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:46:33,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:46:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:33,139 INFO L225 Difference]: With dead ends: 11461 [2019-09-10 06:46:33,139 INFO L226 Difference]: Without dead ends: 11461 [2019-09-10 06:46:33,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:46:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-09-10 06:46:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4438. [2019-09-10 06:46:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-10 06:46:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5919 transitions. [2019-09-10 06:46:33,328 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5919 transitions. Word has length 59 [2019-09-10 06:46:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:33,328 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5919 transitions. [2019-09-10 06:46:33,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:46:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5919 transitions. [2019-09-10 06:46:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:46:33,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:33,332 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:33,333 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-09-10 06:46:33,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:33,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:33,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:33,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:33,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:46:33,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:33,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:46:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:46:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:46:33,547 INFO L87 Difference]: Start difference. First operand 4438 states and 5919 transitions. Second operand 8 states. [2019-09-10 06:46:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:35,777 INFO L93 Difference]: Finished difference Result 8253 states and 11771 transitions. [2019-09-10 06:46:35,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:46:35,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-10 06:46:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:35,795 INFO L225 Difference]: With dead ends: 8253 [2019-09-10 06:46:35,795 INFO L226 Difference]: Without dead ends: 8253 [2019-09-10 06:46:35,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:46:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2019-09-10 06:46:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 4438. [2019-09-10 06:46:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-09-10 06:46:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5918 transitions. [2019-09-10 06:46:35,892 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5918 transitions. Word has length 59 [2019-09-10 06:46:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:35,893 INFO L475 AbstractCegarLoop]: Abstraction has 4438 states and 5918 transitions. [2019-09-10 06:46:35,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:46:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5918 transitions. [2019-09-10 06:46:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:46:35,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:35,897 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:35,898 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-09-10 06:46:35,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:35,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:35,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:36,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:36,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:36,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:36,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:36,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:36,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,036 INFO L87 Difference]: Start difference. First operand 4438 states and 5918 transitions. Second operand 3 states. [2019-09-10 06:46:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:36,161 INFO L93 Difference]: Finished difference Result 5548 states and 7353 transitions. [2019-09-10 06:46:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:36,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:46:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:36,171 INFO L225 Difference]: With dead ends: 5548 [2019-09-10 06:46:36,172 INFO L226 Difference]: Without dead ends: 5548 [2019-09-10 06:46:36,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-09-10 06:46:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5542. [2019-09-10 06:46:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-09-10 06:46:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7349 transitions. [2019-09-10 06:46:36,252 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7349 transitions. Word has length 60 [2019-09-10 06:46:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:36,253 INFO L475 AbstractCegarLoop]: Abstraction has 5542 states and 7349 transitions. [2019-09-10 06:46:36,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7349 transitions. [2019-09-10 06:46:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:46:36,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:36,258 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:36,258 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:36,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-09-10 06:46:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:36,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:36,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:36,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:36,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:36,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:36,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,357 INFO L87 Difference]: Start difference. First operand 5542 states and 7349 transitions. Second operand 3 states. [2019-09-10 06:46:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:36,439 INFO L93 Difference]: Finished difference Result 6694 states and 9131 transitions. [2019-09-10 06:46:36,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:36,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:46:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:36,451 INFO L225 Difference]: With dead ends: 6694 [2019-09-10 06:46:36,451 INFO L226 Difference]: Without dead ends: 6694 [2019-09-10 06:46:36,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2019-09-10 06:46:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6090. [2019-09-10 06:46:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-09-10 06:46:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 8232 transitions. [2019-09-10 06:46:36,535 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 8232 transitions. Word has length 60 [2019-09-10 06:46:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:36,535 INFO L475 AbstractCegarLoop]: Abstraction has 6090 states and 8232 transitions. [2019-09-10 06:46:36,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 8232 transitions. [2019-09-10 06:46:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:46:36,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:36,539 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:36,540 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-09-10 06:46:36,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:36,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:36,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:36,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:36,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:36,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:36,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:36,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:36,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,647 INFO L87 Difference]: Start difference. First operand 6090 states and 8232 transitions. Second operand 3 states. [2019-09-10 06:46:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:36,729 INFO L93 Difference]: Finished difference Result 8067 states and 11112 transitions. [2019-09-10 06:46:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:36,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:46:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:36,744 INFO L225 Difference]: With dead ends: 8067 [2019-09-10 06:46:36,744 INFO L226 Difference]: Without dead ends: 8067 [2019-09-10 06:46:36,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-09-10 06:46:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 7151. [2019-09-10 06:46:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-09-10 06:46:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9773 transitions. [2019-09-10 06:46:36,856 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9773 transitions. Word has length 60 [2019-09-10 06:46:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:36,857 INFO L475 AbstractCegarLoop]: Abstraction has 7151 states and 9773 transitions. [2019-09-10 06:46:36,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9773 transitions. [2019-09-10 06:46:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:46:36,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:36,867 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:36,867 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:36,868 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-09-10 06:46:36,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:36,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:36,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:36,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:36,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:36,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:36,960 INFO L87 Difference]: Start difference. First operand 7151 states and 9773 transitions. Second operand 3 states. [2019-09-10 06:46:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:37,107 INFO L93 Difference]: Finished difference Result 9721 states and 13722 transitions. [2019-09-10 06:46:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:37,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:46:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:37,126 INFO L225 Difference]: With dead ends: 9721 [2019-09-10 06:46:37,127 INFO L226 Difference]: Without dead ends: 9721 [2019-09-10 06:46:37,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9721 states. [2019-09-10 06:46:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9721 to 7854. [2019-09-10 06:46:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-09-10 06:46:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 11004 transitions. [2019-09-10 06:46:37,283 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 11004 transitions. Word has length 61 [2019-09-10 06:46:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:37,284 INFO L475 AbstractCegarLoop]: Abstraction has 7854 states and 11004 transitions. [2019-09-10 06:46:37,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 11004 transitions. [2019-09-10 06:46:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:46:37,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:37,289 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:37,290 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-09-10 06:46:37,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:37,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:37,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:37,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:46:37,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:37,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:46:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:46:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:46:37,876 INFO L87 Difference]: Start difference. First operand 7854 states and 11004 transitions. Second operand 12 states. [2019-09-10 06:46:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:39,740 INFO L93 Difference]: Finished difference Result 17569 states and 25160 transitions. [2019-09-10 06:46:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:46:39,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-10 06:46:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:39,773 INFO L225 Difference]: With dead ends: 17569 [2019-09-10 06:46:39,773 INFO L226 Difference]: Without dead ends: 17569 [2019-09-10 06:46:39,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:46:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17569 states. [2019-09-10 06:46:39,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17569 to 7853. [2019-09-10 06:46:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7853 states. [2019-09-10 06:46:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 11002 transitions. [2019-09-10 06:46:39,943 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 11002 transitions. Word has length 61 [2019-09-10 06:46:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:39,943 INFO L475 AbstractCegarLoop]: Abstraction has 7853 states and 11002 transitions. [2019-09-10 06:46:39,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:46:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 11002 transitions. [2019-09-10 06:46:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:46:39,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:39,947 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:39,947 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:39,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash -169233154, now seen corresponding path program 1 times [2019-09-10 06:46:39,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:39,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:40,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:40,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:40,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:40,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:40,045 INFO L87 Difference]: Start difference. First operand 7853 states and 11002 transitions. Second operand 3 states. [2019-09-10 06:46:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:40,142 INFO L93 Difference]: Finished difference Result 11947 states and 17109 transitions. [2019-09-10 06:46:40,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:40,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:46:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:40,159 INFO L225 Difference]: With dead ends: 11947 [2019-09-10 06:46:40,159 INFO L226 Difference]: Without dead ends: 11947 [2019-09-10 06:46:40,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11947 states. [2019-09-10 06:46:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11947 to 9434. [2019-09-10 06:46:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9434 states. [2019-09-10 06:46:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9434 states to 9434 states and 13446 transitions. [2019-09-10 06:46:40,343 INFO L78 Accepts]: Start accepts. Automaton has 9434 states and 13446 transitions. Word has length 61 [2019-09-10 06:46:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:40,343 INFO L475 AbstractCegarLoop]: Abstraction has 9434 states and 13446 transitions. [2019-09-10 06:46:40,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9434 states and 13446 transitions. [2019-09-10 06:46:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:46:40,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:40,346 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:40,347 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash 58994233, now seen corresponding path program 1 times [2019-09-10 06:46:40,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:40,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:40,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:40,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:40,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:40,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:40,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:40,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:40,427 INFO L87 Difference]: Start difference. First operand 9434 states and 13446 transitions. Second operand 3 states. [2019-09-10 06:46:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:40,605 INFO L93 Difference]: Finished difference Result 10904 states and 15600 transitions. [2019-09-10 06:46:40,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:40,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:46:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:40,623 INFO L225 Difference]: With dead ends: 10904 [2019-09-10 06:46:40,624 INFO L226 Difference]: Without dead ends: 10904 [2019-09-10 06:46:40,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10904 states. [2019-09-10 06:46:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10904 to 8669. [2019-09-10 06:46:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8669 states. [2019-09-10 06:46:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8669 states to 8669 states and 12445 transitions. [2019-09-10 06:46:40,750 INFO L78 Accepts]: Start accepts. Automaton has 8669 states and 12445 transitions. Word has length 61 [2019-09-10 06:46:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:40,751 INFO L475 AbstractCegarLoop]: Abstraction has 8669 states and 12445 transitions. [2019-09-10 06:46:40,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 8669 states and 12445 transitions. [2019-09-10 06:46:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:46:40,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:40,759 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:40,759 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash -244084559, now seen corresponding path program 1 times [2019-09-10 06:46:40,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:40,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:40,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:41,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:41,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:46:41,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:41,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:46:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:46:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:46:41,424 INFO L87 Difference]: Start difference. First operand 8669 states and 12445 transitions. Second operand 13 states. [2019-09-10 06:46:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:43,290 INFO L93 Difference]: Finished difference Result 9886 states and 14156 transitions. [2019-09-10 06:46:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:46:43,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-10 06:46:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:43,307 INFO L225 Difference]: With dead ends: 9886 [2019-09-10 06:46:43,308 INFO L226 Difference]: Without dead ends: 9886 [2019-09-10 06:46:43,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:46:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9886 states. [2019-09-10 06:46:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9886 to 8682. [2019-09-10 06:46:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8682 states. [2019-09-10 06:46:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8682 states to 8682 states and 12463 transitions. [2019-09-10 06:46:43,440 INFO L78 Accepts]: Start accepts. Automaton has 8682 states and 12463 transitions. Word has length 62 [2019-09-10 06:46:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:43,441 INFO L475 AbstractCegarLoop]: Abstraction has 8682 states and 12463 transitions. [2019-09-10 06:46:43,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:46:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8682 states and 12463 transitions. [2019-09-10 06:46:43,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:46:43,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:43,443 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:43,444 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 271982167, now seen corresponding path program 1 times [2019-09-10 06:46:43,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:43,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:43,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:44,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:44,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:46:44,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:44,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:46:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:46:44,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:46:44,156 INFO L87 Difference]: Start difference. First operand 8682 states and 12463 transitions. Second operand 14 states. [2019-09-10 06:46:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:47,479 INFO L93 Difference]: Finished difference Result 19518 states and 28036 transitions. [2019-09-10 06:46:47,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:46:47,479 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-09-10 06:46:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:47,505 INFO L225 Difference]: With dead ends: 19518 [2019-09-10 06:46:47,505 INFO L226 Difference]: Without dead ends: 19518 [2019-09-10 06:46:47,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-09-10 06:46:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19518 states. [2019-09-10 06:46:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19518 to 8622. [2019-09-10 06:46:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8622 states. [2019-09-10 06:46:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8622 states to 8622 states and 12388 transitions. [2019-09-10 06:46:47,685 INFO L78 Accepts]: Start accepts. Automaton has 8622 states and 12388 transitions. Word has length 62 [2019-09-10 06:46:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:47,685 INFO L475 AbstractCegarLoop]: Abstraction has 8622 states and 12388 transitions. [2019-09-10 06:46:47,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:46:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8622 states and 12388 transitions. [2019-09-10 06:46:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:46:47,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:47,688 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:47,688 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2056344142, now seen corresponding path program 1 times [2019-09-10 06:46:47,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:47,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:47,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:48,087 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-09-10 06:46:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:48,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:48,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:46:48,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:48,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:46:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:46:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:46:48,494 INFO L87 Difference]: Start difference. First operand 8622 states and 12388 transitions. Second operand 14 states. [2019-09-10 06:46:49,528 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-10 06:46:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:51,246 INFO L93 Difference]: Finished difference Result 19516 states and 28173 transitions. [2019-09-10 06:46:51,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:46:51,247 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-09-10 06:46:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:51,269 INFO L225 Difference]: With dead ends: 19516 [2019-09-10 06:46:51,270 INFO L226 Difference]: Without dead ends: 19516 [2019-09-10 06:46:51,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:46:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19516 states. [2019-09-10 06:46:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19516 to 8618. [2019-09-10 06:46:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8618 states. [2019-09-10 06:46:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8618 states to 8618 states and 12384 transitions. [2019-09-10 06:46:51,455 INFO L78 Accepts]: Start accepts. Automaton has 8618 states and 12384 transitions. Word has length 63 [2019-09-10 06:46:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:51,456 INFO L475 AbstractCegarLoop]: Abstraction has 8618 states and 12384 transitions. [2019-09-10 06:46:51,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:46:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 8618 states and 12384 transitions. [2019-09-10 06:46:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:46:51,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:51,458 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:46:51,458 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:51,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:51,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1004192523, now seen corresponding path program 1 times [2019-09-10 06:46:51,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:51,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:51,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:51,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:51,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:51,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:51,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:46:51,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:51,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:46:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:46:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:46:51,808 INFO L87 Difference]: Start difference. First operand 8618 states and 12384 transitions. Second operand 11 states. [2019-09-10 06:46:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:53,670 INFO L93 Difference]: Finished difference Result 26776 states and 38448 transitions. [2019-09-10 06:46:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:46:53,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-09-10 06:46:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:53,695 INFO L225 Difference]: With dead ends: 26776 [2019-09-10 06:46:53,695 INFO L226 Difference]: Without dead ends: 26776 [2019-09-10 06:46:53,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:46:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26776 states. [2019-09-10 06:46:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26776 to 8556. [2019-09-10 06:46:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8556 states. [2019-09-10 06:46:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8556 states to 8556 states and 12304 transitions. [2019-09-10 06:46:53,892 INFO L78 Accepts]: Start accepts. Automaton has 8556 states and 12304 transitions. Word has length 63 [2019-09-10 06:46:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:53,892 INFO L475 AbstractCegarLoop]: Abstraction has 8556 states and 12304 transitions. [2019-09-10 06:46:53,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:46:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 8556 states and 12304 transitions. [2019-09-10 06:46:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:46:53,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:53,896 INFO L399 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, 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-09-10 06:46:53,896 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2123353110, now seen corresponding path program 1 times [2019-09-10 06:46:53,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:53,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:53,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:53,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:53,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:54,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:54,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:54,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:54,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:54,018 INFO L87 Difference]: Start difference. First operand 8556 states and 12304 transitions. Second operand 6 states. [2019-09-10 06:46:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:54,223 INFO L93 Difference]: Finished difference Result 30026 states and 42302 transitions. [2019-09-10 06:46:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:46:54,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:46:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:54,250 INFO L225 Difference]: With dead ends: 30026 [2019-09-10 06:46:54,250 INFO L226 Difference]: Without dead ends: 30026 [2019-09-10 06:46:54,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:46:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30026 states. [2019-09-10 06:46:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30026 to 26354. [2019-09-10 06:46:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26354 states. [2019-09-10 06:46:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26354 states to 26354 states and 37175 transitions. [2019-09-10 06:46:54,509 INFO L78 Accepts]: Start accepts. Automaton has 26354 states and 37175 transitions. Word has length 70 [2019-09-10 06:46:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:54,509 INFO L475 AbstractCegarLoop]: Abstraction has 26354 states and 37175 transitions. [2019-09-10 06:46:54,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 26354 states and 37175 transitions. [2019-09-10 06:46:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:46:54,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:54,515 INFO L399 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, 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-09-10 06:46:54,516 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1078555367, now seen corresponding path program 1 times [2019-09-10 06:46:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:54,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:54,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:54,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:54,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:54,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:54,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:54,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:54,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:54,649 INFO L87 Difference]: Start difference. First operand 26354 states and 37175 transitions. Second operand 5 states. [2019-09-10 06:46:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:54,908 INFO L93 Difference]: Finished difference Result 20652 states and 28950 transitions. [2019-09-10 06:46:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:46:54,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:46:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:54,931 INFO L225 Difference]: With dead ends: 20652 [2019-09-10 06:46:54,931 INFO L226 Difference]: Without dead ends: 20652 [2019-09-10 06:46:54,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20652 states. [2019-09-10 06:46:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20652 to 20648. [2019-09-10 06:46:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20648 states. [2019-09-10 06:46:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20648 states to 20648 states and 28948 transitions. [2019-09-10 06:46:55,174 INFO L78 Accepts]: Start accepts. Automaton has 20648 states and 28948 transitions. Word has length 71 [2019-09-10 06:46:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:55,175 INFO L475 AbstractCegarLoop]: Abstraction has 20648 states and 28948 transitions. [2019-09-10 06:46:55,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:46:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 20648 states and 28948 transitions. [2019-09-10 06:46:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:46:55,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:55,180 INFO L399 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, 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-09-10 06:46:55,180 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:55,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:55,180 INFO L82 PathProgramCache]: Analyzing trace with hash 781945202, now seen corresponding path program 1 times [2019-09-10 06:46:55,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:55,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:55,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:46:55,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:55,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:46:55,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:46:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:46:55,290 INFO L87 Difference]: Start difference. First operand 20648 states and 28948 transitions. Second operand 6 states. [2019-09-10 06:46:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:55,506 INFO L93 Difference]: Finished difference Result 35890 states and 49375 transitions. [2019-09-10 06:46:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:46:55,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-10 06:46:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:55,548 INFO L225 Difference]: With dead ends: 35890 [2019-09-10 06:46:55,548 INFO L226 Difference]: Without dead ends: 35890 [2019-09-10 06:46:55,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:46:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35890 states. [2019-09-10 06:46:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35890 to 21314. [2019-09-10 06:46:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21314 states. [2019-09-10 06:46:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21314 states to 21314 states and 29457 transitions. [2019-09-10 06:46:55,798 INFO L78 Accepts]: Start accepts. Automaton has 21314 states and 29457 transitions. Word has length 73 [2019-09-10 06:46:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:55,798 INFO L475 AbstractCegarLoop]: Abstraction has 21314 states and 29457 transitions. [2019-09-10 06:46:55,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:46:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 21314 states and 29457 transitions. [2019-09-10 06:46:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:46:55,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:55,804 INFO L399 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, 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-09-10 06:46:55,804 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:55,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1414482205, now seen corresponding path program 1 times [2019-09-10 06:46:55,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:55,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:55,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:55,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:55,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:55,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:46:55,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:55,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:46:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:46:55,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:55,887 INFO L87 Difference]: Start difference. First operand 21314 states and 29457 transitions. Second operand 3 states. [2019-09-10 06:46:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:56,030 INFO L93 Difference]: Finished difference Result 37318 states and 51152 transitions. [2019-09-10 06:46:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:46:56,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:46:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:56,081 INFO L225 Difference]: With dead ends: 37318 [2019-09-10 06:46:56,081 INFO L226 Difference]: Without dead ends: 37318 [2019-09-10 06:46:56,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:46:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37318 states. [2019-09-10 06:46:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37318 to 37316. [2019-09-10 06:46:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37316 states. [2019-09-10 06:46:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37316 states to 37316 states and 51151 transitions. [2019-09-10 06:46:57,258 INFO L78 Accepts]: Start accepts. Automaton has 37316 states and 51151 transitions. Word has length 74 [2019-09-10 06:46:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:46:57,258 INFO L475 AbstractCegarLoop]: Abstraction has 37316 states and 51151 transitions. [2019-09-10 06:46:57,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:46:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37316 states and 51151 transitions. [2019-09-10 06:46:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:46:57,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:46:57,262 INFO L399 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, 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-09-10 06:46:57,263 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:46:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:46:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1190739596, now seen corresponding path program 1 times [2019-09-10 06:46:57,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:46:57,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:57,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:46:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:46:57,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:46:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:46:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:46:57,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:46:57,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:46:57,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:46:57,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:46:57,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:46:57,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:46:57,346 INFO L87 Difference]: Start difference. First operand 37316 states and 51151 transitions. Second operand 5 states. [2019-09-10 06:46:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:46:58,189 INFO L93 Difference]: Finished difference Result 97113 states and 130993 transitions. [2019-09-10 06:46:58,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:46:58,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 06:46:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:46:58,295 INFO L225 Difference]: With dead ends: 97113 [2019-09-10 06:46:58,295 INFO L226 Difference]: Without dead ends: 97113 [2019-09-10 06:46:58,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:46:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97113 states. [2019-09-10 06:47:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97113 to 36885. [2019-09-10 06:47:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36885 states. [2019-09-10 06:47:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 49924 transitions. [2019-09-10 06:47:00,121 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 49924 transitions. Word has length 76 [2019-09-10 06:47:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:00,121 INFO L475 AbstractCegarLoop]: Abstraction has 36885 states and 49924 transitions. [2019-09-10 06:47:00,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 49924 transitions. [2019-09-10 06:47:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:47:00,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:00,126 INFO L399 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, 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-09-10 06:47:00,127 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:00,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2062750855, now seen corresponding path program 1 times [2019-09-10 06:47:00,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:00,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:00,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:00,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:00,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:00,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:00,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:00,209 INFO L87 Difference]: Start difference. First operand 36885 states and 49924 transitions. Second operand 3 states. [2019-09-10 06:47:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:00,322 INFO L93 Difference]: Finished difference Result 36887 states and 49288 transitions. [2019-09-10 06:47:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:00,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:47:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:00,364 INFO L225 Difference]: With dead ends: 36887 [2019-09-10 06:47:00,364 INFO L226 Difference]: Without dead ends: 36887 [2019-09-10 06:47:00,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36887 states. [2019-09-10 06:47:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36887 to 30339. [2019-09-10 06:47:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30339 states. [2019-09-10 06:47:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30339 states to 30339 states and 40652 transitions. [2019-09-10 06:47:00,626 INFO L78 Accepts]: Start accepts. Automaton has 30339 states and 40652 transitions. Word has length 77 [2019-09-10 06:47:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:00,627 INFO L475 AbstractCegarLoop]: Abstraction has 30339 states and 40652 transitions. [2019-09-10 06:47:00,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30339 states and 40652 transitions. [2019-09-10 06:47:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:47:00,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:00,631 INFO L399 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, 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-09-10 06:47:00,631 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:00,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:00,631 INFO L82 PathProgramCache]: Analyzing trace with hash -667932309, now seen corresponding path program 1 times [2019-09-10 06:47:00,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:00,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:00,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:00,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:00,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:00,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:00,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:00,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:00,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:00,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:00,711 INFO L87 Difference]: Start difference. First operand 30339 states and 40652 transitions. Second operand 5 states. [2019-09-10 06:47:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:01,463 INFO L93 Difference]: Finished difference Result 97255 states and 128400 transitions. [2019-09-10 06:47:01,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:47:01,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 06:47:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:01,555 INFO L225 Difference]: With dead ends: 97255 [2019-09-10 06:47:01,555 INFO L226 Difference]: Without dead ends: 97255 [2019-09-10 06:47:01,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97255 states. [2019-09-10 06:47:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97255 to 50483. [2019-09-10 06:47:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50483 states. [2019-09-10 06:47:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50483 states to 50483 states and 67206 transitions. [2019-09-10 06:47:02,475 INFO L78 Accepts]: Start accepts. Automaton has 50483 states and 67206 transitions. Word has length 78 [2019-09-10 06:47:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:02,475 INFO L475 AbstractCegarLoop]: Abstraction has 50483 states and 67206 transitions. [2019-09-10 06:47:02,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 50483 states and 67206 transitions. [2019-09-10 06:47:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:47:02,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:02,479 INFO L399 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, 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-09-10 06:47:02,479 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1157971312, now seen corresponding path program 1 times [2019-09-10 06:47:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:02,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:02,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:02,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:02,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:02,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:02,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:02,559 INFO L87 Difference]: Start difference. First operand 50483 states and 67206 transitions. Second operand 5 states. [2019-09-10 06:47:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:03,311 INFO L93 Difference]: Finished difference Result 156014 states and 203210 transitions. [2019-09-10 06:47:03,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:47:03,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 06:47:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:03,475 INFO L225 Difference]: With dead ends: 156014 [2019-09-10 06:47:03,476 INFO L226 Difference]: Without dead ends: 156014 [2019-09-10 06:47:03,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156014 states. [2019-09-10 06:47:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156014 to 101594. [2019-09-10 06:47:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101594 states. [2019-09-10 06:47:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101594 states to 101594 states and 134264 transitions. [2019-09-10 06:47:06,305 INFO L78 Accepts]: Start accepts. Automaton has 101594 states and 134264 transitions. Word has length 81 [2019-09-10 06:47:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:06,306 INFO L475 AbstractCegarLoop]: Abstraction has 101594 states and 134264 transitions. [2019-09-10 06:47:06,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 101594 states and 134264 transitions. [2019-09-10 06:47:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:47:06,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:06,310 INFO L399 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, 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-09-10 06:47:06,310 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2119187877, now seen corresponding path program 1 times [2019-09-10 06:47:06,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:06,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:06,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:06,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:06,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:06,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:06,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:06,385 INFO L87 Difference]: Start difference. First operand 101594 states and 134264 transitions. Second operand 3 states. [2019-09-10 06:47:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:06,593 INFO L93 Difference]: Finished difference Result 99009 states and 127850 transitions. [2019-09-10 06:47:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:06,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:47:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:06,691 INFO L225 Difference]: With dead ends: 99009 [2019-09-10 06:47:06,691 INFO L226 Difference]: Without dead ends: 99009 [2019-09-10 06:47:06,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99009 states. [2019-09-10 06:47:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99009 to 81617. [2019-09-10 06:47:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81617 states. [2019-09-10 06:47:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81617 states to 81617 states and 105798 transitions. [2019-09-10 06:47:07,860 INFO L78 Accepts]: Start accepts. Automaton has 81617 states and 105798 transitions. Word has length 83 [2019-09-10 06:47:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:07,861 INFO L475 AbstractCegarLoop]: Abstraction has 81617 states and 105798 transitions. [2019-09-10 06:47:07,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 81617 states and 105798 transitions. [2019-09-10 06:47:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:47:07,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:07,865 INFO L399 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, 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-09-10 06:47:07,865 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1400576218, now seen corresponding path program 1 times [2019-09-10 06:47:07,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:07,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:07,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:07,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:07,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:07,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:07,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:07,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:07,940 INFO L87 Difference]: Start difference. First operand 81617 states and 105798 transitions. Second operand 3 states. [2019-09-10 06:47:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:08,174 INFO L93 Difference]: Finished difference Result 98427 states and 125832 transitions. [2019-09-10 06:47:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:08,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 06:47:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:08,270 INFO L225 Difference]: With dead ends: 98427 [2019-09-10 06:47:08,270 INFO L226 Difference]: Without dead ends: 98427 [2019-09-10 06:47:08,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98427 states. [2019-09-10 06:47:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98427 to 93930. [2019-09-10 06:47:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93930 states. [2019-09-10 06:47:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93930 states to 93930 states and 120526 transitions. [2019-09-10 06:47:09,655 INFO L78 Accepts]: Start accepts. Automaton has 93930 states and 120526 transitions. Word has length 86 [2019-09-10 06:47:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:09,655 INFO L475 AbstractCegarLoop]: Abstraction has 93930 states and 120526 transitions. [2019-09-10 06:47:09,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 93930 states and 120526 transitions. [2019-09-10 06:47:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:47:09,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:09,663 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:09,663 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 213751766, now seen corresponding path program 1 times [2019-09-10 06:47:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:09,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:47:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:09,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:09,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:09,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:09,747 INFO L87 Difference]: Start difference. First operand 93930 states and 120526 transitions. Second operand 3 states. [2019-09-10 06:47:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:10,132 INFO L93 Difference]: Finished difference Result 168770 states and 211041 transitions. [2019-09-10 06:47:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:10,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 06:47:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:10,321 INFO L225 Difference]: With dead ends: 168770 [2019-09-10 06:47:10,321 INFO L226 Difference]: Without dead ends: 168770 [2019-09-10 06:47:10,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168770 states. [2019-09-10 06:47:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168770 to 148961. [2019-09-10 06:47:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148961 states. [2019-09-10 06:47:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148961 states to 148961 states and 187408 transitions. [2019-09-10 06:47:14,207 INFO L78 Accepts]: Start accepts. Automaton has 148961 states and 187408 transitions. Word has length 94 [2019-09-10 06:47:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:14,207 INFO L475 AbstractCegarLoop]: Abstraction has 148961 states and 187408 transitions. [2019-09-10 06:47:14,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 148961 states and 187408 transitions. [2019-09-10 06:47:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:47:14,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:14,216 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:14,216 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash -383116103, now seen corresponding path program 1 times [2019-09-10 06:47:14,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:14,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:14,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:14,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:14,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:14,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:47:14,346 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:47:14,348 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [168], [171], [172], [174], [177], [180], [201], [203], [205], [2186], [2189], [2210], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2252], [2257], [2262], [2264], [2283], [2285], [2304], [2634], [2638], [2641], [2644], [2647], [2655], [2657], [3711], [3725], [3727], [3731], [3734], [3737], [3740], [3744], [3896], [3943], [3946], [3949], [3953], [3956], [3959], [3963], [3965], [3968], [3972], [3975], [3984], [3986], [4283], [4286], [4289], [4293], [4296], [4300], [4304], [4318], [4320], [4929], [4930], [4934], [4935], [4936] [2019-09-10 06:47:14,394 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:47:14,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:47:14,617 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:47:15,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:47:15,552 INFO L272 AbstractInterpreter]: Visited 92 different actions 287 times. Merged at 28 different actions 178 times. Widened at 10 different actions 22 times. Performed 1597 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1597 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 6 different actions. Largest state had 386 variables. [2019-09-10 06:47:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:15,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:47:15,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:47:15,558 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-09-10 06:47:15,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:15,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:47:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:15,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:47:15,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:47:16,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:16,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:47:16,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:47:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:47:16,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:47:16,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 06:47:16,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:47:16,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:47:16,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:47:16,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:47:16,602 INFO L87 Difference]: Start difference. First operand 148961 states and 187408 transitions. Second operand 13 states. [2019-09-10 06:47:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:22,090 INFO L93 Difference]: Finished difference Result 352632 states and 443063 transitions. [2019-09-10 06:47:22,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:47:22,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 06:47:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:22,781 INFO L225 Difference]: With dead ends: 352632 [2019-09-10 06:47:22,781 INFO L226 Difference]: Without dead ends: 352632 [2019-09-10 06:47:22,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=560, Invalid=1696, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:47:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352632 states. [2019-09-10 06:47:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352632 to 193350. [2019-09-10 06:47:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193350 states. [2019-09-10 06:47:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193350 states to 193350 states and 243070 transitions. [2019-09-10 06:47:31,546 INFO L78 Accepts]: Start accepts. Automaton has 193350 states and 243070 transitions. Word has length 97 [2019-09-10 06:47:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:31,546 INFO L475 AbstractCegarLoop]: Abstraction has 193350 states and 243070 transitions. [2019-09-10 06:47:31,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:47:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 193350 states and 243070 transitions. [2019-09-10 06:47:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:47:31,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:31,555 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:47:31,556 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2107665468, now seen corresponding path program 1 times [2019-09-10 06:47:31,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:31,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:31,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:31,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:31,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:31,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:31,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:31,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:31,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:31,655 INFO L87 Difference]: Start difference. First operand 193350 states and 243070 transitions. Second operand 3 states. [2019-09-10 06:47:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:32,073 INFO L93 Difference]: Finished difference Result 146920 states and 182188 transitions. [2019-09-10 06:47:32,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:32,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:47:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:32,261 INFO L225 Difference]: With dead ends: 146920 [2019-09-10 06:47:32,262 INFO L226 Difference]: Without dead ends: 146920 [2019-09-10 06:47:32,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146920 states. [2019-09-10 06:47:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146920 to 146726. [2019-09-10 06:47:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146726 states. [2019-09-10 06:47:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146726 states to 146726 states and 181995 transitions. [2019-09-10 06:47:34,275 INFO L78 Accepts]: Start accepts. Automaton has 146726 states and 181995 transitions. Word has length 98 [2019-09-10 06:47:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:34,276 INFO L475 AbstractCegarLoop]: Abstraction has 146726 states and 181995 transitions. [2019-09-10 06:47:34,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 146726 states and 181995 transitions. [2019-09-10 06:47:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:47:34,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:34,284 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:34,284 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1350911043, now seen corresponding path program 1 times [2019-09-10 06:47:34,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:34,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:34,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:34,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:34,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:34,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:34,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:34,362 INFO L87 Difference]: Start difference. First operand 146726 states and 181995 transitions. Second operand 5 states. [2019-09-10 06:47:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:35,226 INFO L93 Difference]: Finished difference Result 171549 states and 210400 transitions. [2019-09-10 06:47:35,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:47:35,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:47:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:35,402 INFO L225 Difference]: With dead ends: 171549 [2019-09-10 06:47:35,402 INFO L226 Difference]: Without dead ends: 171549 [2019-09-10 06:47:35,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:47:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171549 states. [2019-09-10 06:47:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171549 to 142203. [2019-09-10 06:47:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142203 states. [2019-09-10 06:47:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142203 states to 142203 states and 174134 transitions. [2019-09-10 06:47:39,664 INFO L78 Accepts]: Start accepts. Automaton has 142203 states and 174134 transitions. Word has length 99 [2019-09-10 06:47:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:39,664 INFO L475 AbstractCegarLoop]: Abstraction has 142203 states and 174134 transitions. [2019-09-10 06:47:39,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 142203 states and 174134 transitions. [2019-09-10 06:47:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:47:39,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:39,672 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:39,672 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:39,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:39,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1499550427, now seen corresponding path program 1 times [2019-09-10 06:47:39,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:47:39,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:39,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:39,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:39,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:39,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:39,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:39,754 INFO L87 Difference]: Start difference. First operand 142203 states and 174134 transitions. Second operand 3 states. [2019-09-10 06:47:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:40,016 INFO L93 Difference]: Finished difference Result 142059 states and 172170 transitions. [2019-09-10 06:47:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:40,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:47:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:40,163 INFO L225 Difference]: With dead ends: 142059 [2019-09-10 06:47:40,163 INFO L226 Difference]: Without dead ends: 142059 [2019-09-10 06:47:40,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142059 states. [2019-09-10 06:47:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142059 to 108087. [2019-09-10 06:47:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108087 states. [2019-09-10 06:47:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108087 states to 108087 states and 131578 transitions. [2019-09-10 06:47:41,636 INFO L78 Accepts]: Start accepts. Automaton has 108087 states and 131578 transitions. Word has length 101 [2019-09-10 06:47:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:41,636 INFO L475 AbstractCegarLoop]: Abstraction has 108087 states and 131578 transitions. [2019-09-10 06:47:41,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 108087 states and 131578 transitions. [2019-09-10 06:47:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:47:41,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:41,642 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:41,643 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash 786221547, now seen corresponding path program 1 times [2019-09-10 06:47:41,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:41,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:41,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:41,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:41,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:41,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:41,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:41,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:41,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:41,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:41,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:41,758 INFO L87 Difference]: Start difference. First operand 108087 states and 131578 transitions. Second operand 5 states. [2019-09-10 06:47:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:42,235 INFO L93 Difference]: Finished difference Result 152833 states and 185695 transitions. [2019-09-10 06:47:42,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:42,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:47:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:42,381 INFO L225 Difference]: With dead ends: 152833 [2019-09-10 06:47:42,381 INFO L226 Difference]: Without dead ends: 152833 [2019-09-10 06:47:42,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152833 states. [2019-09-10 06:47:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152833 to 124844. [2019-09-10 06:47:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124844 states. [2019-09-10 06:47:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124844 states to 124844 states and 151626 transitions. [2019-09-10 06:47:46,735 INFO L78 Accepts]: Start accepts. Automaton has 124844 states and 151626 transitions. Word has length 104 [2019-09-10 06:47:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:46,736 INFO L475 AbstractCegarLoop]: Abstraction has 124844 states and 151626 transitions. [2019-09-10 06:47:46,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 124844 states and 151626 transitions. [2019-09-10 06:47:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:47:46,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:46,741 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:46,741 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:46,742 INFO L82 PathProgramCache]: Analyzing trace with hash 260740551, now seen corresponding path program 1 times [2019-09-10 06:47:46,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:46,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:47:46,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:46,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:46,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:46,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:46,846 INFO L87 Difference]: Start difference. First operand 124844 states and 151626 transitions. Second operand 5 states. [2019-09-10 06:47:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:47,217 INFO L93 Difference]: Finished difference Result 165998 states and 201362 transitions. [2019-09-10 06:47:47,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:47,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:47:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:47,372 INFO L225 Difference]: With dead ends: 165998 [2019-09-10 06:47:47,373 INFO L226 Difference]: Without dead ends: 165998 [2019-09-10 06:47:47,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165998 states. [2019-09-10 06:47:48,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165998 to 143380. [2019-09-10 06:47:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143380 states. [2019-09-10 06:47:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143380 states to 143380 states and 173927 transitions. [2019-09-10 06:47:49,206 INFO L78 Accepts]: Start accepts. Automaton has 143380 states and 173927 transitions. Word has length 104 [2019-09-10 06:47:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:49,206 INFO L475 AbstractCegarLoop]: Abstraction has 143380 states and 173927 transitions. [2019-09-10 06:47:49,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 143380 states and 173927 transitions. [2019-09-10 06:47:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:47:49,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:49,213 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:47:49,213 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:49,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:49,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158497, now seen corresponding path program 1 times [2019-09-10 06:47:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:49,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:47:49,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:49,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:47:49,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:49,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:47:49,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:47:49,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:47:49,291 INFO L87 Difference]: Start difference. First operand 143380 states and 173927 transitions. Second operand 4 states. [2019-09-10 06:47:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:50,280 INFO L93 Difference]: Finished difference Result 269347 states and 327357 transitions. [2019-09-10 06:47:50,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:50,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 06:47:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:50,563 INFO L225 Difference]: With dead ends: 269347 [2019-09-10 06:47:50,564 INFO L226 Difference]: Without dead ends: 269347 [2019-09-10 06:47:50,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269347 states. [2019-09-10 06:47:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269347 to 170523. [2019-09-10 06:47:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170523 states. [2019-09-10 06:47:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170523 states to 170523 states and 207261 transitions. [2019-09-10 06:47:55,246 INFO L78 Accepts]: Start accepts. Automaton has 170523 states and 207261 transitions. Word has length 107 [2019-09-10 06:47:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:55,247 INFO L475 AbstractCegarLoop]: Abstraction has 170523 states and 207261 transitions. [2019-09-10 06:47:55,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:47:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 170523 states and 207261 transitions. [2019-09-10 06:47:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:47:55,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:55,255 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:47:55,255 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1420978006, now seen corresponding path program 1 times [2019-09-10 06:47:55,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:55,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:55,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:55,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:55,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:55,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:55,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:47:55,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:55,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:47:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:47:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:47:55,508 INFO L87 Difference]: Start difference. First operand 170523 states and 207261 transitions. Second operand 10 states. [2019-09-10 06:47:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:58,473 INFO L93 Difference]: Finished difference Result 452593 states and 545021 transitions. [2019-09-10 06:47:58,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:47:58,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2019-09-10 06:47:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:59,903 INFO L225 Difference]: With dead ends: 452593 [2019-09-10 06:47:59,903 INFO L226 Difference]: Without dead ends: 452593 [2019-09-10 06:47:59,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:48:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452593 states. [2019-09-10 06:48:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452593 to 226807. [2019-09-10 06:48:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226807 states. [2019-09-10 06:48:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226807 states to 226807 states and 275083 transitions. [2019-09-10 06:48:03,299 INFO L78 Accepts]: Start accepts. Automaton has 226807 states and 275083 transitions. Word has length 108 [2019-09-10 06:48:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:03,300 INFO L475 AbstractCegarLoop]: Abstraction has 226807 states and 275083 transitions. [2019-09-10 06:48:03,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:48:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 226807 states and 275083 transitions. [2019-09-10 06:48:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:48:03,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:03,312 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:48:03,312 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash -499235246, now seen corresponding path program 1 times [2019-09-10 06:48:03,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:03,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:03,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:03,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:03,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:03,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:48:03,523 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [79], [82], [85], [89], [168], [171], [172], [174], [177], [180], [183], [186], [191], [194], [203], [205], [380], [483], [486], [489], [493], [496], [499], [503], [505], [508], [511], [514], [519], [522], [525], [528], [532], [536], [969], [972], [975], [979], [982], [986], [989], [992], [995], [1003], [1005], [2186], [2189], [2210], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2260], [2262], [2264], [2283], [2285], [2288], [2291], [2294], [2302], [2306], [2309], [2312], [2315], [2323], [2325], [4929], [4930], [4934], [4935], [4936] [2019-09-10 06:48:03,534 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:03,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:03,656 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:04,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:04,215 INFO L272 AbstractInterpreter]: Visited 103 different actions 393 times. Merged at 39 different actions 264 times. Widened at 16 different actions 42 times. Performed 1889 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 9 different actions. Largest state had 387 variables. [2019-09-10 06:48:04,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:04,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:04,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:04,216 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-09-10 06:48:04,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:04,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:04,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:48:04,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:04,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:04,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:08,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:09,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:09,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:09,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:09,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:48:09,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:09,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2019-09-10 06:48:09,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:09,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:48:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:48:09,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:48:09,269 INFO L87 Difference]: Start difference. First operand 226807 states and 275083 transitions. Second operand 18 states. [2019-09-10 06:48:09,702 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 06:48:09,856 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-09-10 06:48:16,953 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:48:17,541 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:48:19,185 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:48:19,668 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:48:19,919 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 06:48:20,521 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:48:21,152 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 06:48:21,812 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:48:22,062 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:48:22,703 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 06:48:23,423 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 06:48:23,732 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 06:48:24,240 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:48:25,076 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-10 06:48:25,888 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 06:48:26,414 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:48:27,119 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:48:28,101 WARN L188 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:48:28,259 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 06:48:29,168 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:48:29,911 WARN L188 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:48:31,744 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:48:32,587 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:48:32,987 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 06:48:33,388 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 06:48:33,697 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 06:48:34,203 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 06:48:34,831 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 06:48:35,245 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-10 06:48:35,564 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 06:48:35,995 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:48:37,049 WARN L188 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-10 06:48:37,875 WARN L188 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 06:48:38,129 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:48:38,751 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 06:48:39,179 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 06:48:39,630 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 06:48:40,113 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 06:48:40,777 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-09-10 06:48:41,356 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-10 06:48:42,300 WARN L188 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:48:43,603 WARN L188 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 06:48:43,798 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 06:48:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:45,171 INFO L93 Difference]: Finished difference Result 584475 states and 703157 transitions. [2019-09-10 06:48:45,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 06:48:45,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 109 [2019-09-10 06:48:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:45,847 INFO L225 Difference]: With dead ends: 584475 [2019-09-10 06:48:45,848 INFO L226 Difference]: Without dead ends: 584475 [2019-09-10 06:48:45,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 191 SyntacticMatches, 12 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3819 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=2055, Invalid=10377, Unknown=0, NotChecked=0, Total=12432 [2019-09-10 06:48:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584475 states. [2019-09-10 06:48:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584475 to 234258. [2019-09-10 06:48:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234258 states. [2019-09-10 06:48:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234258 states to 234258 states and 283895 transitions. [2019-09-10 06:48:50,861 INFO L78 Accepts]: Start accepts. Automaton has 234258 states and 283895 transitions. Word has length 109 [2019-09-10 06:48:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:50,861 INFO L475 AbstractCegarLoop]: Abstraction has 234258 states and 283895 transitions. [2019-09-10 06:48:50,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:48:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 234258 states and 283895 transitions. [2019-09-10 06:48:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:48:50,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:50,875 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:48:50,876 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1995238919, now seen corresponding path program 1 times [2019-09-10 06:48:50,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:50,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:50,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:51,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:51,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:51,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:48:51,124 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [168], [171], [172], [174], [177], [180], [183], [199], [203], [205], [2186], [2189], [2192], [2195], [2200], [2203], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2260], [2262], [2264], [2267], [2270], [2273], [2281], [2283], [2306], [2309], [2312], [2315], [2323], [2325], [3711], [3725], [3727], [3731], [3734], [3737], [3740], [3744], [3747], [3750], [3753], [3756], [3759], [3763], [3766], [3769], [3772], [3776], [3780], [3809], [3812], [3816], [3819], [3822], [3825], [3830], [3833], [3836], [3839], [3843], [3846], [3850], [3854], [3857], [3860], [3863], [3871], [3875], [4929], [4930], [4934], [4935], [4936] [2019-09-10 06:48:51,128 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:51,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:51,228 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:51,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:51,656 INFO L272 AbstractInterpreter]: Visited 103 different actions 373 times. Merged at 39 different actions 247 times. Widened at 14 different actions 32 times. Performed 1847 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1847 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 11 different actions. Largest state had 387 variables. [2019-09-10 06:48:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:51,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:51,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:51,657 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-09-10 06:48:51,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:51,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:51,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:48:51,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:52,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:52,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:52,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:52,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:52,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:55,253 WARN L188 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 06:48:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:56,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:56,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 27 [2019-09-10 06:48:56,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:56,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 06:48:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 06:48:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:48:56,244 INFO L87 Difference]: Start difference. First operand 234258 states and 283895 transitions. Second operand 20 states. [2019-09-10 06:48:56,691 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 06:48:57,182 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 06:48:57,586 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 06:48:57,901 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 06:48:58,154 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:48:58,671 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 06:48:58,892 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 06:49:00,055 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 06:49:00,703 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:49:01,164 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 06:49:02,760 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 06:49:02,915 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 06:49:03,310 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 06:49:03,715 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 06:49:05,021 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:49:05,361 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 06:49:06,017 WARN L188 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 06:49:06,161 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:49:06,385 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 06:49:06,959 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-09-10 06:49:07,492 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 06:49:07,968 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 06:49:08,384 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 06:49:08,556 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 06:49:08,767 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 06:49:09,096 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-10 06:49:09,433 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 06:49:09,668 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:49:10,222 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:49:10,542 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:49:10,852 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 06:49:11,079 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:49:11,427 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:49:11,737 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 06:49:12,612 WARN L188 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:49:13,073 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 06:49:13,718 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:49:14,084 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:49:14,328 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:49:14,861 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:49:15,048 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 06:49:15,491 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:49:16,057 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:49:16,344 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:49:16,701 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:49:17,067 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 06:49:17,418 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:49:17,819 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:49:18,247 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 06:49:18,915 WARN L188 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:49:19,084 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:49:19,489 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 06:49:19,952 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 06:49:20,488 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:49:20,764 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:49:21,117 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:49:21,424 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 06:49:21,779 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 06:49:22,338 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 06:49:22,660 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:49:23,025 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 06:49:23,328 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 06:49:24,010 WARN L188 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:49:24,287 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:49:24,902 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 06:49:25,290 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 06:49:25,576 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-09-10 06:49:25,784 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 06:49:26,320 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 06:49:26,953 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 06:49:27,352 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-10 06:49:27,664 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:49:28,196 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 06:49:28,770 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-09-10 06:49:29,154 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 06:49:29,621 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 06:49:30,100 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 06:49:30,807 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 06:49:31,607 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 06:49:31,888 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:49:32,679 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:49:33,033 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-10 06:49:33,334 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 06:49:33,569 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 06:49:33,936 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:49:34,442 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 06:49:35,098 WARN L188 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 06:49:35,431 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 06:49:35,770 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-09-10 06:49:36,165 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 06:49:36,789 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 06:49:37,311 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 06:49:37,610 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 06:49:38,096 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 06:49:38,348 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:49:38,667 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 06:49:39,335 WARN L188 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 06:49:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:40,891 INFO L93 Difference]: Finished difference Result 501655 states and 597782 transitions. [2019-09-10 06:49:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-10 06:49:40,891 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-09-10 06:49:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:40,891 INFO L225 Difference]: With dead ends: 501655 [2019-09-10 06:49:40,892 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 06:49:40,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 237 SyntacticMatches, 16 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5350 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=3613, Invalid=12899, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 06:49:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 06:49:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 06:49:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 06:49:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 06:49:40,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2019-09-10 06:49:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:40,896 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 06:49:40,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 06:49:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 06:49:40,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 06:49:40,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 06:49:40 BoogieIcfgContainer [2019-09-10 06:49:40,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 06:49:40,902 INFO L168 Benchmark]: Toolchain (without parser) took 206759.28 ms. Allocated memory was 135.3 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 84.0 MB in the beginning and 1.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-09-10 06:49:40,902 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 108.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-10 06:49:40,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1563.29 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 83.8 MB in the beginning and 125.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2019-09-10 06:49:40,903 INFO L168 Benchmark]: Boogie Preprocessor took 250.46 ms. Allocated memory is still 226.5 MB. Free memory was 125.0 MB in the beginning and 111.3 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-09-10 06:49:40,904 INFO L168 Benchmark]: RCFGBuilder took 3674.44 ms. Allocated memory was 226.5 MB in the beginning and 332.9 MB in the end (delta: 106.4 MB). Free memory was 110.4 MB in the beginning and 132.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-09-10 06:49:40,905 INFO L168 Benchmark]: TraceAbstraction took 201267.17 ms. Allocated memory was 332.9 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 132.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-09-10 06:49:40,907 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.24 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 108.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1563.29 ms. Allocated memory was 135.3 MB in the beginning and 226.5 MB in the end (delta: 91.2 MB). Free memory was 83.8 MB in the beginning and 125.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 250.46 ms. Allocated memory is still 226.5 MB. Free memory was 125.0 MB in the beginning and 111.3 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3674.44 ms. Allocated memory was 226.5 MB in the beginning and 332.9 MB in the end (delta: 106.4 MB). Free memory was 110.4 MB in the beginning and 132.0 MB in the end (delta: -21.6 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 201267.17 ms. Allocated memory was 332.9 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 132.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3604]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1954]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5975]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 792]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 434]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1406]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1295 locations, 6 error locations. SAFE Result, 201.1s OverallTime, 38 OverallIterations, 2 TraceHistogramMax, 127.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24869 SDtfs, 81695 SDslu, 61646 SDs, 0 SdLazy, 36876 SolverSat, 2458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 691 SyntacticMatches, 30 SemanticMatches, 574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10658 ImplicationChecksByTransitivity, 68.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234258occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 52.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 1250154 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 3235 NumberOfCodeBlocks, 3235 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3506 ConstructedInterpolants, 107 QuantifiedInterpolants, 2733938 SizeOfPredicates, 26 NumberOfNonLiveVariables, 6116 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 44 InterpolantComputations, 35 PerfectInterpolantSequences, 119/158 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...