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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:01:32,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:01:32,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:01:33,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:01:33,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:01:33,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:01:33,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:01:33,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:01:33,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:01:33,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:01:33,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:01:33,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:01:33,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:01:33,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:01:33,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:01:33,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:01:33,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:01:33,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:01:33,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:01:33,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:01:33,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:01:33,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:01:33,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:01:33,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:01:33,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:01:33,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:01:33,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:01:33,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:01:33,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:01:33,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:01:33,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:01:33,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:01:33,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:01:33,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:01:33,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:01:33,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:01:33,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:01:33,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:01:33,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:01:33,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:01:33,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:01:33,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 03:01:33,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:01:33,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:01:33,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:01:33,061 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:01:33,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:01:33,061 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:01:33,062 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:01:33,062 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:01:33,062 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:01:33,062 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:01:33,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:01:33,064 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:01:33,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:01:33,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:01:33,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:01:33,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:01:33,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:01:33,065 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:01:33,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:01:33,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:01:33,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:01:33,066 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:01:33,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:01:33,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:01:33,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:01:33,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:01:33,068 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:01:33,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:01:33,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:01:33,068 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:01:33,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:01:33,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:01:33,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:01:33,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:01:33,139 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:01:33,140 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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-03 03:01:33,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2532cfb89/c7dfa86aafd24ae28cf1253485c16bd8/FLAGa0bf05222 [2019-10-03 03:01:33,790 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:01:33,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-03 03:01:33,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2532cfb89/c7dfa86aafd24ae28cf1253485c16bd8/FLAGa0bf05222 [2019-10-03 03:01:34,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2532cfb89/c7dfa86aafd24ae28cf1253485c16bd8 [2019-10-03 03:01:34,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:01:34,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:01:34,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:34,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:01:34,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:01:34,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:34" (1/1) ... [2019-10-03 03:01:34,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d00367c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:34, skipping insertion in model container [2019-10-03 03:01:34,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:34" (1/1) ... [2019-10-03 03:01:34,131 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:01:34,213 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:01:34,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:34,938 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:01:35,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:35,390 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:01:35,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35 WrapperNode [2019-10-03 03:01:35,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:35,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:01:35,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:01:35,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:01:35,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... [2019-10-03 03:01:35,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... [2019-10-03 03:01:35,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... [2019-10-03 03:01:35,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... [2019-10-03 03:01:35,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... [2019-10-03 03:01:35,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... [2019-10-03 03:01:35,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... [2019-10-03 03:01:35,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:01:35,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:01:35,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:01:35,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:01:35,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:01:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:01:35,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:01:35,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:01:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:01:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:01:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:01:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-03 03:01:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:01:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:01:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:01:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:01:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:01:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:01:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:01:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:01:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:01:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:01:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:01:35,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:01:37,965 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:01:37,967 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:01:37,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:01:37 BoogieIcfgContainer [2019-10-03 03:01:37,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:01:37,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:01:37,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:01:37,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:01:37,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:01:34" (1/3) ... [2019-10-03 03:01:37,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2724096a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:01:37, skipping insertion in model container [2019-10-03 03:01:37,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:35" (2/3) ... [2019-10-03 03:01:37,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2724096a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:01:37, skipping insertion in model container [2019-10-03 03:01:37,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:01:37" (3/3) ... [2019-10-03 03:01:37,981 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-03 03:01:37,992 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:01:38,006 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-03 03:01:38,024 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-03 03:01:38,062 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:01:38,063 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:01:38,063 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:01:38,063 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:01:38,063 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:01:38,063 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:01:38,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:01:38,064 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:01:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states. [2019-10-03 03:01:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 03:01:38,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:38,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:38,112 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:38,118 INFO L82 PathProgramCache]: Analyzing trace with hash -437253728, now seen corresponding path program 1 times [2019-10-03 03:01:38,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:38,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:38,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:38,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:38,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:38,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:38,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:38,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:38,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:38,686 INFO L87 Difference]: Start difference. First operand 446 states. Second operand 3 states. [2019-10-03 03:01:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:38,834 INFO L93 Difference]: Finished difference Result 552 states and 975 transitions. [2019-10-03 03:01:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:38,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-03 03:01:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:38,854 INFO L225 Difference]: With dead ends: 552 [2019-10-03 03:01:38,855 INFO L226 Difference]: Without dead ends: 544 [2019-10-03 03:01:38,857 INFO L640 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-10-03 03:01:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-03 03:01:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 538. [2019-10-03 03:01:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-03 03:01:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 713 transitions. [2019-10-03 03:01:38,934 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 713 transitions. Word has length 53 [2019-10-03 03:01:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:38,935 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 713 transitions. [2019-10-03 03:01:38,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 713 transitions. [2019-10-03 03:01:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 03:01:38,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:38,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:38,940 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:38,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 511312781, now seen corresponding path program 1 times [2019-10-03 03:01:38,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:38,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:38,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:38,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:39,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:39,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:39,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:39,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:39,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:39,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:39,107 INFO L87 Difference]: Start difference. First operand 538 states and 713 transitions. Second operand 3 states. [2019-10-03 03:01:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:39,181 INFO L93 Difference]: Finished difference Result 717 states and 968 transitions. [2019-10-03 03:01:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:39,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-03 03:01:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:39,188 INFO L225 Difference]: With dead ends: 717 [2019-10-03 03:01:39,189 INFO L226 Difference]: Without dead ends: 717 [2019-10-03 03:01:39,189 INFO L640 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-10-03 03:01:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-03 03:01:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 711. [2019-10-03 03:01:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-03 03:01:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 964 transitions. [2019-10-03 03:01:39,228 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 964 transitions. Word has length 53 [2019-10-03 03:01:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:39,229 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 964 transitions. [2019-10-03 03:01:39,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 964 transitions. [2019-10-03 03:01:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 03:01:39,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:39,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:39,233 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:39,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2083769958, now seen corresponding path program 1 times [2019-10-03 03:01:39,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:39,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:39,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:39,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:39,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:39,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:39,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:39,517 INFO L87 Difference]: Start difference. First operand 711 states and 964 transitions. Second operand 10 states. [2019-10-03 03:01:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:41,827 INFO L93 Difference]: Finished difference Result 2114 states and 3049 transitions. [2019-10-03 03:01:41,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:01:41,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-03 03:01:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:41,841 INFO L225 Difference]: With dead ends: 2114 [2019-10-03 03:01:41,842 INFO L226 Difference]: Without dead ends: 2114 [2019-10-03 03:01:41,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:01:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-10-03 03:01:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 722. [2019-10-03 03:01:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-03 03:01:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 978 transitions. [2019-10-03 03:01:41,878 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 978 transitions. Word has length 53 [2019-10-03 03:01:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:41,879 INFO L475 AbstractCegarLoop]: Abstraction has 722 states and 978 transitions. [2019-10-03 03:01:41,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 978 transitions. [2019-10-03 03:01:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 03:01:41,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:41,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:41,882 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:41,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:41,883 INFO L82 PathProgramCache]: Analyzing trace with hash -952135619, now seen corresponding path program 1 times [2019-10-03 03:01:41,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:41,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:41,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:41,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:41,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:41,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:41,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:41,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:41,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:41,969 INFO L87 Difference]: Start difference. First operand 722 states and 978 transitions. Second operand 3 states. [2019-10-03 03:01:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:42,037 INFO L93 Difference]: Finished difference Result 1060 states and 1449 transitions. [2019-10-03 03:01:42,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:42,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-03 03:01:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:42,044 INFO L225 Difference]: With dead ends: 1060 [2019-10-03 03:01:42,044 INFO L226 Difference]: Without dead ends: 1060 [2019-10-03 03:01:42,044 INFO L640 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-10-03 03:01:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-03 03:01:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1053. [2019-10-03 03:01:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-03 03:01:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-03 03:01:42,072 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-03 03:01:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:42,073 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-03 03:01:42,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-03 03:01:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 03:01:42,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:42,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:42,076 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1058176550, now seen corresponding path program 1 times [2019-10-03 03:01:42,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:42,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:42,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:42,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:42,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:42,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:42,262 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 10 states. [2019-10-03 03:01:42,693 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-10-03 03:01:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:44,095 INFO L93 Difference]: Finished difference Result 2367 states and 3324 transitions. [2019-10-03 03:01:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 03:01:44,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-03 03:01:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:44,110 INFO L225 Difference]: With dead ends: 2367 [2019-10-03 03:01:44,110 INFO L226 Difference]: Without dead ends: 2367 [2019-10-03 03:01:44,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:01:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-10-03 03:01:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1053. [2019-10-03 03:01:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-03 03:01:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-03 03:01:44,151 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-03 03:01:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:44,151 INFO L475 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-03 03:01:44,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-03 03:01:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 03:01:44,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:44,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:44,155 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash -609407585, now seen corresponding path program 1 times [2019-10-03 03:01:44,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:44,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:44,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:44,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:44,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:44,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:44,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:01:44,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:44,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:01:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:01:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:01:44,492 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 12 states. [2019-10-03 03:01:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:47,827 INFO L93 Difference]: Finished difference Result 3604 states and 5113 transitions. [2019-10-03 03:01:47,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:01:47,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-03 03:01:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:47,847 INFO L225 Difference]: With dead ends: 3604 [2019-10-03 03:01:47,847 INFO L226 Difference]: Without dead ends: 3604 [2019-10-03 03:01:47,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-03 03:01:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2019-10-03 03:01:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 1069. [2019-10-03 03:01:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-03 03:01:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1467 transitions. [2019-10-03 03:01:47,910 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1467 transitions. Word has length 54 [2019-10-03 03:01:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:47,910 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1467 transitions. [2019-10-03 03:01:47,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:01:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1467 transitions. [2019-10-03 03:01:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 03:01:47,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:47,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:47,913 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:47,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash 963049592, now seen corresponding path program 1 times [2019-10-03 03:01:47,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:48,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:48,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:48,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:48,098 INFO L87 Difference]: Start difference. First operand 1069 states and 1467 transitions. Second operand 9 states. [2019-10-03 03:01:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:49,330 INFO L93 Difference]: Finished difference Result 3298 states and 4667 transitions. [2019-10-03 03:01:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:01:49,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-03 03:01:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:49,352 INFO L225 Difference]: With dead ends: 3298 [2019-10-03 03:01:49,353 INFO L226 Difference]: Without dead ends: 3298 [2019-10-03 03:01:49,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:01:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-10-03 03:01:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 2389. [2019-10-03 03:01:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-10-03 03:01:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3394 transitions. [2019-10-03 03:01:49,417 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3394 transitions. Word has length 54 [2019-10-03 03:01:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:49,417 INFO L475 AbstractCegarLoop]: Abstraction has 2389 states and 3394 transitions. [2019-10-03 03:01:49,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3394 transitions. [2019-10-03 03:01:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:49,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:49,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:49,421 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:49,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1344826450, now seen corresponding path program 1 times [2019-10-03 03:01:49,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:49,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:49,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:01:49,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:49,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:01:49,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:01:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:49,534 INFO L87 Difference]: Start difference. First operand 2389 states and 3394 transitions. Second operand 7 states. [2019-10-03 03:01:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:50,510 INFO L93 Difference]: Finished difference Result 6979 states and 10248 transitions. [2019-10-03 03:01:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:01:50,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-03 03:01:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:50,541 INFO L225 Difference]: With dead ends: 6979 [2019-10-03 03:01:50,541 INFO L226 Difference]: Without dead ends: 6979 [2019-10-03 03:01:50,542 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:01:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-10-03 03:01:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 2390. [2019-10-03 03:01:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-10-03 03:01:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3396 transitions. [2019-10-03 03:01:50,701 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3396 transitions. Word has length 55 [2019-10-03 03:01:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:50,702 INFO L475 AbstractCegarLoop]: Abstraction has 2390 states and 3396 transitions. [2019-10-03 03:01:50,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:01:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3396 transitions. [2019-10-03 03:01:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:50,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:50,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:50,706 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:50,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:50,707 INFO L82 PathProgramCache]: Analyzing trace with hash 698198403, now seen corresponding path program 1 times [2019-10-03 03:01:50,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:50,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:50,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:50,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:50,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:50,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:50,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:50,841 INFO L87 Difference]: Start difference. First operand 2390 states and 3396 transitions. Second operand 9 states. [2019-10-03 03:01:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:52,237 INFO L93 Difference]: Finished difference Result 6171 states and 8931 transitions. [2019-10-03 03:01:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:01:52,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-03 03:01:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:52,267 INFO L225 Difference]: With dead ends: 6171 [2019-10-03 03:01:52,267 INFO L226 Difference]: Without dead ends: 6171 [2019-10-03 03:01:52,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-03 03:01:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2019-10-03 03:01:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 2405. [2019-10-03 03:01:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-10-03 03:01:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3418 transitions. [2019-10-03 03:01:52,362 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3418 transitions. Word has length 55 [2019-10-03 03:01:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:52,362 INFO L475 AbstractCegarLoop]: Abstraction has 2405 states and 3418 transitions. [2019-10-03 03:01:52,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3418 transitions. [2019-10-03 03:01:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:52,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:52,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:52,366 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2110452651, now seen corresponding path program 1 times [2019-10-03 03:01:52,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:52,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:52,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:52,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:52,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:52,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:52,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:52,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:52,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:52,468 INFO L87 Difference]: Start difference. First operand 2405 states and 3418 transitions. Second operand 6 states. [2019-10-03 03:01:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:52,970 INFO L93 Difference]: Finished difference Result 2372 states and 3380 transitions. [2019-10-03 03:01:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:52,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-03 03:01:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:52,977 INFO L225 Difference]: With dead ends: 2372 [2019-10-03 03:01:52,977 INFO L226 Difference]: Without dead ends: 2372 [2019-10-03 03:01:52,978 INFO L640 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-10-03 03:01:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-10-03 03:01:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1715. [2019-10-03 03:01:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-03 03:01:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-03 03:01:53,012 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-03 03:01:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:53,013 INFO L475 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-03 03:01:53,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-03 03:01:53,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:53,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:53,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:53,016 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:53,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:53,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1073379538, now seen corresponding path program 1 times [2019-10-03 03:01:53,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:53,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:53,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:53,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:53,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:53,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:53,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:53,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:53,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:53,173 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 10 states. [2019-10-03 03:01:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:56,017 INFO L93 Difference]: Finished difference Result 7766 states and 11192 transitions. [2019-10-03 03:01:56,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:01:56,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-03 03:01:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:56,033 INFO L225 Difference]: With dead ends: 7766 [2019-10-03 03:01:56,033 INFO L226 Difference]: Without dead ends: 7766 [2019-10-03 03:01:56,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:01:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-10-03 03:01:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 1715. [2019-10-03 03:01:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-03 03:01:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-03 03:01:56,093 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-03 03:01:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:56,093 INFO L475 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-03 03:01:56,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-03 03:01:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:56,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:56,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:56,097 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash -603462302, now seen corresponding path program 1 times [2019-10-03 03:01:56,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:56,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:56,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:56,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:56,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:56,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:56,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:56,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:56,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:56,240 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 9 states. [2019-10-03 03:01:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:57,306 INFO L93 Difference]: Finished difference Result 6251 states and 8963 transitions. [2019-10-03 03:01:57,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:01:57,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-03 03:01:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:57,320 INFO L225 Difference]: With dead ends: 6251 [2019-10-03 03:01:57,321 INFO L226 Difference]: Without dead ends: 6251 [2019-10-03 03:01:57,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-03 03:01:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-10-03 03:01:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 4360. [2019-10-03 03:01:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2019-10-03 03:01:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6289 transitions. [2019-10-03 03:01:57,393 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6289 transitions. Word has length 55 [2019-10-03 03:01:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:57,393 INFO L475 AbstractCegarLoop]: Abstraction has 4360 states and 6289 transitions. [2019-10-03 03:01:57,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6289 transitions. [2019-10-03 03:01:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:01:57,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:57,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:57,399 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:57,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1551481955, now seen corresponding path program 1 times [2019-10-03 03:01:57,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:57,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:57,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:57,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:57,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:57,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:57,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:57,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:57,529 INFO L87 Difference]: Start difference. First operand 4360 states and 6289 transitions. Second operand 9 states. [2019-10-03 03:01:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:59,772 INFO L93 Difference]: Finished difference Result 14521 states and 20619 transitions. [2019-10-03 03:01:59,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:01:59,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-03 03:01:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:59,802 INFO L225 Difference]: With dead ends: 14521 [2019-10-03 03:01:59,802 INFO L226 Difference]: Without dead ends: 14521 [2019-10-03 03:01:59,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:01:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2019-10-03 03:01:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 4374. [2019-10-03 03:01:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-10-03 03:01:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 6307 transitions. [2019-10-03 03:01:59,983 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 6307 transitions. Word has length 55 [2019-10-03 03:01:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:59,984 INFO L475 AbstractCegarLoop]: Abstraction has 4374 states and 6307 transitions. [2019-10-03 03:01:59,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 6307 transitions. [2019-10-03 03:01:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:01:59,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:59,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:59,992 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1949047105, now seen corresponding path program 1 times [2019-10-03 03:01:59,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:59,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:00,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:00,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:02:00,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:00,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:02:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:02:00,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:02:00,119 INFO L87 Difference]: Start difference. First operand 4374 states and 6307 transitions. Second operand 7 states. [2019-10-03 03:02:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:01,091 INFO L93 Difference]: Finished difference Result 13322 states and 19472 transitions. [2019-10-03 03:02:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:02:01,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-03 03:02:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:01,114 INFO L225 Difference]: With dead ends: 13322 [2019-10-03 03:02:01,114 INFO L226 Difference]: Without dead ends: 13322 [2019-10-03 03:02:01,115 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:02:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-10-03 03:02:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 4374. [2019-10-03 03:02:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-10-03 03:02:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 6307 transitions. [2019-10-03 03:02:01,244 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 6307 transitions. Word has length 56 [2019-10-03 03:02:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:01,244 INFO L475 AbstractCegarLoop]: Abstraction has 4374 states and 6307 transitions. [2019-10-03 03:02:01,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:02:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 6307 transitions. [2019-10-03 03:02:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:01,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:01,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:01,250 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash -277042014, now seen corresponding path program 1 times [2019-10-03 03:02:01,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:01,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:01,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:01,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:01,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-10-03 03:02:01,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:01,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:01,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:01,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:01,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:01,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:01,345 INFO L87 Difference]: Start difference. First operand 4374 states and 6307 transitions. Second operand 6 states. [2019-10-03 03:02:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:01,768 INFO L93 Difference]: Finished difference Result 4554 states and 6556 transitions. [2019-10-03 03:02:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:01,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-03 03:02:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:01,779 INFO L225 Difference]: With dead ends: 4554 [2019-10-03 03:02:01,779 INFO L226 Difference]: Without dead ends: 4554 [2019-10-03 03:02:01,782 INFO L640 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-10-03 03:02:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-10-03 03:02:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 3174. [2019-10-03 03:02:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-03 03:02:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4530 transitions. [2019-10-03 03:02:01,836 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4530 transitions. Word has length 56 [2019-10-03 03:02:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:01,836 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4530 transitions. [2019-10-03 03:02:01,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4530 transitions. [2019-10-03 03:02:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:01,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:01,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:01,840 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:01,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1186418740, now seen corresponding path program 1 times [2019-10-03 03:02:01,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:01,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:01,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:01,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 03:02:01,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:01,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 03:02:01,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 03:02:01,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:02:01,956 INFO L87 Difference]: Start difference. First operand 3174 states and 4530 transitions. Second operand 7 states. [2019-10-03 03:02:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:02,656 INFO L93 Difference]: Finished difference Result 9043 states and 13089 transitions. [2019-10-03 03:02:02,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:02:02,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-03 03:02:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:02,670 INFO L225 Difference]: With dead ends: 9043 [2019-10-03 03:02:02,671 INFO L226 Difference]: Without dead ends: 9043 [2019-10-03 03:02:02,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:02:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9043 states. [2019-10-03 03:02:02,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9043 to 3174. [2019-10-03 03:02:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-03 03:02:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4530 transitions. [2019-10-03 03:02:02,748 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4530 transitions. Word has length 56 [2019-10-03 03:02:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:02,749 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4530 transitions. [2019-10-03 03:02:02,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 03:02:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4530 transitions. [2019-10-03 03:02:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:02,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:02,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:02,754 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -901593820, now seen corresponding path program 1 times [2019-10-03 03:02:02,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:02,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:02,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:02,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:02,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:02,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:02,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:02,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:02,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:02,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:02,837 INFO L87 Difference]: Start difference. First operand 3174 states and 4530 transitions. Second operand 5 states. [2019-10-03 03:02:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:03,100 INFO L93 Difference]: Finished difference Result 4263 states and 6049 transitions. [2019-10-03 03:02:03,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:03,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-03 03:02:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:03,105 INFO L225 Difference]: With dead ends: 4263 [2019-10-03 03:02:03,105 INFO L226 Difference]: Without dead ends: 4263 [2019-10-03 03:02:03,107 INFO L640 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-10-03 03:02:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2019-10-03 03:02:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3115. [2019-10-03 03:02:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2019-10-03 03:02:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4421 transitions. [2019-10-03 03:02:03,194 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4421 transitions. Word has length 56 [2019-10-03 03:02:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:03,195 INFO L475 AbstractCegarLoop]: Abstraction has 3115 states and 4421 transitions. [2019-10-03 03:02:03,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4421 transitions. [2019-10-03 03:02:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:03,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:03,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:03,198 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash -977617656, now seen corresponding path program 1 times [2019-10-03 03:02:03,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:03,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:03,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:03,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:03,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:03,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:03,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:03,364 INFO L87 Difference]: Start difference. First operand 3115 states and 4421 transitions. Second operand 9 states. [2019-10-03 03:02:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:04,305 INFO L93 Difference]: Finished difference Result 10040 states and 14571 transitions. [2019-10-03 03:02:04,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:02:04,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-03 03:02:04,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:04,316 INFO L225 Difference]: With dead ends: 10040 [2019-10-03 03:02:04,316 INFO L226 Difference]: Without dead ends: 10040 [2019-10-03 03:02:04,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:02:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2019-10-03 03:02:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 3081. [2019-10-03 03:02:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-10-03 03:02:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4375 transitions. [2019-10-03 03:02:04,391 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4375 transitions. Word has length 57 [2019-10-03 03:02:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:04,392 INFO L475 AbstractCegarLoop]: Abstraction has 3081 states and 4375 transitions. [2019-10-03 03:02:04,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4375 transitions. [2019-10-03 03:02:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:04,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:04,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:04,395 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:04,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2031678240, now seen corresponding path program 1 times [2019-10-03 03:02:04,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:04,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:04,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:04,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:04,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:04,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:04,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:04,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:04,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:04,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:04,599 INFO L87 Difference]: Start difference. First operand 3081 states and 4375 transitions. Second operand 9 states. [2019-10-03 03:02:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:06,035 INFO L93 Difference]: Finished difference Result 6843 states and 9903 transitions. [2019-10-03 03:02:06,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:02:06,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-03 03:02:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:06,043 INFO L225 Difference]: With dead ends: 6843 [2019-10-03 03:02:06,043 INFO L226 Difference]: Without dead ends: 6843 [2019-10-03 03:02:06,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:02:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6843 states. [2019-10-03 03:02:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6843 to 3081. [2019-10-03 03:02:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-10-03 03:02:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4373 transitions. [2019-10-03 03:02:06,102 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4373 transitions. Word has length 57 [2019-10-03 03:02:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:06,102 INFO L475 AbstractCegarLoop]: Abstraction has 3081 states and 4373 transitions. [2019-10-03 03:02:06,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4373 transitions. [2019-10-03 03:02:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:06,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:06,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:06,106 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash -29051147, now seen corresponding path program 1 times [2019-10-03 03:02:06,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:06,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:06,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:06,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:06,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:06,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:02:06,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:06,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:02:06,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:02:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:06,260 INFO L87 Difference]: Start difference. First operand 3081 states and 4373 transitions. Second operand 8 states. [2019-10-03 03:02:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,199 INFO L93 Difference]: Finished difference Result 5806 states and 8314 transitions. [2019-10-03 03:02:07,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 03:02:07,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-03 03:02:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,204 INFO L225 Difference]: With dead ends: 5806 [2019-10-03 03:02:07,205 INFO L226 Difference]: Without dead ends: 5806 [2019-10-03 03:02:07,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-10-03 03:02:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2019-10-03 03:02:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 3081. [2019-10-03 03:02:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-10-03 03:02:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4368 transitions. [2019-10-03 03:02:07,241 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4368 transitions. Word has length 57 [2019-10-03 03:02:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,241 INFO L475 AbstractCegarLoop]: Abstraction has 3081 states and 4368 transitions. [2019-10-03 03:02:07,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:02:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4368 transitions. [2019-10-03 03:02:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:07,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:07,245 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,246 INFO L82 PathProgramCache]: Analyzing trace with hash -640368532, now seen corresponding path program 1 times [2019-10-03 03:02:07,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:07,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:07,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:07,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:07,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:07,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:07,306 INFO L87 Difference]: Start difference. First operand 3081 states and 4368 transitions. Second operand 3 states. [2019-10-03 03:02:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,334 INFO L93 Difference]: Finished difference Result 2976 states and 4143 transitions. [2019-10-03 03:02:07,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:07,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,338 INFO L225 Difference]: With dead ends: 2976 [2019-10-03 03:02:07,338 INFO L226 Difference]: Without dead ends: 2976 [2019-10-03 03:02:07,338 INFO L640 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-10-03 03:02:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-10-03 03:02:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2974. [2019-10-03 03:02:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-03 03:02:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4142 transitions. [2019-10-03 03:02:07,381 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4142 transitions. Word has length 58 [2019-10-03 03:02:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,382 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4142 transitions. [2019-10-03 03:02:07,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4142 transitions. [2019-10-03 03:02:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:07,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:07,386 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,387 INFO L82 PathProgramCache]: Analyzing trace with hash 489288881, now seen corresponding path program 1 times [2019-10-03 03:02:07,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:07,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:07,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:07,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:07,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:07,453 INFO L87 Difference]: Start difference. First operand 2974 states and 4142 transitions. Second operand 3 states. [2019-10-03 03:02:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,502 INFO L93 Difference]: Finished difference Result 2981 states and 4094 transitions. [2019-10-03 03:02:07,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:07,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,507 INFO L225 Difference]: With dead ends: 2981 [2019-10-03 03:02:07,507 INFO L226 Difference]: Without dead ends: 2981 [2019-10-03 03:02:07,508 INFO L640 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-10-03 03:02:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-10-03 03:02:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2974. [2019-10-03 03:02:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-03 03:02:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4089 transitions. [2019-10-03 03:02:07,543 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4089 transitions. Word has length 58 [2019-10-03 03:02:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,544 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4089 transitions. [2019-10-03 03:02:07,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4089 transitions. [2019-10-03 03:02:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:07,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:07,548 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,548 INFO L82 PathProgramCache]: Analyzing trace with hash 599045577, now seen corresponding path program 1 times [2019-10-03 03:02:07,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:07,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:07,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:07,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:07,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:07,611 INFO L87 Difference]: Start difference. First operand 2974 states and 4089 transitions. Second operand 3 states. [2019-10-03 03:02:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,645 INFO L93 Difference]: Finished difference Result 2980 states and 4047 transitions. [2019-10-03 03:02:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:07,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,649 INFO L225 Difference]: With dead ends: 2980 [2019-10-03 03:02:07,649 INFO L226 Difference]: Without dead ends: 2980 [2019-10-03 03:02:07,650 INFO L640 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-10-03 03:02:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2019-10-03 03:02:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2974. [2019-10-03 03:02:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-03 03:02:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4043 transitions. [2019-10-03 03:02:07,684 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4043 transitions. Word has length 58 [2019-10-03 03:02:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,684 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4043 transitions. [2019-10-03 03:02:07,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4043 transitions. [2019-10-03 03:02:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:07,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:07,688 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash -923442394, now seen corresponding path program 1 times [2019-10-03 03:02:07,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:07,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-10-03 03:02:07,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:07,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:07,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:07,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:07,738 INFO L87 Difference]: Start difference. First operand 2974 states and 4043 transitions. Second operand 3 states. [2019-10-03 03:02:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:07,797 INFO L93 Difference]: Finished difference Result 4053 states and 5580 transitions. [2019-10-03 03:02:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:07,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 03:02:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:07,802 INFO L225 Difference]: With dead ends: 4053 [2019-10-03 03:02:07,802 INFO L226 Difference]: Without dead ends: 4053 [2019-10-03 03:02:07,806 INFO L640 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-10-03 03:02:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2019-10-03 03:02:07,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 2913. [2019-10-03 03:02:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2019-10-03 03:02:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3961 transitions. [2019-10-03 03:02:07,848 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3961 transitions. Word has length 60 [2019-10-03 03:02:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:07,848 INFO L475 AbstractCegarLoop]: Abstraction has 2913 states and 3961 transitions. [2019-10-03 03:02:07,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3961 transitions. [2019-10-03 03:02:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:07,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:07,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:07,851 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1191390895, now seen corresponding path program 1 times [2019-10-03 03:02:07,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:07,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:08,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:08,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 03:02:08,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:08,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:02:08,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:02:08,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:08,456 INFO L87 Difference]: Start difference. First operand 2913 states and 3961 transitions. Second operand 18 states. [2019-10-03 03:02:08,661 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2019-10-03 03:02:08,824 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-10-03 03:02:10,446 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-03 03:02:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:14,204 INFO L93 Difference]: Finished difference Result 10099 states and 14163 transitions. [2019-10-03 03:02:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-03 03:02:14,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2019-10-03 03:02:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:14,215 INFO L225 Difference]: With dead ends: 10099 [2019-10-03 03:02:14,215 INFO L226 Difference]: Without dead ends: 10099 [2019-10-03 03:02:14,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:02:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10099 states. [2019-10-03 03:02:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10099 to 2913. [2019-10-03 03:02:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2019-10-03 03:02:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3960 transitions. [2019-10-03 03:02:14,327 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3960 transitions. Word has length 60 [2019-10-03 03:02:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:14,327 INFO L475 AbstractCegarLoop]: Abstraction has 2913 states and 3960 transitions. [2019-10-03 03:02:14,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:02:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3960 transitions. [2019-10-03 03:02:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:14,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:14,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:14,329 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:14,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1883483238, now seen corresponding path program 1 times [2019-10-03 03:02:14,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:14,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:14,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:14,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:14,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:02:14,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:14,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:02:14,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:02:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:02:14,686 INFO L87 Difference]: Start difference. First operand 2913 states and 3960 transitions. Second operand 10 states. [2019-10-03 03:02:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:15,891 INFO L93 Difference]: Finished difference Result 6491 states and 9003 transitions. [2019-10-03 03:02:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:02:15,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-03 03:02:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:15,898 INFO L225 Difference]: With dead ends: 6491 [2019-10-03 03:02:15,899 INFO L226 Difference]: Without dead ends: 6491 [2019-10-03 03:02:15,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2019-10-03 03:02:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 2849. [2019-10-03 03:02:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2849 states. [2019-10-03 03:02:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3885 transitions. [2019-10-03 03:02:15,951 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3885 transitions. Word has length 60 [2019-10-03 03:02:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:15,951 INFO L475 AbstractCegarLoop]: Abstraction has 2849 states and 3885 transitions. [2019-10-03 03:02:15,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:02:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3885 transitions. [2019-10-03 03:02:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:15,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:15,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:15,953 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 611531377, now seen corresponding path program 1 times [2019-10-03 03:02:15,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:16,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:16,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:02:16,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:16,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:16,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:16,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:16,632 INFO L87 Difference]: Start difference. First operand 2849 states and 3885 transitions. Second operand 19 states. [2019-10-03 03:02:16,824 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-10-03 03:02:17,857 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-03 03:02:18,259 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-03 03:02:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,175 INFO L93 Difference]: Finished difference Result 8997 states and 12621 transitions. [2019-10-03 03:02:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:23,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-03 03:02:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:23,185 INFO L225 Difference]: With dead ends: 8997 [2019-10-03 03:02:23,185 INFO L226 Difference]: Without dead ends: 8997 [2019-10-03 03:02:23,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:02:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8997 states. [2019-10-03 03:02:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8997 to 2861. [2019-10-03 03:02:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2861 states. [2019-10-03 03:02:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3902 transitions. [2019-10-03 03:02:23,229 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3902 transitions. Word has length 60 [2019-10-03 03:02:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:23,229 INFO L475 AbstractCegarLoop]: Abstraction has 2861 states and 3902 transitions. [2019-10-03 03:02:23,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:02:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3902 transitions. [2019-10-03 03:02:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:23,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:23,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:23,232 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:23,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1339672722, now seen corresponding path program 1 times [2019-10-03 03:02:23,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:23,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:23,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:23,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:23,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:23,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:23,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:23,289 INFO L87 Difference]: Start difference. First operand 2861 states and 3902 transitions. Second operand 3 states. [2019-10-03 03:02:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:23,355 INFO L93 Difference]: Finished difference Result 3905 states and 5396 transitions. [2019-10-03 03:02:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:23,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 03:02:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:23,361 INFO L225 Difference]: With dead ends: 3905 [2019-10-03 03:02:23,361 INFO L226 Difference]: Without dead ends: 3905 [2019-10-03 03:02:23,361 INFO L640 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-10-03 03:02:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-10-03 03:02:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 2769. [2019-10-03 03:02:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2019-10-03 03:02:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 3786 transitions. [2019-10-03 03:02:23,398 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 3786 transitions. Word has length 60 [2019-10-03 03:02:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:23,398 INFO L475 AbstractCegarLoop]: Abstraction has 2769 states and 3786 transitions. [2019-10-03 03:02:23,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 3786 transitions. [2019-10-03 03:02:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:02:23,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:23,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:23,401 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash 393961661, now seen corresponding path program 1 times [2019-10-03 03:02:23,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:23,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:23,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:24,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:24,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 03:02:24,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:24,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:02:24,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:02:24,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:02:24,199 INFO L87 Difference]: Start difference. First operand 2769 states and 3786 transitions. Second operand 15 states. [2019-10-03 03:02:24,783 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-03 03:02:25,011 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:02:25,224 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:02:25,509 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-03 03:02:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:27,618 INFO L93 Difference]: Finished difference Result 9147 states and 12778 transitions. [2019-10-03 03:02:27,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:02:27,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2019-10-03 03:02:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:27,628 INFO L225 Difference]: With dead ends: 9147 [2019-10-03 03:02:27,629 INFO L226 Difference]: Without dead ends: 9147 [2019-10-03 03:02:27,629 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2019-10-03 03:02:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9147 states. [2019-10-03 03:02:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9147 to 2760. [2019-10-03 03:02:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-10-03 03:02:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3774 transitions. [2019-10-03 03:02:27,673 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3774 transitions. Word has length 61 [2019-10-03 03:02:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:27,673 INFO L475 AbstractCegarLoop]: Abstraction has 2760 states and 3774 transitions. [2019-10-03 03:02:27,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:02:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3774 transitions. [2019-10-03 03:02:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:02:27,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:27,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:27,677 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:27,677 INFO L82 PathProgramCache]: Analyzing trace with hash 837436388, now seen corresponding path program 1 times [2019-10-03 03:02:27,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:27,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:27,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-10-03 03:02:27,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:27,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:27,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:27,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:27,767 INFO L87 Difference]: Start difference. First operand 2760 states and 3774 transitions. Second operand 6 states. [2019-10-03 03:02:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:27,911 INFO L93 Difference]: Finished difference Result 9346 states and 12815 transitions. [2019-10-03 03:02:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:02:27,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-03 03:02:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:27,920 INFO L225 Difference]: With dead ends: 9346 [2019-10-03 03:02:27,920 INFO L226 Difference]: Without dead ends: 9346 [2019-10-03 03:02:27,921 INFO L640 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-10-03 03:02:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9346 states. [2019-10-03 03:02:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9346 to 7178. [2019-10-03 03:02:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7178 states. [2019-10-03 03:02:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7178 states to 7178 states and 9824 transitions. [2019-10-03 03:02:27,987 INFO L78 Accepts]: Start accepts. Automaton has 7178 states and 9824 transitions. Word has length 67 [2019-10-03 03:02:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:27,987 INFO L475 AbstractCegarLoop]: Abstraction has 7178 states and 9824 transitions. [2019-10-03 03:02:27,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 7178 states and 9824 transitions. [2019-10-03 03:02:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 03:02:27,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:27,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:27,991 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2044258828, now seen corresponding path program 1 times [2019-10-03 03:02:27,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:28,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:28,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:28,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:28,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:28,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:28,098 INFO L87 Difference]: Start difference. First operand 7178 states and 9824 transitions. Second operand 5 states. [2019-10-03 03:02:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:28,241 INFO L93 Difference]: Finished difference Result 6800 states and 9322 transitions. [2019-10-03 03:02:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:28,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-03 03:02:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:28,247 INFO L225 Difference]: With dead ends: 6800 [2019-10-03 03:02:28,247 INFO L226 Difference]: Without dead ends: 6800 [2019-10-03 03:02:28,248 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6800 states. [2019-10-03 03:02:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6800 to 6796. [2019-10-03 03:02:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6796 states. [2019-10-03 03:02:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 9320 transitions. [2019-10-03 03:02:28,339 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 9320 transitions. Word has length 68 [2019-10-03 03:02:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:28,339 INFO L475 AbstractCegarLoop]: Abstraction has 6796 states and 9320 transitions. [2019-10-03 03:02:28,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 9320 transitions. [2019-10-03 03:02:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 03:02:28,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:28,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:28,343 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash -211315705, now seen corresponding path program 1 times [2019-10-03 03:02:28,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:28,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:28,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:28,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:28,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:28,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:28,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:28,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:28,435 INFO L87 Difference]: Start difference. First operand 6796 states and 9320 transitions. Second operand 6 states. [2019-10-03 03:02:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:28,531 INFO L93 Difference]: Finished difference Result 12490 states and 16864 transitions. [2019-10-03 03:02:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:28,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-10-03 03:02:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:28,543 INFO L225 Difference]: With dead ends: 12490 [2019-10-03 03:02:28,543 INFO L226 Difference]: Without dead ends: 12490 [2019-10-03 03:02:28,543 INFO L640 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-10-03 03:02:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12490 states. [2019-10-03 03:02:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12490 to 6961. [2019-10-03 03:02:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6961 states. [2019-10-03 03:02:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6961 states to 6961 states and 9430 transitions. [2019-10-03 03:02:28,629 INFO L78 Accepts]: Start accepts. Automaton has 6961 states and 9430 transitions. Word has length 69 [2019-10-03 03:02:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:28,629 INFO L475 AbstractCegarLoop]: Abstraction has 6961 states and 9430 transitions. [2019-10-03 03:02:28,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6961 states and 9430 transitions. [2019-10-03 03:02:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 03:02:28,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:28,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:28,633 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash -243529560, now seen corresponding path program 1 times [2019-10-03 03:02:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:28,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:28,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:28,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:28,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:28,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:28,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:28,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:28,690 INFO L87 Difference]: Start difference. First operand 6961 states and 9430 transitions. Second operand 3 states. [2019-10-03 03:02:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:28,752 INFO L93 Difference]: Finished difference Result 11698 states and 15575 transitions. [2019-10-03 03:02:28,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:28,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-03 03:02:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:28,767 INFO L225 Difference]: With dead ends: 11698 [2019-10-03 03:02:28,767 INFO L226 Difference]: Without dead ends: 11698 [2019-10-03 03:02:28,767 INFO L640 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-10-03 03:02:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11698 states. [2019-10-03 03:02:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11698 to 11551. [2019-10-03 03:02:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11551 states. [2019-10-03 03:02:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 15429 transitions. [2019-10-03 03:02:28,884 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 15429 transitions. Word has length 70 [2019-10-03 03:02:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:28,884 INFO L475 AbstractCegarLoop]: Abstraction has 11551 states and 15429 transitions. [2019-10-03 03:02:28,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 15429 transitions. [2019-10-03 03:02:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 03:02:28,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:28,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:28,889 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:28,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:28,889 INFO L82 PathProgramCache]: Analyzing trace with hash 113735652, now seen corresponding path program 1 times [2019-10-03 03:02:28,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:28,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:28,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:28,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:28,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:28,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:28,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:28,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:28,954 INFO L87 Difference]: Start difference. First operand 11551 states and 15429 transitions. Second operand 5 states. [2019-10-03 03:02:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:29,269 INFO L93 Difference]: Finished difference Result 25025 states and 32738 transitions. [2019-10-03 03:02:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:29,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-03 03:02:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:29,295 INFO L225 Difference]: With dead ends: 25025 [2019-10-03 03:02:29,296 INFO L226 Difference]: Without dead ends: 25025 [2019-10-03 03:02:29,296 INFO L640 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-10-03 03:02:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2019-10-03 03:02:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 14509. [2019-10-03 03:02:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14509 states. [2019-10-03 03:02:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14509 states to 14509 states and 19115 transitions. [2019-10-03 03:02:29,470 INFO L78 Accepts]: Start accepts. Automaton has 14509 states and 19115 transitions. Word has length 71 [2019-10-03 03:02:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:29,471 INFO L475 AbstractCegarLoop]: Abstraction has 14509 states and 19115 transitions. [2019-10-03 03:02:29,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14509 states and 19115 transitions. [2019-10-03 03:02:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 03:02:29,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:29,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:29,476 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash -31702857, now seen corresponding path program 1 times [2019-10-03 03:02:29,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:29,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:29,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:29,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:29,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:29,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:29,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:29,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:29,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:29,530 INFO L87 Difference]: Start difference. First operand 14509 states and 19115 transitions. Second operand 3 states. [2019-10-03 03:02:29,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:29,618 INFO L93 Difference]: Finished difference Result 26890 states and 34853 transitions. [2019-10-03 03:02:29,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:29,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-03 03:02:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:29,654 INFO L225 Difference]: With dead ends: 26890 [2019-10-03 03:02:29,654 INFO L226 Difference]: Without dead ends: 26890 [2019-10-03 03:02:29,655 INFO L640 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-10-03 03:02:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-10-03 03:02:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 20637. [2019-10-03 03:02:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20637 states. [2019-10-03 03:02:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20637 states to 20637 states and 26919 transitions. [2019-10-03 03:02:29,856 INFO L78 Accepts]: Start accepts. Automaton has 20637 states and 26919 transitions. Word has length 72 [2019-10-03 03:02:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:29,856 INFO L475 AbstractCegarLoop]: Abstraction has 20637 states and 26919 transitions. [2019-10-03 03:02:29,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 20637 states and 26919 transitions. [2019-10-03 03:02:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 03:02:29,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:29,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:29,862 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1262178169, now seen corresponding path program 1 times [2019-10-03 03:02:29,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:29,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:29,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:29,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:29,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:29,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:29,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:29,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:29,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:29,918 INFO L87 Difference]: Start difference. First operand 20637 states and 26919 transitions. Second operand 3 states. [2019-10-03 03:02:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:30,120 INFO L93 Difference]: Finished difference Result 38349 states and 49048 transitions. [2019-10-03 03:02:30,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:30,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-03 03:02:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:30,163 INFO L225 Difference]: With dead ends: 38349 [2019-10-03 03:02:30,163 INFO L226 Difference]: Without dead ends: 38349 [2019-10-03 03:02:30,163 INFO L640 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-10-03 03:02:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38349 states. [2019-10-03 03:02:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38349 to 35452. [2019-10-03 03:02:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35452 states. [2019-10-03 03:02:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35452 states to 35452 states and 45546 transitions. [2019-10-03 03:02:30,439 INFO L78 Accepts]: Start accepts. Automaton has 35452 states and 45546 transitions. Word has length 74 [2019-10-03 03:02:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:30,440 INFO L475 AbstractCegarLoop]: Abstraction has 35452 states and 45546 transitions. [2019-10-03 03:02:30,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 35452 states and 45546 transitions. [2019-10-03 03:02:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 03:02:30,443 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:30,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:30,444 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -617067464, now seen corresponding path program 1 times [2019-10-03 03:02:30,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:30,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:30,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:30,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:30,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:30,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:30,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:30,499 INFO L87 Difference]: Start difference. First operand 35452 states and 45546 transitions. Second operand 3 states. [2019-10-03 03:02:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:30,607 INFO L93 Difference]: Finished difference Result 41081 states and 51314 transitions. [2019-10-03 03:02:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:30,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-03 03:02:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:30,644 INFO L225 Difference]: With dead ends: 41081 [2019-10-03 03:02:30,645 INFO L226 Difference]: Without dead ends: 41081 [2019-10-03 03:02:30,645 INFO L640 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-10-03 03:02:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41081 states. [2019-10-03 03:02:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41081 to 39125. [2019-10-03 03:02:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39125 states. [2019-10-03 03:02:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39125 states to 39125 states and 49359 transitions. [2019-10-03 03:02:30,968 INFO L78 Accepts]: Start accepts. Automaton has 39125 states and 49359 transitions. Word has length 75 [2019-10-03 03:02:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:30,968 INFO L475 AbstractCegarLoop]: Abstraction has 39125 states and 49359 transitions. [2019-10-03 03:02:30,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 39125 states and 49359 transitions. [2019-10-03 03:02:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:02:30,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:30,975 INFO L411 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] [2019-10-03 03:02:30,975 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:30,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:30,976 INFO L82 PathProgramCache]: Analyzing trace with hash 59399319, now seen corresponding path program 1 times [2019-10-03 03:02:30,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:30,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-03 03:02:31,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:31,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:31,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:31,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:31,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:31,095 INFO L87 Difference]: Start difference. First operand 39125 states and 49359 transitions. Second operand 9 states. [2019-10-03 03:02:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:32,477 INFO L93 Difference]: Finished difference Result 167488 states and 210972 transitions. [2019-10-03 03:02:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:02:32,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-10-03 03:02:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:32,663 INFO L225 Difference]: With dead ends: 167488 [2019-10-03 03:02:32,663 INFO L226 Difference]: Without dead ends: 167488 [2019-10-03 03:02:32,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-10-03 03:02:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167488 states. [2019-10-03 03:02:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167488 to 39095. [2019-10-03 03:02:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39095 states. [2019-10-03 03:02:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39095 states to 39095 states and 49323 transitions. [2019-10-03 03:02:33,516 INFO L78 Accepts]: Start accepts. Automaton has 39095 states and 49323 transitions. Word has length 93 [2019-10-03 03:02:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:33,516 INFO L475 AbstractCegarLoop]: Abstraction has 39095 states and 49323 transitions. [2019-10-03 03:02:33,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 39095 states and 49323 transitions. [2019-10-03 03:02:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:02:34,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:34,448 INFO L411 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] [2019-10-03 03:02:34,448 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2071096031, now seen corresponding path program 1 times [2019-10-03 03:02:34,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:34,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:34,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:34,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:34,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:02:34,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:34,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:02:34,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:02:34,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:02:34,671 INFO L87 Difference]: Start difference. First operand 39095 states and 49323 transitions. Second operand 10 states. [2019-10-03 03:02:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:36,575 INFO L93 Difference]: Finished difference Result 93970 states and 117505 transitions. [2019-10-03 03:02:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 03:02:36,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-03 03:02:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:36,679 INFO L225 Difference]: With dead ends: 93970 [2019-10-03 03:02:36,679 INFO L226 Difference]: Without dead ends: 93970 [2019-10-03 03:02:36,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2019-10-03 03:02:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93970 states. [2019-10-03 03:02:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93970 to 52249. [2019-10-03 03:02:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52249 states. [2019-10-03 03:02:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52249 states to 52249 states and 65911 transitions. [2019-10-03 03:02:38,818 INFO L78 Accepts]: Start accepts. Automaton has 52249 states and 65911 transitions. Word has length 94 [2019-10-03 03:02:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:38,818 INFO L475 AbstractCegarLoop]: Abstraction has 52249 states and 65911 transitions. [2019-10-03 03:02:38,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:02:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 52249 states and 65911 transitions. [2019-10-03 03:02:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:02:38,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:38,826 INFO L411 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] [2019-10-03 03:02:38,827 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1782821772, now seen corresponding path program 1 times [2019-10-03 03:02:38,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:38,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:38,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:38,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:38,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:39,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:39,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:39,020 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-10-03 03:02:39,023 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [105], [108], [112], [125], [128], [141], [144], [147], [157], [160], [163], [167], [169], [190], [193], [204], [206], [209], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [257], [269], [271], [296], [301], [314], [316], [329], [337], [356], [367], [369], [372], [375], [378], [380], [382], [424], [437], [445], [468], [531], [661], [1355], [1359], [1362], [1365], [1368], [1372], [1410], [1438], [1441], [1444], [1448], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:02:39,079 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:39,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:39,223 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:39,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:39,644 INFO L272 AbstractInterpreter]: Visited 88 different actions 306 times. Merged at 33 different actions 196 times. Widened at 12 different actions 28 times. Performed 1238 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 10 different actions. Largest state had 220 variables. [2019-10-03 03:02:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:39,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:39,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:39,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:39,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:39,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:39,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:02:39,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:40,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:40,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:40,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:41,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:41,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:41,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:41,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:41,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:41,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-10-03 03:02:41,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:41,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:02:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:02:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-10-03 03:02:41,188 INFO L87 Difference]: Start difference. First operand 52249 states and 65911 transitions. Second operand 18 states. [2019-10-03 03:02:43,428 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-10-03 03:02:44,024 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-10-03 03:02:45,618 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-03 03:02:46,364 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-03 03:02:47,471 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:02:47,753 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-10-03 03:02:48,183 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:02:49,219 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-10-03 03:02:49,610 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:02:50,655 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:02:51,088 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-03 03:02:51,779 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:02:52,228 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-03 03:02:53,592 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-03 03:02:53,837 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-03 03:02:54,657 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:02:54,838 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:02:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:55,097 INFO L93 Difference]: Finished difference Result 204464 states and 254814 transitions. [2019-10-03 03:02:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-03 03:02:55,099 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2019-10-03 03:02:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:55,818 INFO L225 Difference]: With dead ends: 204464 [2019-10-03 03:02:55,818 INFO L226 Difference]: Without dead ends: 204464 [2019-10-03 03:02:55,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 168 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1894, Invalid=6662, Unknown=0, NotChecked=0, Total=8556 [2019-10-03 03:02:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204464 states. [2019-10-03 03:02:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204464 to 66971. [2019-10-03 03:02:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66971 states. [2019-10-03 03:02:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66971 states to 66971 states and 84525 transitions. [2019-10-03 03:02:57,996 INFO L78 Accepts]: Start accepts. Automaton has 66971 states and 84525 transitions. Word has length 94 [2019-10-03 03:02:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:57,996 INFO L475 AbstractCegarLoop]: Abstraction has 66971 states and 84525 transitions. [2019-10-03 03:02:57,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:02:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 66971 states and 84525 transitions. [2019-10-03 03:02:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:02:58,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:58,011 INFO L411 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] [2019-10-03 03:02:58,012 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2059708354, now seen corresponding path program 1 times [2019-10-03 03:02:58,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:58,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:58,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:58,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:58,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:58,137 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-10-03 03:02:58,138 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [105], [108], [112], [115], [125], [128], [141], [144], [157], [160], [163], [167], [169], [190], [193], [204], [206], [209], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [257], [267], [271], [296], [301], [314], [316], [319], [322], [325], [327], [329], [367], [369], [382], [390], [409], [424], [437], [445], [470], [531], [659], [1355], [1359], [1537], [1635], [1639], [1642], [1645], [1648], [1651], [1654], [1658], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:02:58,148 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:58,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:58,215 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:58,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:58,471 INFO L272 AbstractInterpreter]: Visited 89 different actions 269 times. Merged at 34 different actions 163 times. Widened at 8 different actions 16 times. Performed 1129 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1129 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 8 different actions. Largest state had 220 variables. [2019-10-03 03:02:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:58,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:58,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:58,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:58,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:58,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:58,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 03:02:58,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:58,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:58,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:58,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-10-03 03:02:58,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:58,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:58,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:58,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:58,855 INFO L87 Difference]: Start difference. First operand 66971 states and 84525 transitions. Second operand 6 states. [2019-10-03 03:02:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:59,423 INFO L93 Difference]: Finished difference Result 121353 states and 151043 transitions. [2019-10-03 03:02:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:02:59,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 03:02:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:59,566 INFO L225 Difference]: With dead ends: 121353 [2019-10-03 03:02:59,566 INFO L226 Difference]: Without dead ends: 121353 [2019-10-03 03:02:59,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121353 states. [2019-10-03 03:03:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121353 to 95995. [2019-10-03 03:03:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95995 states. [2019-10-03 03:03:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95995 states to 95995 states and 120947 transitions. [2019-10-03 03:03:00,480 INFO L78 Accepts]: Start accepts. Automaton has 95995 states and 120947 transitions. Word has length 95 [2019-10-03 03:03:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:00,480 INFO L475 AbstractCegarLoop]: Abstraction has 95995 states and 120947 transitions. [2019-10-03 03:03:00,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:03:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 95995 states and 120947 transitions. [2019-10-03 03:03:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:03:00,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:00,488 INFO L411 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] [2019-10-03 03:03:00,489 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1535026927, now seen corresponding path program 1 times [2019-10-03 03:03:00,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:00,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:00,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:00,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:00,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:00,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:00,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:00,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:00,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:00,554 INFO L87 Difference]: Start difference. First operand 95995 states and 120947 transitions. Second operand 5 states. [2019-10-03 03:03:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:01,448 INFO L93 Difference]: Finished difference Result 114161 states and 140452 transitions. [2019-10-03 03:03:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:03:01,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-03 03:03:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:01,583 INFO L225 Difference]: With dead ends: 114161 [2019-10-03 03:03:01,584 INFO L226 Difference]: Without dead ends: 114161 [2019-10-03 03:03:01,584 INFO L640 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-10-03 03:03:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114161 states. [2019-10-03 03:03:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114161 to 90325. [2019-10-03 03:03:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90325 states. [2019-10-03 03:03:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90325 states to 90325 states and 111876 transitions. [2019-10-03 03:03:02,370 INFO L78 Accepts]: Start accepts. Automaton has 90325 states and 111876 transitions. Word has length 96 [2019-10-03 03:03:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:02,370 INFO L475 AbstractCegarLoop]: Abstraction has 90325 states and 111876 transitions. [2019-10-03 03:03:02,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 90325 states and 111876 transitions. [2019-10-03 03:03:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 03:03:02,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:02,380 INFO L411 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, 1, 1, 1] [2019-10-03 03:03:02,380 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1116081128, now seen corresponding path program 1 times [2019-10-03 03:03:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:02,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:03:02,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:02,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:02,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:02,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:02,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:02,484 INFO L87 Difference]: Start difference. First operand 90325 states and 111876 transitions. Second operand 5 states. [2019-10-03 03:03:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:03,003 INFO L93 Difference]: Finished difference Result 96768 states and 117725 transitions. [2019-10-03 03:03:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:03:03,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-03 03:03:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:03,095 INFO L225 Difference]: With dead ends: 96768 [2019-10-03 03:03:03,096 INFO L226 Difference]: Without dead ends: 96768 [2019-10-03 03:03:03,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96768 states. [2019-10-03 03:03:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96768 to 82177. [2019-10-03 03:03:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82177 states. [2019-10-03 03:03:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82177 states to 82177 states and 100993 transitions. [2019-10-03 03:03:04,224 INFO L78 Accepts]: Start accepts. Automaton has 82177 states and 100993 transitions. Word has length 100 [2019-10-03 03:03:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:04,225 INFO L475 AbstractCegarLoop]: Abstraction has 82177 states and 100993 transitions. [2019-10-03 03:03:04,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 82177 states and 100993 transitions. [2019-10-03 03:03:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:03:04,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:04,231 INFO L411 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, 1, 1, 1, 1] [2019-10-03 03:03:04,231 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:04,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1168651020, now seen corresponding path program 1 times [2019-10-03 03:03:04,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:04,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:04,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 03:03:04,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:04,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:04,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:04,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:04,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:04,327 INFO L87 Difference]: Start difference. First operand 82177 states and 100993 transitions. Second operand 5 states. [2019-10-03 03:03:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:04,826 INFO L93 Difference]: Finished difference Result 125008 states and 153629 transitions. [2019-10-03 03:03:04,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:04,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-03 03:03:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:05,018 INFO L225 Difference]: With dead ends: 125008 [2019-10-03 03:03:05,019 INFO L226 Difference]: Without dead ends: 125008 [2019-10-03 03:03:05,019 INFO L640 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-10-03 03:03:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125008 states. [2019-10-03 03:03:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125008 to 99518. [2019-10-03 03:03:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99518 states. [2019-10-03 03:03:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99518 states to 99518 states and 122254 transitions. [2019-10-03 03:03:06,666 INFO L78 Accepts]: Start accepts. Automaton has 99518 states and 122254 transitions. Word has length 101 [2019-10-03 03:03:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:06,667 INFO L475 AbstractCegarLoop]: Abstraction has 99518 states and 122254 transitions. [2019-10-03 03:03:06,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 99518 states and 122254 transitions. [2019-10-03 03:03:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 03:03:06,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:06,674 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-03 03:03:06,674 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1741693734, now seen corresponding path program 1 times [2019-10-03 03:03:06,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:06,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:06,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:06,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:06,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:06,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:06,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:06,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:06,759 INFO L87 Difference]: Start difference. First operand 99518 states and 122254 transitions. Second operand 5 states. [2019-10-03 03:03:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:07,253 INFO L93 Difference]: Finished difference Result 143049 states and 175763 transitions. [2019-10-03 03:03:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:07,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-03 03:03:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:07,432 INFO L225 Difference]: With dead ends: 143049 [2019-10-03 03:03:07,432 INFO L226 Difference]: Without dead ends: 143049 [2019-10-03 03:03:07,433 INFO L640 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-10-03 03:03:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143049 states. [2019-10-03 03:03:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143049 to 124159. [2019-10-03 03:03:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124159 states. [2019-10-03 03:03:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124159 states to 124159 states and 152380 transitions. [2019-10-03 03:03:11,153 INFO L78 Accepts]: Start accepts. Automaton has 124159 states and 152380 transitions. Word has length 102 [2019-10-03 03:03:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:11,154 INFO L475 AbstractCegarLoop]: Abstraction has 124159 states and 152380 transitions. [2019-10-03 03:03:11,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 124159 states and 152380 transitions. [2019-10-03 03:03:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 03:03:11,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:11,165 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:11,166 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash 210595238, now seen corresponding path program 1 times [2019-10-03 03:03:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:11,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:11,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:11,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:11,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-10-03 03:03:11,234 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [105], [108], [112], [115], [118], [121], [123], [125], [128], [141], [144], [157], [160], [163], [167], [169], [190], [193], [204], [206], [209], [212], [215], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [257], [260], [263], [271], [303], [305], [308], [316], [319], [322], [325], [327], [329], [367], [369], [382], [390], [409], [424], [427], [430], [433], [435], [437], [470], [531], [808], [906], [910], [913], [916], [919], [922], [925], [929], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:03:11,243 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:11,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:11,280 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:11,406 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:03:11,407 INFO L272 AbstractInterpreter]: Visited 95 different actions 186 times. Merged at 30 different actions 80 times. Never widened. Performed 835 root evaluator evaluations with a maximum evaluation depth of 5. Performed 835 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 222 variables. [2019-10-03 03:03:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:11,407 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:03:11,895 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 92.5% of their original sizes. [2019-10-03 03:03:11,895 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:03:16,299 INFO L420 sIntCurrentIteration]: We unified 104 AI predicates to 104 [2019-10-03 03:03:16,299 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:03:16,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:16,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [59] imperfect sequences [5] total 62 [2019-10-03 03:03:16,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:16,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-03 03:03:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-03 03:03:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3105, Unknown=0, NotChecked=0, Total=3422 [2019-10-03 03:03:16,303 INFO L87 Difference]: Start difference. First operand 124159 states and 152380 transitions. Second operand 59 states. [2019-10-03 03:04:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:53,505 INFO L93 Difference]: Finished difference Result 174150 states and 212326 transitions. [2019-10-03 03:04:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 411 states. [2019-10-03 03:04:53,505 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 105 [2019-10-03 03:04:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:53,730 INFO L225 Difference]: With dead ends: 174150 [2019-10-03 03:04:53,730 INFO L226 Difference]: Without dead ends: 174150 [2019-10-03 03:04:53,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86998 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=20329, Invalid=177251, Unknown=0, NotChecked=0, Total=197580 [2019-10-03 03:04:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174150 states. [2019-10-03 03:04:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174150 to 127367. [2019-10-03 03:04:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127367 states. [2019-10-03 03:04:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127367 states to 127367 states and 156010 transitions. [2019-10-03 03:04:55,403 INFO L78 Accepts]: Start accepts. Automaton has 127367 states and 156010 transitions. Word has length 105 [2019-10-03 03:04:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:55,403 INFO L475 AbstractCegarLoop]: Abstraction has 127367 states and 156010 transitions. [2019-10-03 03:04:55,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-03 03:04:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 127367 states and 156010 transitions. [2019-10-03 03:04:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 03:04:55,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:55,415 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:55,416 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash 540690948, now seen corresponding path program 1 times [2019-10-03 03:04:55,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:55,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:55,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:55,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:55,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:55,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:55,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:55,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-10-03 03:04:55,481 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [105], [108], [112], [115], [118], [123], [125], [128], [141], [144], [157], [160], [163], [167], [169], [190], [193], [204], [206], [209], [212], [215], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [257], [260], [263], [271], [303], [305], [308], [316], [319], [322], [325], [327], [329], [367], [369], [382], [390], [409], [424], [427], [430], [433], [435], [437], [470], [531], [534], [657], [808], [906], [910], [913], [916], [919], [922], [925], [929], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:04:55,483 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:55,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:55,512 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:55,605 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:04:55,605 INFO L272 AbstractInterpreter]: Visited 96 different actions 187 times. Merged at 30 different actions 80 times. Never widened. Performed 835 root evaluator evaluations with a maximum evaluation depth of 5. Performed 835 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 3 different actions. Largest state had 222 variables. [2019-10-03 03:04:55,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:55,606 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:04:55,906 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 92.34% of their original sizes. [2019-10-03 03:04:55,906 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:04:59,981 INFO L420 sIntCurrentIteration]: We unified 105 AI predicates to 105 [2019-10-03 03:04:59,981 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:04:59,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:04:59,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [59] imperfect sequences [5] total 62 [2019-10-03 03:04:59,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:59,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-03 03:04:59,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-03 03:04:59,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=3086, Unknown=0, NotChecked=0, Total=3422 [2019-10-03 03:04:59,982 INFO L87 Difference]: Start difference. First operand 127367 states and 156010 transitions. Second operand 59 states. [2019-10-03 03:06:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:25,779 INFO L93 Difference]: Finished difference Result 169163 states and 205882 transitions. [2019-10-03 03:06:25,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2019-10-03 03:06:25,779 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 106 [2019-10-03 03:06:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:25,994 INFO L225 Difference]: With dead ends: 169163 [2019-10-03 03:06:25,994 INFO L226 Difference]: Without dead ends: 169163 [2019-10-03 03:06:26,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76124 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=17393, Invalid=154417, Unknown=0, NotChecked=0, Total=171810 [2019-10-03 03:06:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169163 states. [2019-10-03 03:06:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169163 to 127522. [2019-10-03 03:06:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127522 states. [2019-10-03 03:06:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127522 states to 127522 states and 156161 transitions. [2019-10-03 03:06:27,258 INFO L78 Accepts]: Start accepts. Automaton has 127522 states and 156161 transitions. Word has length 106 [2019-10-03 03:06:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:27,258 INFO L475 AbstractCegarLoop]: Abstraction has 127522 states and 156161 transitions. [2019-10-03 03:06:27,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-03 03:06:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 127522 states and 156161 transitions. [2019-10-03 03:06:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 03:06:27,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:27,268 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:06:27,268 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:27,268 INFO L82 PathProgramCache]: Analyzing trace with hash 10257984, now seen corresponding path program 1 times [2019-10-03 03:06:27,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:27,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:27,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:06:27,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:27,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:06:27,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:27,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:06:27,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:06:27,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:06:27,327 INFO L87 Difference]: Start difference. First operand 127522 states and 156161 transitions. Second operand 4 states. [2019-10-03 03:06:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:28,483 INFO L93 Difference]: Finished difference Result 185397 states and 227134 transitions. [2019-10-03 03:06:28,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:06:28,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-03 03:06:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:28,692 INFO L225 Difference]: With dead ends: 185397 [2019-10-03 03:06:28,692 INFO L226 Difference]: Without dead ends: 185397 [2019-10-03 03:06:28,692 INFO L640 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-10-03 03:06:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185397 states. [2019-10-03 03:06:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185397 to 127524. [2019-10-03 03:06:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127524 states. [2019-10-03 03:06:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127524 states to 127524 states and 156163 transitions. [2019-10-03 03:06:29,997 INFO L78 Accepts]: Start accepts. Automaton has 127524 states and 156163 transitions. Word has length 106 [2019-10-03 03:06:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:29,997 INFO L475 AbstractCegarLoop]: Abstraction has 127524 states and 156163 transitions. [2019-10-03 03:06:29,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:06:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 127524 states and 156163 transitions. [2019-10-03 03:06:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-03 03:06:30,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:30,007 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:06:30,007 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1731588859, now seen corresponding path program 1 times [2019-10-03 03:06:30,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:30,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:30,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:06:30,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:06:30,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-10-03 03:06:30,225 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [105], [108], [112], [125], [128], [131], [134], [169], [190], [193], [204], [206], [209], [212], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [257], [260], [263], [271], [303], [312], [316], [329], [337], [340], [343], [346], [348], [367], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [473], [476], [479], [482], [492], [495], [498], [502], [522], [661], [681], [709], [712], [715], [719], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:06:30,229 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:06:30,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:06:30,260 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:06:30,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:06:30,550 INFO L272 AbstractInterpreter]: Visited 101 different actions 412 times. Merged at 39 different actions 282 times. Widened at 15 different actions 46 times. Performed 1517 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1517 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 12 different actions. Largest state had 223 variables. [2019-10-03 03:06:30,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:30,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:06:30,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:06:30,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:06:30,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:30,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:06:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:06:30,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:06:31,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:32,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:06:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:32,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:33,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:06:33,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 28 [2019-10-03 03:06:33,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:06:33,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 03:06:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 03:06:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2019-10-03 03:06:33,307 INFO L87 Difference]: Start difference. First operand 127524 states and 156163 transitions. Second operand 21 states. [2019-10-03 03:06:34,300 WARN L191 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:06:36,533 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-10-03 03:06:37,498 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-03 03:06:38,474 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-03 03:06:39,087 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-10-03 03:06:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:43,194 INFO L93 Difference]: Finished difference Result 459161 states and 560848 transitions. [2019-10-03 03:06:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-03 03:06:43,194 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-10-03 03:06:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:43,802 INFO L225 Difference]: With dead ends: 459161 [2019-10-03 03:06:43,802 INFO L226 Difference]: Without dead ends: 459161 [2019-10-03 03:06:43,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 164 SyntacticMatches, 31 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1087, Invalid=4463, Unknown=0, NotChecked=0, Total=5550 [2019-10-03 03:06:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459161 states. [2019-10-03 03:06:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459161 to 128641. [2019-10-03 03:06:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128641 states. [2019-10-03 03:06:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128641 states to 128641 states and 157465 transitions. [2019-10-03 03:06:50,753 INFO L78 Accepts]: Start accepts. Automaton has 128641 states and 157465 transitions. Word has length 106 [2019-10-03 03:06:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:50,753 INFO L475 AbstractCegarLoop]: Abstraction has 128641 states and 157465 transitions. [2019-10-03 03:06:50,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 03:06:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 128641 states and 157465 transitions. [2019-10-03 03:06:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 03:06:50,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:50,764 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:06:50,764 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:50,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:50,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1060650427, now seen corresponding path program 1 times [2019-10-03 03:06:50,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:50,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:50,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:50,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:06:50,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:06:50,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:06:50,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:06:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:06:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:06:50,825 INFO L87 Difference]: Start difference. First operand 128641 states and 157465 transitions. Second operand 3 states. [2019-10-03 03:06:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:51,077 INFO L93 Difference]: Finished difference Result 94648 states and 112909 transitions. [2019-10-03 03:06:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:06:51,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-03 03:06:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:51,182 INFO L225 Difference]: With dead ends: 94648 [2019-10-03 03:06:51,182 INFO L226 Difference]: Without dead ends: 94648 [2019-10-03 03:06:51,183 INFO L640 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-10-03 03:06:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94648 states. [2019-10-03 03:06:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94648 to 94426. [2019-10-03 03:06:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94426 states. [2019-10-03 03:06:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94426 states to 94426 states and 112663 transitions. [2019-10-03 03:06:52,647 INFO L78 Accepts]: Start accepts. Automaton has 94426 states and 112663 transitions. Word has length 108 [2019-10-03 03:06:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:06:52,648 INFO L475 AbstractCegarLoop]: Abstraction has 94426 states and 112663 transitions. [2019-10-03 03:06:52,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:06:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 94426 states and 112663 transitions. [2019-10-03 03:06:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 03:06:52,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:06:52,654 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:06:52,655 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:06:52,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:52,655 INFO L82 PathProgramCache]: Analyzing trace with hash 231984755, now seen corresponding path program 1 times [2019-10-03 03:06:52,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:06:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:52,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:06:52,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:06:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:52,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:06:52,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:06:52,889 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-10-03 03:06:52,890 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [105], [108], [112], [125], [128], [131], [134], [169], [190], [193], [196], [199], [202], [204], [206], [209], [212], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [257], [260], [263], [271], [303], [312], [316], [329], [337], [340], [343], [346], [348], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [473], [476], [479], [482], [492], [495], [498], [502], [522], [661], [681], [709], [712], [715], [719], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:06:52,892 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:06:52,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:06:52,922 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:06:53,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:06:53,008 INFO L272 AbstractInterpreter]: Visited 103 different actions 186 times. Merged at 39 different actions 74 times. Never widened. Performed 904 root evaluator evaluations with a maximum evaluation depth of 5. Performed 904 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 6 different actions. Largest state had 223 variables. [2019-10-03 03:06:53,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:06:53,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:06:53,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:06:53,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:06:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:06:53,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:06:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:06:53,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 03:06:53,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:06:53,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:53,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:06:53,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:06:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:06:53,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:06:53,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 25 [2019-10-03 03:06:53,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:06:53,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 03:06:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 03:06:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:06:53,890 INFO L87 Difference]: Start difference. First operand 94426 states and 112663 transitions. Second operand 20 states. [2019-10-03 03:06:54,083 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-10-03 03:06:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:06:58,273 INFO L93 Difference]: Finished difference Result 319576 states and 378888 transitions. [2019-10-03 03:06:58,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 03:06:58,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-03 03:06:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:06:58,614 INFO L225 Difference]: With dead ends: 319576 [2019-10-03 03:06:58,614 INFO L226 Difference]: Without dead ends: 319576 [2019-10-03 03:06:58,615 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=430, Invalid=1922, Unknown=0, NotChecked=0, Total=2352 [2019-10-03 03:06:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319576 states. [2019-10-03 03:07:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319576 to 94414. [2019-10-03 03:07:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94414 states. [2019-10-03 03:07:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94414 states to 94414 states and 112635 transitions. [2019-10-03 03:07:01,163 INFO L78 Accepts]: Start accepts. Automaton has 94414 states and 112635 transitions. Word has length 108 [2019-10-03 03:07:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:01,164 INFO L475 AbstractCegarLoop]: Abstraction has 94414 states and 112635 transitions. [2019-10-03 03:07:01,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 03:07:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 94414 states and 112635 transitions. [2019-10-03 03:07:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:07:01,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:01,171 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:01,171 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:01,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1819981890, now seen corresponding path program 1 times [2019-10-03 03:07:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:01,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:01,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 03:07:01,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:01,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:07:01,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:01,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:07:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:07:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:07:01,236 INFO L87 Difference]: Start difference. First operand 94414 states and 112635 transitions. Second operand 4 states. [2019-10-03 03:07:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:01,770 INFO L93 Difference]: Finished difference Result 172622 states and 205940 transitions. [2019-10-03 03:07:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:07:01,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-03 03:07:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:01,977 INFO L225 Difference]: With dead ends: 172622 [2019-10-03 03:07:01,978 INFO L226 Difference]: Without dead ends: 172622 [2019-10-03 03:07:01,978 INFO L640 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-10-03 03:07:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172622 states. [2019-10-03 03:07:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172622 to 91264. [2019-10-03 03:07:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91264 states. [2019-10-03 03:07:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91264 states to 91264 states and 108793 transitions. [2019-10-03 03:07:04,260 INFO L78 Accepts]: Start accepts. Automaton has 91264 states and 108793 transitions. Word has length 109 [2019-10-03 03:07:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:04,260 INFO L475 AbstractCegarLoop]: Abstraction has 91264 states and 108793 transitions. [2019-10-03 03:07:04,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:07:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 91264 states and 108793 transitions. [2019-10-03 03:07:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:07:04,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:04,266 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:04,266 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash -160760477, now seen corresponding path program 1 times [2019-10-03 03:07:04,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:04,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:04,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:04,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:04,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:04,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:04,641 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-10-03 03:07:04,642 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [105], [108], [112], [115], [118], [121], [123], [125], [128], [131], [141], [144], [157], [160], [163], [167], [169], [190], [193], [204], [206], [209], [212], [215], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [257], [260], [263], [271], [303], [305], [308], [316], [319], [322], [325], [327], [329], [367], [369], [382], [390], [393], [396], [399], [401], [424], [427], [430], [433], [435], [437], [470], [529], [808], [906], [910], [913], [916], [919], [922], [925], [929], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:07:04,644 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:04,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:04,676 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:04,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:04,934 INFO L272 AbstractInterpreter]: Visited 104 different actions 425 times. Merged at 41 different actions 294 times. Widened at 13 different actions 32 times. Performed 1545 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1545 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 11 different actions. Largest state had 223 variables. [2019-10-03 03:07:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:04,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:04,934 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:07:05,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:05,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:05,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-03 03:07:05,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:05,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:05,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:05,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:05,889 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:07:05,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [14] total 30 [2019-10-03 03:07:05,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:05,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:07:05,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:07:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:07:05,891 INFO L87 Difference]: Start difference. First operand 91264 states and 108793 transitions. Second operand 10 states. [2019-10-03 03:07:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:08,072 INFO L93 Difference]: Finished difference Result 108970 states and 129172 transitions. [2019-10-03 03:07:08,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:07:08,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2019-10-03 03:07:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:08,189 INFO L225 Difference]: With dead ends: 108970 [2019-10-03 03:07:08,189 INFO L226 Difference]: Without dead ends: 108970 [2019-10-03 03:07:08,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=248, Invalid=1474, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 03:07:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108970 states. [2019-10-03 03:07:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108970 to 102553. [2019-10-03 03:07:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102553 states. [2019-10-03 03:07:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102553 states to 102553 states and 122065 transitions. [2019-10-03 03:07:09,155 INFO L78 Accepts]: Start accepts. Automaton has 102553 states and 122065 transitions. Word has length 109 [2019-10-03 03:07:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:09,155 INFO L475 AbstractCegarLoop]: Abstraction has 102553 states and 122065 transitions. [2019-10-03 03:07:09,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:07:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 102553 states and 122065 transitions. [2019-10-03 03:07:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:07:09,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:09,162 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:09,162 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash 156508782, now seen corresponding path program 1 times [2019-10-03 03:07:09,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:09,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:09,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:09,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:09,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:10,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:10,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:07:10,508 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-10-03 03:07:10,509 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [87], [90], [93], [96], [99], [103], [105], [108], [112], [115], [118], [121], [123], [125], [128], [131], [134], [169], [190], [193], [204], [206], [209], [212], [215], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [255], [257], [271], [303], [305], [308], [316], [319], [322], [325], [327], [329], [367], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [473], [476], [479], [492], [495], [498], [502], [524], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:07:10,510 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:07:10,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:07:10,538 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:07:10,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:07:10,857 INFO L272 AbstractInterpreter]: Visited 104 different actions 512 times. Merged at 39 different actions 371 times. Widened at 15 different actions 62 times. Performed 1782 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1782 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 32 fixpoints after 15 different actions. Largest state had 224 variables. [2019-10-03 03:07:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:10,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:07:10,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:07:10,858 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:07:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:10,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:07:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:11,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:07:11,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:07:11,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:11,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:11,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:07:12,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:12,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:12,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:07:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:13,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:07:13,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 36 [2019-10-03 03:07:13,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:07:13,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-03 03:07:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-03 03:07:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 03:07:13,094 INFO L87 Difference]: Start difference. First operand 102553 states and 122065 transitions. Second operand 25 states. [2019-10-03 03:07:13,251 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-03 03:07:15,658 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-03 03:07:17,161 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-10-03 03:07:17,431 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-10-03 03:07:17,770 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-03 03:07:18,380 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-10-03 03:07:18,587 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-10-03 03:07:19,147 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-03 03:07:20,707 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-10-03 03:07:20,998 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-10-03 03:07:21,641 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:07:22,143 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:07:22,324 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:07:22,688 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-10-03 03:07:22,878 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:07:23,292 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-10-03 03:07:23,636 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-10-03 03:07:24,507 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-10-03 03:07:26,004 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:07:26,592 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:07:26,939 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-10-03 03:07:27,618 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-10-03 03:07:28,203 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-10-03 03:07:28,440 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-03 03:07:28,634 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:07:28,792 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:07:29,148 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-10-03 03:07:29,559 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-03 03:07:30,067 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-10-03 03:07:30,314 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-10-03 03:07:30,507 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-10-03 03:07:31,032 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-10-03 03:07:31,210 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-10-03 03:07:31,684 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-03 03:07:34,375 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:07:34,621 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-10-03 03:07:35,590 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-10-03 03:07:36,185 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-10-03 03:07:37,102 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:07:37,342 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-10-03 03:07:37,672 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-10-03 03:07:38,220 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:07:38,417 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-10-03 03:07:38,646 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 75 [2019-10-03 03:07:39,141 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-03 03:07:39,828 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:07:40,051 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-03 03:07:40,584 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-10-03 03:07:41,429 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-10-03 03:07:41,806 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-03 03:07:42,259 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:07:44,475 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:07:45,540 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:07:45,741 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:07:45,944 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-03 03:07:46,549 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-03 03:07:47,775 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:07:48,143 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-10-03 03:07:48,458 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-03 03:07:49,222 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-10-03 03:07:49,496 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-10-03 03:07:49,707 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-03 03:07:49,885 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:07:50,922 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-03 03:07:51,539 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:07:51,727 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:07:51,923 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:07:52,642 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-10-03 03:07:52,848 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-10-03 03:07:53,408 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:07:53,647 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:07:54,002 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:07:54,371 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:07:55,457 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-03 03:07:55,655 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:07:56,165 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-03 03:07:56,604 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:07:56,841 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-03 03:07:57,207 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-03 03:07:57,393 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-10-03 03:07:58,113 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-10-03 03:07:58,383 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-10-03 03:08:00,274 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-10-03 03:08:00,451 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-10-03 03:08:02,308 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:08:02,676 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-10-03 03:08:03,146 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-03 03:08:03,551 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:08:03,764 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-10-03 03:08:05,071 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-10-03 03:08:05,455 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:08:06,032 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-10-03 03:08:06,217 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-10-03 03:08:07,318 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-10-03 03:08:07,508 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-10-03 03:08:07,895 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:08:08,082 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-10-03 03:08:08,292 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-10-03 03:08:08,530 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-03 03:08:08,715 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-10-03 03:08:09,678 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-10-03 03:08:10,352 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-10-03 03:08:10,555 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:08:10,790 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-03 03:08:11,748 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-10-03 03:08:11,949 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-10-03 03:08:12,270 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:08:13,524 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-10-03 03:08:13,714 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:08:13,900 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:08:15,499 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:08:15,738 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:08:16,045 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-03 03:08:16,257 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:08:17,068 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-10-03 03:08:17,458 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-10-03 03:08:17,722 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:08:18,207 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-03 03:08:18,966 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-03 03:08:19,793 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:08:20,177 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-10-03 03:08:20,610 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-10-03 03:08:21,370 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:08:22,096 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-10-03 03:08:22,826 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:08:23,112 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-03 03:08:23,786 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-10-03 03:08:24,012 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2019-10-03 03:08:24,820 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-10-03 03:08:25,209 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:08:25,461 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-10-03 03:08:26,007 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-03 03:08:26,431 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-03 03:08:26,845 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:08:27,038 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:08:27,593 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-10-03 03:08:27,981 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:08:28,300 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-10-03 03:08:29,123 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:08:29,381 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:08:29,616 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:08:30,109 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2019-10-03 03:08:30,724 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-10-03 03:08:31,064 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-03 03:08:31,332 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-10-03 03:08:31,563 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2019-10-03 03:08:32,926 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-10-03 03:08:33,168 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-10-03 03:08:33,493 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-10-03 03:08:33,737 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-10-03 03:08:33,952 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-03 03:08:34,258 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-10-03 03:08:35,149 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:08:36,134 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-10-03 03:08:36,610 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-03 03:08:36,844 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2019-10-03 03:08:37,097 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-03 03:08:37,346 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:08:38,741 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:08:39,188 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:08:39,364 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:08:39,547 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:08:40,299 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-10-03 03:08:40,505 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:08:40,714 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:08:40,894 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:08:41,454 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:08:41,991 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:08:42,187 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:08:42,414 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-10-03 03:08:43,550 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:08:43,989 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-03 03:08:44,193 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:08:44,383 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:08:45,337 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-03 03:08:45,891 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-10-03 03:08:46,135 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-03 03:08:46,776 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-10-03 03:08:47,518 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:08:47,816 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-03 03:08:48,047 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-03 03:08:48,773 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-03 03:08:49,265 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-10-03 03:08:49,943 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:08:50,203 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-10-03 03:08:50,651 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-10-03 03:08:51,083 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:08:51,876 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:08:52,747 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:08:55,360 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-10-03 03:08:56,623 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-03 03:08:58,041 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-10-03 03:08:58,589 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-10-03 03:09:00,518 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-10-03 03:09:01,428 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-10-03 03:09:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:04,489 INFO L93 Difference]: Finished difference Result 561271 states and 654043 transitions. [2019-10-03 03:09:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 603 states. [2019-10-03 03:09:04,490 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 109 [2019-10-03 03:09:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:05,224 INFO L225 Difference]: With dead ends: 561271 [2019-10-03 03:09:05,224 INFO L226 Difference]: Without dead ends: 561234 [2019-10-03 03:09:05,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 183 SyntacticMatches, 14 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186347 ImplicationChecksByTransitivity, 88.1s TimeCoverageRelationStatistics Valid=39257, Invalid=363333, Unknown=0, NotChecked=0, Total=402590 [2019-10-03 03:09:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561234 states. [2019-10-03 03:09:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561234 to 248417. [2019-10-03 03:09:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248417 states. [2019-10-03 03:09:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248417 states to 248417 states and 293040 transitions. [2019-10-03 03:09:09,873 INFO L78 Accepts]: Start accepts. Automaton has 248417 states and 293040 transitions. Word has length 109 [2019-10-03 03:09:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:09,873 INFO L475 AbstractCegarLoop]: Abstraction has 248417 states and 293040 transitions. [2019-10-03 03:09:09,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-03 03:09:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 248417 states and 293040 transitions. [2019-10-03 03:09:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:09:09,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:09,879 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:09,879 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2074941359, now seen corresponding path program 1 times [2019-10-03 03:09:09,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:09,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:09,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:09,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:09,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:09:09,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:09,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:09,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:09,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:09,935 INFO L87 Difference]: Start difference. First operand 248417 states and 293040 transitions. Second operand 4 states. [2019-10-03 03:09:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:10,789 INFO L93 Difference]: Finished difference Result 323563 states and 380893 transitions. [2019-10-03 03:09:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:10,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-03 03:09:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:11,179 INFO L225 Difference]: With dead ends: 323563 [2019-10-03 03:09:11,179 INFO L226 Difference]: Without dead ends: 323563 [2019-10-03 03:09:11,179 INFO L640 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-10-03 03:09:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323563 states. [2019-10-03 03:09:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323563 to 247587. [2019-10-03 03:09:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247587 states. [2019-10-03 03:09:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247587 states to 247587 states and 292006 transitions. [2019-10-03 03:09:19,892 INFO L78 Accepts]: Start accepts. Automaton has 247587 states and 292006 transitions. Word has length 109 [2019-10-03 03:09:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,893 INFO L475 AbstractCegarLoop]: Abstraction has 247587 states and 292006 transitions. [2019-10-03 03:09:19,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 247587 states and 292006 transitions. [2019-10-03 03:09:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:09:19,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,897 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:19,897 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1583464022, now seen corresponding path program 1 times [2019-10-03 03:09:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:20,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:20,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:20,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-10-03 03:09:20,205 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [105], [108], [112], [125], [128], [131], [134], [137], [139], [141], [144], [147], [157], [160], [163], [167], [169], [190], [193], [196], [199], [204], [206], [209], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [257], [260], [263], [271], [303], [314], [316], [329], [337], [340], [343], [346], [348], [358], [361], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [468], [661], [681], [709], [712], [715], [719], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:09:20,208 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:20,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:20,251 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:20,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:09:20,656 INFO L272 AbstractInterpreter]: Visited 104 different actions 412 times. Merged at 41 different actions 281 times. Widened at 14 different actions 38 times. Performed 1517 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1517 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 8 different actions. Largest state had 223 variables. [2019-10-03 03:09:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:20,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:09:20,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:20,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:09:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:20,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:09:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:20,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:09:20,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:09:21,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:21,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:21,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:21,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:21,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:09:22,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:09:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:22,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:09:22,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-10-03 03:09:22,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:09:22,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 03:09:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 03:09:22,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:09:22,512 INFO L87 Difference]: Start difference. First operand 247587 states and 292006 transitions. Second operand 21 states. [2019-10-03 03:09:25,452 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-10-03 03:09:25,999 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-10-03 03:09:26,710 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-10-03 03:09:27,367 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-10-03 03:09:27,860 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-10-03 03:09:28,060 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-10-03 03:09:28,588 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-10-03 03:09:29,598 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2019-10-03 03:09:29,760 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-10-03 03:09:32,108 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-10-03 03:09:32,250 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-10-03 03:09:32,464 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-10-03 03:09:32,611 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-10-03 03:09:34,045 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-10-03 03:09:34,386 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-10-03 03:09:34,540 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-10-03 03:09:38,499 WARN L191 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-10-03 03:09:38,959 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-10-03 03:09:40,346 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-10-03 03:09:40,682 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-10-03 03:09:41,312 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-10-03 03:09:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:45,933 INFO L93 Difference]: Finished difference Result 865088 states and 1012518 transitions. [2019-10-03 03:09:45,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-10-03 03:09:45,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2019-10-03 03:09:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:48,085 INFO L225 Difference]: With dead ends: 865088 [2019-10-03 03:09:48,086 INFO L226 Difference]: Without dead ends: 865088 [2019-10-03 03:09:48,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5193 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=3508, Invalid=14852, Unknown=0, NotChecked=0, Total=18360 [2019-10-03 03:09:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865088 states. [2019-10-03 03:09:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865088 to 246164. [2019-10-03 03:09:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246164 states. [2019-10-03 03:09:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246164 states to 246164 states and 290331 transitions. [2019-10-03 03:09:58,175 INFO L78 Accepts]: Start accepts. Automaton has 246164 states and 290331 transitions. Word has length 109 [2019-10-03 03:09:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:58,176 INFO L475 AbstractCegarLoop]: Abstraction has 246164 states and 290331 transitions. [2019-10-03 03:09:58,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 03:09:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 246164 states and 290331 transitions. [2019-10-03 03:09:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-03 03:09:58,180 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:58,180 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:58,180 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1701422868, now seen corresponding path program 1 times [2019-10-03 03:09:58,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:58,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:58,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:58,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:58,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:09:58,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:58,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 03:09:58,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:58,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:09:58,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:09:58,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:09:58,585 INFO L87 Difference]: Start difference. First operand 246164 states and 290331 transitions. Second operand 11 states. [2019-10-03 03:09:59,344 WARN L191 SmtUtils]: Spent 643.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-10-03 03:09:59,569 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-10-03 03:09:59,730 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-10-03 03:09:59,902 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-10-03 03:10:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:01,546 INFO L93 Difference]: Finished difference Result 716077 states and 844118 transitions. [2019-10-03 03:10:01,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 03:10:01,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 109 [2019-10-03 03:10:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:07,861 INFO L225 Difference]: With dead ends: 716077 [2019-10-03 03:10:08,197 INFO L226 Difference]: Without dead ends: 716077 [2019-10-03 03:10:08,198 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:10:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716077 states. [2019-10-03 03:10:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716077 to 233147. [2019-10-03 03:10:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233147 states. [2019-10-03 03:10:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233147 states to 233147 states and 275198 transitions. [2019-10-03 03:10:13,105 INFO L78 Accepts]: Start accepts. Automaton has 233147 states and 275198 transitions. Word has length 109 [2019-10-03 03:10:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:13,105 INFO L475 AbstractCegarLoop]: Abstraction has 233147 states and 275198 transitions. [2019-10-03 03:10:13,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:10:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 233147 states and 275198 transitions. [2019-10-03 03:10:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:10:13,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:13,109 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:13,109 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash -777590867, now seen corresponding path program 1 times [2019-10-03 03:10:13,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:13,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:13,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:13,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:13,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 03:10:13,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:13,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:10:13,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:10:13,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:10:13,461 INFO L87 Difference]: Start difference. First operand 233147 states and 275198 transitions. Second operand 15 states. [2019-10-03 03:10:16,159 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-10-03 03:10:16,412 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-10-03 03:10:17,233 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-10-03 03:10:19,496 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-10-03 03:10:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:20,703 INFO L93 Difference]: Finished difference Result 396470 states and 467620 transitions. [2019-10-03 03:10:20,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-03 03:10:20,703 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 111 [2019-10-03 03:10:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:21,166 INFO L225 Difference]: With dead ends: 396470 [2019-10-03 03:10:21,166 INFO L226 Difference]: Without dead ends: 396470 [2019-10-03 03:10:21,166 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=700, Invalid=2056, Unknown=0, NotChecked=0, Total=2756 [2019-10-03 03:10:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396470 states. [2019-10-03 03:10:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396470 to 222680. [2019-10-03 03:10:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222680 states. [2019-10-03 03:10:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222680 states to 222680 states and 262712 transitions. [2019-10-03 03:10:27,769 INFO L78 Accepts]: Start accepts. Automaton has 222680 states and 262712 transitions. Word has length 111 [2019-10-03 03:10:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:27,769 INFO L475 AbstractCegarLoop]: Abstraction has 222680 states and 262712 transitions. [2019-10-03 03:10:27,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:10:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 222680 states and 262712 transitions. [2019-10-03 03:10:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:10:27,774 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:27,774 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:27,774 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:27,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:27,774 INFO L82 PathProgramCache]: Analyzing trace with hash 927799089, now seen corresponding path program 1 times [2019-10-03 03:10:27,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:27,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:27,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:10:27,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:10:27,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-10-03 03:10:27,983 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [87], [90], [93], [96], [99], [103], [105], [108], [112], [115], [118], [121], [123], [125], [128], [141], [144], [147], [150], [169], [190], [193], [196], [199], [204], [206], [209], [212], [215], [218], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [255], [257], [271], [303], [316], [319], [322], [325], [327], [329], [358], [361], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [449], [452], [455], [458], [462], [531], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:10:27,985 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:10:27,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:10:28,014 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:10:28,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:10:28,149 INFO L272 AbstractInterpreter]: Visited 106 different actions 201 times. Merged at 39 different actions 85 times. Never widened. Performed 980 root evaluator evaluations with a maximum evaluation depth of 5. Performed 980 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 5 different actions. Largest state had 224 variables. [2019-10-03 03:10:28,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:28,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:10:28,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:10:28,150 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:10:28,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:28,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:10:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:28,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 03:10:28,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:10:28,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:28,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:10:28,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:28,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:10:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 25 [2019-10-03 03:10:29,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:10:29,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 03:10:29,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 03:10:29,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:10:29,030 INFO L87 Difference]: Start difference. First operand 222680 states and 262712 transitions. Second operand 20 states. [2019-10-03 03:10:32,709 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-03 03:10:35,448 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-10-03 03:10:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:36,361 INFO L93 Difference]: Finished difference Result 309330 states and 361978 transitions. [2019-10-03 03:10:36,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 03:10:36,361 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-10-03 03:10:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:36,709 INFO L225 Difference]: With dead ends: 309330 [2019-10-03 03:10:36,709 INFO L226 Difference]: Without dead ends: 309330 [2019-10-03 03:10:36,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=798, Invalid=2862, Unknown=0, NotChecked=0, Total=3660 [2019-10-03 03:10:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309330 states. [2019-10-03 03:10:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309330 to 228526. [2019-10-03 03:10:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228526 states. [2019-10-03 03:10:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228526 states to 228526 states and 269355 transitions. [2019-10-03 03:10:39,785 INFO L78 Accepts]: Start accepts. Automaton has 228526 states and 269355 transitions. Word has length 111 [2019-10-03 03:10:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:39,785 INFO L475 AbstractCegarLoop]: Abstraction has 228526 states and 269355 transitions. [2019-10-03 03:10:39,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 03:10:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 228526 states and 269355 transitions. [2019-10-03 03:10:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:10:39,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:39,790 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:39,790 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1135773976, now seen corresponding path program 1 times [2019-10-03 03:10:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:39,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:39,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:40,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:40,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:10:40,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:40,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:10:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:10:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:10:40,041 INFO L87 Difference]: Start difference. First operand 228526 states and 269355 transitions. Second operand 12 states. [2019-10-03 03:10:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:43,816 INFO L93 Difference]: Finished difference Result 308274 states and 364595 transitions. [2019-10-03 03:10:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:10:43,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-10-03 03:10:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:44,162 INFO L225 Difference]: With dead ends: 308274 [2019-10-03 03:10:44,162 INFO L226 Difference]: Without dead ends: 308274 [2019-10-03 03:10:44,163 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:10:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308274 states. [2019-10-03 03:10:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308274 to 254318. [2019-10-03 03:10:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254318 states. [2019-10-03 03:10:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254318 states to 254318 states and 299579 transitions. [2019-10-03 03:10:50,932 INFO L78 Accepts]: Start accepts. Automaton has 254318 states and 299579 transitions. Word has length 111 [2019-10-03 03:10:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:50,932 INFO L475 AbstractCegarLoop]: Abstraction has 254318 states and 299579 transitions. [2019-10-03 03:10:50,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:10:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 254318 states and 299579 transitions. [2019-10-03 03:10:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:10:50,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:50,936 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:50,937 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1373185847, now seen corresponding path program 1 times [2019-10-03 03:10:50,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:50,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:50,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:50,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:51,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:51,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-10-03 03:10:51,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:51,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 03:10:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 03:10:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:10:51,881 INFO L87 Difference]: Start difference. First operand 254318 states and 299579 transitions. Second operand 20 states. [2019-10-03 03:10:52,087 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-03 03:10:52,686 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:10:54,980 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-03 03:10:55,155 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-10-03 03:10:55,326 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-10-03 03:10:55,695 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-10-03 03:10:55,988 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-03 03:10:56,978 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-03 03:10:57,165 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-03 03:10:57,907 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-10-03 03:10:58,245 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-10-03 03:10:58,440 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-03 03:10:58,962 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-03 03:10:59,579 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-03 03:11:00,070 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-10-03 03:11:00,436 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-10-03 03:11:00,590 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-10-03 03:11:00,934 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:11:01,213 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-03 03:11:01,490 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:11:01,676 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-03 03:11:01,890 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:11:02,793 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-03 03:11:02,929 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-03 03:11:03,135 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-10-03 03:11:03,385 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-10-03 03:11:03,690 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-10-03 03:11:03,995 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-10-03 03:11:04,621 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-10-03 03:11:05,662 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-03 03:11:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:11:07,514 INFO L93 Difference]: Finished difference Result 921851 states and 1089187 transitions. [2019-10-03 03:11:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-03 03:11:07,514 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-10-03 03:11:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:11:08,590 INFO L225 Difference]: With dead ends: 921851 [2019-10-03 03:11:08,590 INFO L226 Difference]: Without dead ends: 921851 [2019-10-03 03:11:08,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1487, Invalid=6885, Unknown=0, NotChecked=0, Total=8372 [2019-10-03 03:11:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921851 states. [2019-10-03 03:11:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921851 to 258233. [2019-10-03 03:11:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258233 states. [2019-10-03 03:11:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258233 states to 258233 states and 304124 transitions. [2019-10-03 03:11:22,811 INFO L78 Accepts]: Start accepts. Automaton has 258233 states and 304124 transitions. Word has length 111 [2019-10-03 03:11:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:11:22,811 INFO L475 AbstractCegarLoop]: Abstraction has 258233 states and 304124 transitions. [2019-10-03 03:11:22,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 03:11:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 258233 states and 304124 transitions. [2019-10-03 03:11:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:11:22,815 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:11:22,815 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:11:22,815 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:11:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:11:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash -620907342, now seen corresponding path program 1 times [2019-10-03 03:11:22,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:11:22,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:22,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:11:22,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:22,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:11:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:11:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:11:23,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:11:23,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:11:23,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-10-03 03:11:23,290 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [87], [90], [93], [96], [99], [103], [105], [108], [112], [115], [118], [121], [123], [125], [128], [141], [144], [147], [150], [169], [190], [193], [196], [199], [204], [206], [209], [212], [215], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [255], [257], [271], [303], [305], [308], [316], [319], [322], [325], [327], [329], [358], [361], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [449], [452], [455], [458], [462], [531], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:11:23,292 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:11:23,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:11:23,342 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:11:23,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:11:23,551 INFO L272 AbstractInterpreter]: Visited 107 different actions 213 times. Merged at 40 different actions 94 times. Never widened. Performed 1011 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1011 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 4 different actions. Largest state had 224 variables. [2019-10-03 03:11:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:11:23,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:11:23,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:11:23,552 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:11:23,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:11:23,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:11:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:11:23,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-03 03:11:23,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:11:24,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:11:24,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:11:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:11:24,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:11:25,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:11:25,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:11:26,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:11:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:11:26,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 03:11:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [18, 20] total 48 [2019-10-03 03:11:26,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:11:26,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 03:11:26,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 03:11:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2019-10-03 03:11:26,369 INFO L87 Difference]: Start difference. First operand 258233 states and 304124 transitions. Second operand 14 states. [2019-10-03 03:11:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:11:28,680 INFO L93 Difference]: Finished difference Result 299649 states and 352756 transitions. [2019-10-03 03:11:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 03:11:28,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 112 [2019-10-03 03:11:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:11:32,748 INFO L225 Difference]: With dead ends: 299649 [2019-10-03 03:11:32,748 INFO L226 Difference]: Without dead ends: 299649 [2019-10-03 03:11:32,748 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=417, Invalid=2663, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 03:11:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299649 states. [2019-10-03 03:11:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299649 to 258116. [2019-10-03 03:11:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258116 states. [2019-10-03 03:11:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258116 states to 258116 states and 303993 transitions. [2019-10-03 03:11:35,601 INFO L78 Accepts]: Start accepts. Automaton has 258116 states and 303993 transitions. Word has length 112 [2019-10-03 03:11:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:11:35,602 INFO L475 AbstractCegarLoop]: Abstraction has 258116 states and 303993 transitions. [2019-10-03 03:11:35,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 03:11:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 258116 states and 303993 transitions. [2019-10-03 03:11:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:11:35,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:11:35,605 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:11:35,605 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:11:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:11:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1379276956, now seen corresponding path program 1 times [2019-10-03 03:11:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:11:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:11:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:35,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:11:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:11:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:11:35,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:11:35,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 03:11:35,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:11:35,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 03:11:35,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 03:11:35,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-10-03 03:11:35,880 INFO L87 Difference]: Start difference. First operand 258116 states and 303993 transitions. Second operand 16 states. [2019-10-03 03:11:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:11:38,439 INFO L93 Difference]: Finished difference Result 343691 states and 404338 transitions. [2019-10-03 03:11:38,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-03 03:11:38,439 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 113 [2019-10-03 03:11:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:11:42,872 INFO L225 Difference]: With dead ends: 343691 [2019-10-03 03:11:42,872 INFO L226 Difference]: Without dead ends: 343691 [2019-10-03 03:11:42,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1395, Unknown=0, NotChecked=0, Total=1722 [2019-10-03 03:11:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343691 states. [2019-10-03 03:11:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343691 to 277480. [2019-10-03 03:11:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277480 states. [2019-10-03 03:11:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277480 states to 277480 states and 326616 transitions. [2019-10-03 03:11:45,768 INFO L78 Accepts]: Start accepts. Automaton has 277480 states and 326616 transitions. Word has length 113 [2019-10-03 03:11:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:11:45,769 INFO L475 AbstractCegarLoop]: Abstraction has 277480 states and 326616 transitions. [2019-10-03 03:11:45,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 03:11:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 277480 states and 326616 transitions. [2019-10-03 03:11:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:11:45,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:11:45,773 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:11:45,773 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:11:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:11:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1577883831, now seen corresponding path program 1 times [2019-10-03 03:11:45,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:11:45,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:45,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:11:45,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:11:45,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:11:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:11:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:11:45,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:11:45,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:11:45,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:11:45,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:11:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:11:45,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:11:45,964 INFO L87 Difference]: Start difference. First operand 277480 states and 326616 transitions. Second operand 10 states. [2019-10-03 03:11:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:11:49,360 INFO L93 Difference]: Finished difference Result 638929 states and 755165 transitions. [2019-10-03 03:11:49,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 03:11:49,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-10-03 03:11:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:11:50,093 INFO L225 Difference]: With dead ends: 638929 [2019-10-03 03:11:50,093 INFO L226 Difference]: Without dead ends: 638929 [2019-10-03 03:11:50,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2019-10-03 03:11:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638929 states. [2019-10-03 03:12:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638929 to 277462. [2019-10-03 03:12:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277462 states. [2019-10-03 03:12:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277462 states to 277462 states and 326596 transitions. [2019-10-03 03:12:01,126 INFO L78 Accepts]: Start accepts. Automaton has 277462 states and 326596 transitions. Word has length 113 [2019-10-03 03:12:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:12:01,127 INFO L475 AbstractCegarLoop]: Abstraction has 277462 states and 326596 transitions. [2019-10-03 03:12:01,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:12:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 277462 states and 326596 transitions. [2019-10-03 03:12:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:12:01,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:12:01,131 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:12:01,131 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:12:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash -544008193, now seen corresponding path program 1 times [2019-10-03 03:12:01,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:12:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:01,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:12:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:12:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:12:01,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:12:01,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:12:01,959 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 03:12:01,959 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [87], [90], [93], [96], [99], [103], [105], [108], [112], [115], [118], [121], [123], [125], [128], [131], [134], [137], [139], [141], [144], [147], [150], [169], [190], [193], [196], [199], [204], [206], [209], [212], [215], [218], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [255], [257], [271], [303], [316], [319], [322], [325], [327], [329], [358], [361], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [449], [452], [455], [458], [462], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:12:01,961 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:12:01,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:12:01,989 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:12:02,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:12:02,083 INFO L272 AbstractInterpreter]: Visited 109 different actions 202 times. Merged at 39 different actions 83 times. Never widened. Performed 945 root evaluator evaluations with a maximum evaluation depth of 5. Performed 945 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 5 different actions. Largest state had 224 variables. [2019-10-03 03:12:02,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:02,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:12:02,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:12:02,083 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:12:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:02,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:12:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:12:02,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-03 03:12:02,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:12:03,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:12:04,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:12:05,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:05,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:05,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:05,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:12:05,939 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:12:05,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17, 22] imperfect sequences [22] total 57 [2019-10-03 03:12:05,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:12:05,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-03 03:12:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-03 03:12:05,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2019-10-03 03:12:05,941 INFO L87 Difference]: Start difference. First operand 277462 states and 326596 transitions. Second operand 17 states. [2019-10-03 03:12:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:12:09,725 INFO L93 Difference]: Finished difference Result 305460 states and 359011 transitions. [2019-10-03 03:12:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:12:09,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2019-10-03 03:12:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:12:10,079 INFO L225 Difference]: With dead ends: 305460 [2019-10-03 03:12:10,079 INFO L226 Difference]: Without dead ends: 305460 [2019-10-03 03:12:10,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=459, Invalid=3573, Unknown=0, NotChecked=0, Total=4032 [2019-10-03 03:12:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305460 states. [2019-10-03 03:12:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305460 to 277332. [2019-10-03 03:12:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277332 states. [2019-10-03 03:12:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277332 states to 277332 states and 326446 transitions. [2019-10-03 03:12:13,793 INFO L78 Accepts]: Start accepts. Automaton has 277332 states and 326446 transitions. Word has length 114 [2019-10-03 03:12:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:12:13,793 INFO L475 AbstractCegarLoop]: Abstraction has 277332 states and 326446 transitions. [2019-10-03 03:12:13,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-03 03:12:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 277332 states and 326446 transitions. [2019-10-03 03:12:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 03:12:13,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:12:13,798 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:12:13,798 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:12:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1492611490, now seen corresponding path program 1 times [2019-10-03 03:12:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:12:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:13,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:13,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:12:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:12:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:12:14,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:12:14,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:12:14,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-10-03 03:12:14,111 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [87], [90], [93], [96], [99], [103], [105], [108], [112], [115], [118], [123], [125], [128], [131], [134], [137], [139], [141], [144], [147], [150], [153], [155], [157], [160], [163], [167], [169], [190], [193], [196], [199], [202], [204], [206], [209], [212], [215], [220], [222], [225], [228], [230], [232], [235], [236], [238], [241], [246], [249], [252], [257], [260], [263], [271], [303], [305], [308], [316], [319], [322], [325], [327], [329], [369], [372], [375], [378], [380], [382], [424], [427], [430], [433], [435], [437], [534], [657], [1738], [1739], [1743], [1744], [1745] [2019-10-03 03:12:14,113 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:12:14,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:12:14,140 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:12:14,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:12:14,244 INFO L272 AbstractInterpreter]: Visited 112 different actions 221 times. Merged at 40 different actions 96 times. Never widened. Performed 996 root evaluator evaluations with a maximum evaluation depth of 5. Performed 996 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 224 variables. [2019-10-03 03:12:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:14,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:12:14,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:12:14,245 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:12:14,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:14,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:12:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:12:14,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-03 03:12:14,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:12:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:15,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:12:16,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:12:17,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:17,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:17,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:17,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:17,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:12:17,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:12:17,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2019-10-03 03:12:17,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:12:17,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-03 03:12:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-03 03:12:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1914, Unknown=0, NotChecked=0, Total=2070 [2019-10-03 03:12:17,748 INFO L87 Difference]: Start difference. First operand 277332 states and 326446 transitions. Second operand 32 states. [2019-10-03 03:12:19,237 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-10-03 03:12:19,601 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-10-03 03:12:20,176 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-03 03:12:20,480 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-03 03:12:20,999 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-03 03:12:21,276 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-10-03 03:12:22,055 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-03 03:12:22,306 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-03 03:12:22,747 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-10-03 03:12:23,020 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-10-03 03:12:23,317 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-10-03 03:12:23,497 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-03 03:12:23,704 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:12:23,941 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-10-03 03:12:24,241 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-03 03:12:25,342 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-03 03:12:26,071 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-03 03:12:26,630 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-03 03:12:27,263 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:12:27,750 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-03 03:12:28,084 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-03 03:12:28,356 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-03 03:12:28,834 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-03 03:12:29,126 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-03 03:12:29,522 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-03 03:12:29,873 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-03 03:12:33,019 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-03 03:12:33,357 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-03 03:12:33,807 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:12:34,174 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:12:34,641 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-03 03:12:35,121 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-03 03:12:35,561 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-03 03:12:36,138 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:12:36,348 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-03 03:12:36,737 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-03 03:12:37,270 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-03 03:12:37,753 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-03 03:12:38,259 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-03 03:12:38,477 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-03 03:12:39,708 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-03 03:12:39,903 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-03 03:12:40,528 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-03 03:12:40,795 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-03 03:12:41,085 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-03 03:12:41,294 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-03 03:12:41,804 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-03 03:12:42,171 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-03 03:12:42,504 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-03 03:12:42,957 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-03 03:12:43,253 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-03 03:12:43,802 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-03 03:12:44,166 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-03 03:12:44,786 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-10-03 03:12:45,320 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-10-03 03:12:46,025 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-03 03:12:46,526 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-03 03:12:46,891 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-03 03:12:47,091 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-03 03:12:47,520 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-03 03:12:47,846 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-03 03:12:48,260 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-10-03 03:12:48,829 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-10-03 03:12:49,165 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-03 03:12:49,543 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-10-03 03:12:50,245 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-03 03:12:50,758 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-03 03:12:51,428 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-10-03 03:12:51,948 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-03 03:12:52,710 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-03 03:12:53,174 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-10-03 03:12:53,826 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-10-03 03:12:54,304 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-03 03:12:54,613 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-03 03:12:54,994 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-03 03:12:55,549 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-03 03:12:56,184 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-10-03 03:12:56,555 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-03 03:12:57,028 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-10-03 03:12:59,288 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-03 03:12:59,555 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-10-03 03:13:00,095 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-03 03:13:00,587 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-10-03 03:13:00,881 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-03 03:13:01,444 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-03 03:13:01,832 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-10-03 03:13:02,503 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-10-03 03:13:02,840 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-03 03:13:03,302 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-03 03:13:04,783 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-03 03:13:05,088 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:13:06,400 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-03 03:13:06,972 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-10-03 03:13:07,280 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-03 03:13:07,496 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-03 03:13:07,734 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-03 03:13:08,087 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-03 03:13:08,307 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-03 03:13:08,715 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-10-03 03:13:08,981 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-03 03:13:09,240 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:13:10,163 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-03 03:13:10,639 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:13:11,031 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-10-03 03:13:11,341 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-10-03 03:13:11,976 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-03 03:13:12,388 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:13:13,231 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-10-03 03:13:14,022 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-10-03 03:13:14,600 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:13:15,389 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-10-03 03:13:16,059 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-10-03 03:13:16,436 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-03 03:13:17,236 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-03 03:13:17,616 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-03 03:13:18,206 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-03 03:13:18,678 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-03 03:13:19,239 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-10-03 03:13:19,716 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:13:20,079 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-03 03:13:20,737 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:13:21,225 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-03 03:13:21,800 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:13:22,113 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-10-03 03:13:22,568 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-03 03:13:22,872 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-03 03:13:23,197 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-03 03:13:23,515 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-03 03:13:23,981 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60