java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:47:26,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:47:26,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:47:27,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:47:27,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:47:27,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:47:27,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:47:27,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:47:27,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:47:27,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:47:27,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:47:27,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:47:27,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:47:27,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:47:27,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:47:27,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:47:27,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:47:27,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:47:27,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:47:27,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:47:27,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:47:27,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:47:27,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:47:27,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:47:27,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:47:27,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:47:27,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:47:27,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:47:27,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:47:27,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:47:27,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:47:27,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:47:27,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:47:27,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:47:27,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:47:27,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:47:27,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:47:27,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:47:27,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:47:27,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:47:27,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:47:27,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:47:27,062 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:47:27,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:47:27,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:47:27,063 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:47:27,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:47:27,064 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:47:27,064 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:47:27,064 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:47:27,065 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:47:27,065 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:47:27,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:47:27,066 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:47:27,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:47:27,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:47:27,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:47:27,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:47:27,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:47:27,067 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:47:27,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:47:27,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:47:27,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:47:27,068 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:47:27,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:47:27,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:47:27,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:47:27,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:47:27,069 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:47:27,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:47:27,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:47:27,069 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:47:27,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:47:27,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:47:27,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:47:27,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:47:27,117 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:47:27,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:47:27,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908223074/01df1fbd70264670beae50bc91a67706/FLAGbc1088270 [2019-09-10 06:47:27,696 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:47:27,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:47:27,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908223074/01df1fbd70264670beae50bc91a67706/FLAGbc1088270 [2019-09-10 06:47:27,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908223074/01df1fbd70264670beae50bc91a67706 [2019-09-10 06:47:27,989 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:47:27,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:47:27,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:47:27,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:47:27,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:47:27,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:47:27" (1/1) ... [2019-09-10 06:47:27,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4967aa79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:27, skipping insertion in model container [2019-09-10 06:47:27,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:47:27" (1/1) ... [2019-09-10 06:47:28,007 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:47:28,069 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:47:28,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:47:28,447 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:47:28,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:47:28,561 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:47:28,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28 WrapperNode [2019-09-10 06:47:28,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:47:28,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:47:28,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:47:28,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:47:28,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... [2019-09-10 06:47:28,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... [2019-09-10 06:47:28,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... [2019-09-10 06:47:28,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... [2019-09-10 06:47:28,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... [2019-09-10 06:47:28,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... [2019-09-10 06:47:28,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... [2019-09-10 06:47:28,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:47:28,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:47:28,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:47:28,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:47:28,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:47:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:47:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:47:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:47:28,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:47:28,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:47:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:47:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:47:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:47:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:47:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:47:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:47:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:47:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:47:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:47:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:47:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:47:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:47:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:47:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:47:29,590 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:47:29,591 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:47:29,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:47:29 BoogieIcfgContainer [2019-09-10 06:47:29,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:47:29,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:47:29,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:47:29,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:47:29,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:47:27" (1/3) ... [2019-09-10 06:47:29,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcaee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:47:29, skipping insertion in model container [2019-09-10 06:47:29,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:47:28" (2/3) ... [2019-09-10 06:47:29,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcaee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:47:29, skipping insertion in model container [2019-09-10 06:47:29,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:47:29" (3/3) ... [2019-09-10 06:47:29,601 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:47:29,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:47:29,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:47:29,637 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:47:29,663 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:47:29,663 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:47:29,664 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:47:29,664 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:47:29,664 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:47:29,664 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:47:29,664 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:47:29,665 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:47:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-09-10 06:47:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:47:29,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:29,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:29,702 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:29,707 INFO L82 PathProgramCache]: Analyzing trace with hash -418135505, now seen corresponding path program 1 times [2019-09-10 06:47:29,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:29,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:30,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:30,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:47:30,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:30,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:47:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:47:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:47:30,208 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 6 states. [2019-09-10 06:47:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:30,605 INFO L93 Difference]: Finished difference Result 722 states and 1128 transitions. [2019-09-10 06:47:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:47:30,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-09-10 06:47:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:30,630 INFO L225 Difference]: With dead ends: 722 [2019-09-10 06:47:30,630 INFO L226 Difference]: Without dead ends: 694 [2019-09-10 06:47:30,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:47:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-10 06:47:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 467. [2019-09-10 06:47:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-09-10 06:47:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 717 transitions. [2019-09-10 06:47:30,722 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 717 transitions. Word has length 53 [2019-09-10 06:47:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:30,723 INFO L475 AbstractCegarLoop]: Abstraction has 467 states and 717 transitions. [2019-09-10 06:47:30,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:47:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 717 transitions. [2019-09-10 06:47:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:47:30,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:30,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:30,726 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash 914126686, now seen corresponding path program 1 times [2019-09-10 06:47:30,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:30,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:30,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:30,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:30,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:30,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:30,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:30,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:30,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:30,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:30,871 INFO L87 Difference]: Start difference. First operand 467 states and 717 transitions. Second operand 3 states. [2019-09-10 06:47:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:30,907 INFO L93 Difference]: Finished difference Result 832 states and 1273 transitions. [2019-09-10 06:47:30,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:30,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:47:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:30,912 INFO L225 Difference]: With dead ends: 832 [2019-09-10 06:47:30,912 INFO L226 Difference]: Without dead ends: 832 [2019-09-10 06:47:30,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-09-10 06:47:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2019-09-10 06:47:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-09-10 06:47:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1272 transitions. [2019-09-10 06:47:30,946 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1272 transitions. Word has length 56 [2019-09-10 06:47:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:30,947 INFO L475 AbstractCegarLoop]: Abstraction has 830 states and 1272 transitions. [2019-09-10 06:47:30,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1272 transitions. [2019-09-10 06:47:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:47:30,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:30,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:30,950 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:30,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1604405792, now seen corresponding path program 1 times [2019-09-10 06:47:30,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:30,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:30,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:30,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:31,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:31,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:31,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:31,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:31,074 INFO L87 Difference]: Start difference. First operand 830 states and 1272 transitions. Second operand 3 states. [2019-09-10 06:47:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:31,135 INFO L93 Difference]: Finished difference Result 1419 states and 2136 transitions. [2019-09-10 06:47:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:31,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 06:47:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:31,143 INFO L225 Difference]: With dead ends: 1419 [2019-09-10 06:47:31,144 INFO L226 Difference]: Without dead ends: 1419 [2019-09-10 06:47:31,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-09-10 06:47:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2019-09-10 06:47:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2019-09-10 06:47:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2019-09-10 06:47:31,186 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 56 [2019-09-10 06:47:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:31,188 INFO L475 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2019-09-10 06:47:31,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2019-09-10 06:47:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:47:31,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:31,195 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:31,195 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:31,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:31,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1855390903, now seen corresponding path program 1 times [2019-09-10 06:47:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:31,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:31,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:31,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:31,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:31,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:31,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:31,312 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 transitions. Second operand 5 states. [2019-09-10 06:47:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:31,655 INFO L93 Difference]: Finished difference Result 2033 states and 3023 transitions. [2019-09-10 06:47:31,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:31,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-10 06:47:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:31,668 INFO L225 Difference]: With dead ends: 2033 [2019-09-10 06:47:31,668 INFO L226 Difference]: Without dead ends: 2033 [2019-09-10 06:47:31,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-09-10 06:47:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2016. [2019-09-10 06:47:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-09-10 06:47:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3007 transitions. [2019-09-10 06:47:31,744 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3007 transitions. Word has length 57 [2019-09-10 06:47:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:31,744 INFO L475 AbstractCegarLoop]: Abstraction has 2016 states and 3007 transitions. [2019-09-10 06:47:31,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3007 transitions. [2019-09-10 06:47:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:47:31,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:31,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:31,749 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1758328390, now seen corresponding path program 1 times [2019-09-10 06:47:31,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:31,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:31,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:31,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:31,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:31,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:47:31,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:31,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:47:31,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:47:31,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:47:31,914 INFO L87 Difference]: Start difference. First operand 2016 states and 3007 transitions. Second operand 6 states. [2019-09-10 06:47:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:32,252 INFO L93 Difference]: Finished difference Result 4481 states and 6664 transitions. [2019-09-10 06:47:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:32,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:47:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:32,276 INFO L225 Difference]: With dead ends: 4481 [2019-09-10 06:47:32,276 INFO L226 Difference]: Without dead ends: 4481 [2019-09-10 06:47:32,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:47:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2019-09-10 06:47:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4447. [2019-09-10 06:47:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4447 states. [2019-09-10 06:47:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6632 transitions. [2019-09-10 06:47:32,472 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6632 transitions. Word has length 57 [2019-09-10 06:47:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:32,472 INFO L475 AbstractCegarLoop]: Abstraction has 4447 states and 6632 transitions. [2019-09-10 06:47:32,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:47:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6632 transitions. [2019-09-10 06:47:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:47:32,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:32,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:32,475 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1592153131, now seen corresponding path program 1 times [2019-09-10 06:47:32,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:32,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:32,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:32,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:32,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:32,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:32,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:47:32,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:32,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:47:32,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:47:32,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:32,604 INFO L87 Difference]: Start difference. First operand 4447 states and 6632 transitions. Second operand 7 states. [2019-09-10 06:47:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:33,311 INFO L93 Difference]: Finished difference Result 15932 states and 23581 transitions. [2019-09-10 06:47:33,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:47:33,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:47:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:33,453 INFO L225 Difference]: With dead ends: 15932 [2019-09-10 06:47:33,453 INFO L226 Difference]: Without dead ends: 15932 [2019-09-10 06:47:33,454 INFO L628 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-09-10 06:47:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15932 states. [2019-09-10 06:47:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15932 to 4467. [2019-09-10 06:47:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2019-09-10 06:47:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 6656 transitions. [2019-09-10 06:47:33,661 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 6656 transitions. Word has length 58 [2019-09-10 06:47:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:33,662 INFO L475 AbstractCegarLoop]: Abstraction has 4467 states and 6656 transitions. [2019-09-10 06:47:33,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:47:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 6656 transitions. [2019-09-10 06:47:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:47:33,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:33,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:33,664 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash -908950199, now seen corresponding path program 1 times [2019-09-10 06:47:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:33,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:33,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:33,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:33,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:47:33,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:33,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:47:33,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:47:33,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:33,763 INFO L87 Difference]: Start difference. First operand 4467 states and 6656 transitions. Second operand 7 states. [2019-09-10 06:47:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:34,481 INFO L93 Difference]: Finished difference Result 23696 states and 35700 transitions. [2019-09-10 06:47:34,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:47:34,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-10 06:47:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:34,539 INFO L225 Difference]: With dead ends: 23696 [2019-09-10 06:47:34,540 INFO L226 Difference]: Without dead ends: 23696 [2019-09-10 06:47:34,540 INFO L628 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-09-10 06:47:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23696 states. [2019-09-10 06:47:34,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23696 to 4503. [2019-09-10 06:47:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-09-10 06:47:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6702 transitions. [2019-09-10 06:47:34,809 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6702 transitions. Word has length 58 [2019-09-10 06:47:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:34,810 INFO L475 AbstractCegarLoop]: Abstraction has 4503 states and 6702 transitions. [2019-09-10 06:47:34,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:47:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6702 transitions. [2019-09-10 06:47:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:47:34,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:34,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:34,814 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash -201532434, now seen corresponding path program 1 times [2019-09-10 06:47:34,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:34,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:34,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:34,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:34,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:47:34,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:34,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:47:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:47:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:47:34,907 INFO L87 Difference]: Start difference. First operand 4503 states and 6702 transitions. Second operand 6 states. [2019-09-10 06:47:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:35,212 INFO L93 Difference]: Finished difference Result 11910 states and 17544 transitions. [2019-09-10 06:47:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:35,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-10 06:47:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:35,239 INFO L225 Difference]: With dead ends: 11910 [2019-09-10 06:47:35,239 INFO L226 Difference]: Without dead ends: 11910 [2019-09-10 06:47:35,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:47:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11910 states. [2019-09-10 06:47:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11910 to 11906. [2019-09-10 06:47:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11906 states. [2019-09-10 06:47:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11906 states to 11906 states and 17542 transitions. [2019-09-10 06:47:35,516 INFO L78 Accepts]: Start accepts. Automaton has 11906 states and 17542 transitions. Word has length 59 [2019-09-10 06:47:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:35,516 INFO L475 AbstractCegarLoop]: Abstraction has 11906 states and 17542 transitions. [2019-09-10 06:47:35,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:47:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 11906 states and 17542 transitions. [2019-09-10 06:47:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:47:35,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:35,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:35,520 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1864848650, now seen corresponding path program 1 times [2019-09-10 06:47:35,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:35,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:35,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:35,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:35,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:35,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:35,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:35,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:35,622 INFO L87 Difference]: Start difference. First operand 11906 states and 17542 transitions. Second operand 5 states. [2019-09-10 06:47:35,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:35,807 INFO L93 Difference]: Finished difference Result 24998 states and 36935 transitions. [2019-09-10 06:47:35,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:35,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-10 06:47:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:35,856 INFO L225 Difference]: With dead ends: 24998 [2019-09-10 06:47:35,857 INFO L226 Difference]: Without dead ends: 24998 [2019-09-10 06:47:35,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-09-10 06:47:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 14150. [2019-09-10 06:47:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-09-10 06:47:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 20912 transitions. [2019-09-10 06:47:36,798 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 20912 transitions. Word has length 60 [2019-09-10 06:47:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:36,799 INFO L475 AbstractCegarLoop]: Abstraction has 14150 states and 20912 transitions. [2019-09-10 06:47:36,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 20912 transitions. [2019-09-10 06:47:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:47:36,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:36,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:36,804 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash 82558164, now seen corresponding path program 1 times [2019-09-10 06:47:36,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:36,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:36,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:36,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:36,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:36,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:36,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:47:36,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:36,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:47:36,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:47:36,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:47:36,911 INFO L87 Difference]: Start difference. First operand 14150 states and 20912 transitions. Second operand 5 states. [2019-09-10 06:47:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:37,091 INFO L93 Difference]: Finished difference Result 26368 states and 39008 transitions. [2019-09-10 06:47:37,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:47:37,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-10 06:47:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:37,146 INFO L225 Difference]: With dead ends: 26368 [2019-09-10 06:47:37,146 INFO L226 Difference]: Without dead ends: 26368 [2019-09-10 06:47:37,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26368 states. [2019-09-10 06:47:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26368 to 16563. [2019-09-10 06:47:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16563 states. [2019-09-10 06:47:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16563 states to 16563 states and 24524 transitions. [2019-09-10 06:47:37,462 INFO L78 Accepts]: Start accepts. Automaton has 16563 states and 24524 transitions. Word has length 60 [2019-09-10 06:47:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:37,462 INFO L475 AbstractCegarLoop]: Abstraction has 16563 states and 24524 transitions. [2019-09-10 06:47:37,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:47:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 16563 states and 24524 transitions. [2019-09-10 06:47:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:47:37,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:37,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:37,468 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1576740999, now seen corresponding path program 1 times [2019-09-10 06:47:37,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:37,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:37,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:37,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:37,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:47:37,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:37,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:47:37,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:47:37,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:47:37,551 INFO L87 Difference]: Start difference. First operand 16563 states and 24524 transitions. Second operand 7 states. [2019-09-10 06:47:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:38,661 INFO L93 Difference]: Finished difference Result 70942 states and 104173 transitions. [2019-09-10 06:47:38,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:47:38,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-10 06:47:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:38,794 INFO L225 Difference]: With dead ends: 70942 [2019-09-10 06:47:38,795 INFO L226 Difference]: Without dead ends: 70942 [2019-09-10 06:47:38,795 INFO L628 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-09-10 06:47:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70942 states. [2019-09-10 06:47:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70942 to 16675. [2019-09-10 06:47:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16675 states. [2019-09-10 06:47:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16675 states to 16675 states and 24667 transitions. [2019-09-10 06:47:39,884 INFO L78 Accepts]: Start accepts. Automaton has 16675 states and 24667 transitions. Word has length 63 [2019-09-10 06:47:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:39,885 INFO L475 AbstractCegarLoop]: Abstraction has 16675 states and 24667 transitions. [2019-09-10 06:47:39,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:47:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 16675 states and 24667 transitions. [2019-09-10 06:47:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:47:39,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:39,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:39,892 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1496387803, now seen corresponding path program 1 times [2019-09-10 06:47:39,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:39,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:39,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:39,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:39,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:39,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:39,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:39,963 INFO L87 Difference]: Start difference. First operand 16675 states and 24667 transitions. Second operand 3 states. [2019-09-10 06:47:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:40,052 INFO L93 Difference]: Finished difference Result 24797 states and 35914 transitions. [2019-09-10 06:47:40,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:40,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 06:47:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:40,093 INFO L225 Difference]: With dead ends: 24797 [2019-09-10 06:47:40,094 INFO L226 Difference]: Without dead ends: 24797 [2019-09-10 06:47:40,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2019-09-10 06:47:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 19994. [2019-09-10 06:47:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19994 states. [2019-09-10 06:47:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19994 states to 19994 states and 29142 transitions. [2019-09-10 06:47:40,385 INFO L78 Accepts]: Start accepts. Automaton has 19994 states and 29142 transitions. Word has length 63 [2019-09-10 06:47:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:40,386 INFO L475 AbstractCegarLoop]: Abstraction has 19994 states and 29142 transitions. [2019-09-10 06:47:40,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 19994 states and 29142 transitions. [2019-09-10 06:47:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:47:40,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:40,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:40,393 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash -572139280, now seen corresponding path program 1 times [2019-09-10 06:47:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:40,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:40,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:40,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-09-10 06:47:40,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:40,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:47:40,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:40,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:47:40,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:47:40,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:47:40,661 INFO L87 Difference]: Start difference. First operand 19994 states and 29142 transitions. Second operand 10 states. [2019-09-10 06:47:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:42,619 INFO L93 Difference]: Finished difference Result 51573 states and 74409 transitions. [2019-09-10 06:47:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:47:42,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:47:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:42,721 INFO L225 Difference]: With dead ends: 51573 [2019-09-10 06:47:42,722 INFO L226 Difference]: Without dead ends: 51573 [2019-09-10 06:47:42,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:47:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51573 states. [2019-09-10 06:47:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51573 to 19782. [2019-09-10 06:47:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19782 states. [2019-09-10 06:47:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19782 states to 19782 states and 28845 transitions. [2019-09-10 06:47:43,209 INFO L78 Accepts]: Start accepts. Automaton has 19782 states and 28845 transitions. Word has length 65 [2019-09-10 06:47:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:43,210 INFO L475 AbstractCegarLoop]: Abstraction has 19782 states and 28845 transitions. [2019-09-10 06:47:43,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:47:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19782 states and 28845 transitions. [2019-09-10 06:47:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:47:43,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:43,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:43,217 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2066882796, now seen corresponding path program 1 times [2019-09-10 06:47:43,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:43,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:43,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:43,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:43,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:43,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:43,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:47:44,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:44,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:47:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:47:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:47:44,012 INFO L87 Difference]: Start difference. First operand 19782 states and 28845 transitions. Second operand 10 states. [2019-09-10 06:47:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:46,386 INFO L93 Difference]: Finished difference Result 85613 states and 124059 transitions. [2019-09-10 06:47:46,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 06:47:46,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:47:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:46,521 INFO L225 Difference]: With dead ends: 85613 [2019-09-10 06:47:46,521 INFO L226 Difference]: Without dead ends: 85613 [2019-09-10 06:47:46,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1061, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:47:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85613 states. [2019-09-10 06:47:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85613 to 19581. [2019-09-10 06:47:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19581 states. [2019-09-10 06:47:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19581 states to 19581 states and 28537 transitions. [2019-09-10 06:47:47,230 INFO L78 Accepts]: Start accepts. Automaton has 19581 states and 28537 transitions. Word has length 65 [2019-09-10 06:47:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:47,231 INFO L475 AbstractCegarLoop]: Abstraction has 19581 states and 28537 transitions. [2019-09-10 06:47:47,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:47:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 19581 states and 28537 transitions. [2019-09-10 06:47:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 06:47:47,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:47,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:47,236 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1389497554, now seen corresponding path program 1 times [2019-09-10 06:47:47,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:47,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:47,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:47,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:47,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:47,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:47:47,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:47,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:47:47,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:47:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:47:47,428 INFO L87 Difference]: Start difference. First operand 19581 states and 28537 transitions. Second operand 10 states. [2019-09-10 06:47:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:49,965 INFO L93 Difference]: Finished difference Result 87349 states and 125701 transitions. [2019-09-10 06:47:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:47:49,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-09-10 06:47:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:50,094 INFO L225 Difference]: With dead ends: 87349 [2019-09-10 06:47:50,094 INFO L226 Difference]: Without dead ends: 87349 [2019-09-10 06:47:50,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:47:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87349 states. [2019-09-10 06:47:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87349 to 19340. [2019-09-10 06:47:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19340 states. [2019-09-10 06:47:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19340 states to 19340 states and 28177 transitions. [2019-09-10 06:47:50,783 INFO L78 Accepts]: Start accepts. Automaton has 19340 states and 28177 transitions. Word has length 65 [2019-09-10 06:47:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:50,783 INFO L475 AbstractCegarLoop]: Abstraction has 19340 states and 28177 transitions. [2019-09-10 06:47:50,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:47:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 19340 states and 28177 transitions. [2019-09-10 06:47:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:47:50,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:50,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:50,788 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash -376949161, now seen corresponding path program 1 times [2019-09-10 06:47:50,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:50,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:50,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:50,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:50,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:50,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:50,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:50,836 INFO L87 Difference]: Start difference. First operand 19340 states and 28177 transitions. Second operand 3 states. [2019-09-10 06:47:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:50,900 INFO L93 Difference]: Finished difference Result 19321 states and 27723 transitions. [2019-09-10 06:47:50,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:50,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:47:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:50,924 INFO L225 Difference]: With dead ends: 19321 [2019-09-10 06:47:50,924 INFO L226 Difference]: Without dead ends: 19321 [2019-09-10 06:47:50,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19321 states. [2019-09-10 06:47:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19321 to 19319. [2019-09-10 06:47:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19319 states. [2019-09-10 06:47:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19319 states to 19319 states and 27722 transitions. [2019-09-10 06:47:51,166 INFO L78 Accepts]: Start accepts. Automaton has 19319 states and 27722 transitions. Word has length 66 [2019-09-10 06:47:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:51,167 INFO L475 AbstractCegarLoop]: Abstraction has 19319 states and 27722 transitions. [2019-09-10 06:47:51,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 19319 states and 27722 transitions. [2019-09-10 06:47:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:47:51,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:51,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:51,173 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1749705359, now seen corresponding path program 1 times [2019-09-10 06:47:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:51,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:51,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:51,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:51,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:51,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:51,231 INFO L87 Difference]: Start difference. First operand 19319 states and 27722 transitions. Second operand 3 states. [2019-09-10 06:47:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:51,302 INFO L93 Difference]: Finished difference Result 17587 states and 24804 transitions. [2019-09-10 06:47:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:51,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:47:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:51,327 INFO L225 Difference]: With dead ends: 17587 [2019-09-10 06:47:51,327 INFO L226 Difference]: Without dead ends: 17587 [2019-09-10 06:47:51,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17587 states. [2019-09-10 06:47:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17587 to 17585. [2019-09-10 06:47:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17585 states. [2019-09-10 06:47:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17585 states to 17585 states and 24803 transitions. [2019-09-10 06:47:51,525 INFO L78 Accepts]: Start accepts. Automaton has 17585 states and 24803 transitions. Word has length 66 [2019-09-10 06:47:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:51,525 INFO L475 AbstractCegarLoop]: Abstraction has 17585 states and 24803 transitions. [2019-09-10 06:47:51,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17585 states and 24803 transitions. [2019-09-10 06:47:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:47:51,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:51,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:51,529 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1710265917, now seen corresponding path program 1 times [2019-09-10 06:47:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:51,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:51,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:51,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:51,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:51,588 INFO L87 Difference]: Start difference. First operand 17585 states and 24803 transitions. Second operand 3 states. [2019-09-10 06:47:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:51,708 INFO L93 Difference]: Finished difference Result 13798 states and 19123 transitions. [2019-09-10 06:47:51,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:51,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 06:47:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:51,725 INFO L225 Difference]: With dead ends: 13798 [2019-09-10 06:47:51,726 INFO L226 Difference]: Without dead ends: 13798 [2019-09-10 06:47:51,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:51,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13798 states. [2019-09-10 06:47:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13798 to 13796. [2019-09-10 06:47:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13796 states. [2019-09-10 06:47:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13796 states to 13796 states and 19122 transitions. [2019-09-10 06:47:51,889 INFO L78 Accepts]: Start accepts. Automaton has 13796 states and 19122 transitions. Word has length 66 [2019-09-10 06:47:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:51,890 INFO L475 AbstractCegarLoop]: Abstraction has 13796 states and 19122 transitions. [2019-09-10 06:47:51,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 13796 states and 19122 transitions. [2019-09-10 06:47:51,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:47:51,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:51,896 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:51,897 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash -980051313, now seen corresponding path program 1 times [2019-09-10 06:47:51,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:51,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:51,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:51,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:51,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:51,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:51,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:51,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:51,943 INFO L87 Difference]: Start difference. First operand 13796 states and 19122 transitions. Second operand 3 states. [2019-09-10 06:47:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:52,036 INFO L93 Difference]: Finished difference Result 20285 states and 28151 transitions. [2019-09-10 06:47:52,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:52,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:47:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:52,063 INFO L225 Difference]: With dead ends: 20285 [2019-09-10 06:47:52,063 INFO L226 Difference]: Without dead ends: 20285 [2019-09-10 06:47:52,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20285 states. [2019-09-10 06:47:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20285 to 13579. [2019-09-10 06:47:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13579 states. [2019-09-10 06:47:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13579 states to 13579 states and 18801 transitions. [2019-09-10 06:47:52,254 INFO L78 Accepts]: Start accepts. Automaton has 13579 states and 18801 transitions. Word has length 67 [2019-09-10 06:47:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:52,254 INFO L475 AbstractCegarLoop]: Abstraction has 13579 states and 18801 transitions. [2019-09-10 06:47:52,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13579 states and 18801 transitions. [2019-09-10 06:47:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:47:52,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:52,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:52,258 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash 732122448, now seen corresponding path program 1 times [2019-09-10 06:47:52,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:52,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:52,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:52,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:52,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:47:52,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:52,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:47:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:47:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:52,302 INFO L87 Difference]: Start difference. First operand 13579 states and 18801 transitions. Second operand 3 states. [2019-09-10 06:47:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:52,395 INFO L93 Difference]: Finished difference Result 20138 states and 27903 transitions. [2019-09-10 06:47:52,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:47:52,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:47:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:52,422 INFO L225 Difference]: With dead ends: 20138 [2019-09-10 06:47:52,422 INFO L226 Difference]: Without dead ends: 20138 [2019-09-10 06:47:52,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:47:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20138 states. [2019-09-10 06:47:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20138 to 13432. [2019-09-10 06:47:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13432 states. [2019-09-10 06:47:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13432 states to 13432 states and 18573 transitions. [2019-09-10 06:47:52,612 INFO L78 Accepts]: Start accepts. Automaton has 13432 states and 18573 transitions. Word has length 67 [2019-09-10 06:47:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:52,613 INFO L475 AbstractCegarLoop]: Abstraction has 13432 states and 18573 transitions. [2019-09-10 06:47:52,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:47:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 13432 states and 18573 transitions. [2019-09-10 06:47:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:47:52,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:52,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:52,617 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -261204545, now seen corresponding path program 1 times [2019-09-10 06:47:52,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:52,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:52,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:52,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:52,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:53,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:53,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:47:53,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:53,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:47:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:47:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:47:53,507 INFO L87 Difference]: Start difference. First operand 13432 states and 18573 transitions. Second operand 17 states. [2019-09-10 06:47:54,044 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 06:47:54,377 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 06:47:54,533 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 06:47:54,840 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:47:54,983 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:47:55,315 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 06:47:55,555 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 06:47:55,837 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:47:56,100 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 06:47:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:47:58,421 INFO L93 Difference]: Finished difference Result 30611 states and 42351 transitions. [2019-09-10 06:47:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:47:58,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-09-10 06:47:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:47:58,456 INFO L225 Difference]: With dead ends: 30611 [2019-09-10 06:47:58,456 INFO L226 Difference]: Without dead ends: 30611 [2019-09-10 06:47:58,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:47:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30611 states. [2019-09-10 06:47:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30611 to 13350. [2019-09-10 06:47:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-09-10 06:47:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 18459 transitions. [2019-09-10 06:47:58,619 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 18459 transitions. Word has length 67 [2019-09-10 06:47:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:47:58,620 INFO L475 AbstractCegarLoop]: Abstraction has 13350 states and 18459 transitions. [2019-09-10 06:47:58,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:47:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 18459 transitions. [2019-09-10 06:47:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:47:58,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:47:58,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:47:58,623 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:47:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:47:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1834151963, now seen corresponding path program 1 times [2019-09-10 06:47:58,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:47:58,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:58,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:47:58,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:47:58,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:47:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:47:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:47:59,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:47:59,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 06:47:59,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:47:59,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:47:59,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:47:59,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:47:59,640 INFO L87 Difference]: Start difference. First operand 13350 states and 18459 transitions. Second operand 19 states. [2019-09-10 06:48:00,398 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 06:48:00,634 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 06:48:00,880 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-10 06:48:01,319 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 06:48:01,712 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-09-10 06:48:01,947 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:48:02,193 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 06:48:02,567 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 06:48:02,731 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 06:48:02,992 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 06:48:03,184 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:48:03,372 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-10 06:48:03,725 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 06:48:03,892 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:48:04,102 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:48:04,399 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 06:48:07,428 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:48:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:08,003 INFO L93 Difference]: Finished difference Result 52835 states and 73535 transitions. [2019-09-10 06:48:08,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:48:08,005 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-09-10 06:48:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:08,079 INFO L225 Difference]: With dead ends: 52835 [2019-09-10 06:48:08,079 INFO L226 Difference]: Without dead ends: 52835 [2019-09-10 06:48:08,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=473, Invalid=1689, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:48:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52835 states. [2019-09-10 06:48:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52835 to 13374. [2019-09-10 06:48:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13374 states. [2019-09-10 06:48:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13374 states to 13374 states and 18487 transitions. [2019-09-10 06:48:08,387 INFO L78 Accepts]: Start accepts. Automaton has 13374 states and 18487 transitions. Word has length 67 [2019-09-10 06:48:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:08,387 INFO L475 AbstractCegarLoop]: Abstraction has 13374 states and 18487 transitions. [2019-09-10 06:48:08,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:48:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13374 states and 18487 transitions. [2019-09-10 06:48:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:48:08,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:08,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:08,390 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1363022706, now seen corresponding path program 1 times [2019-09-10 06:48:08,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:08,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:08,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:08,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:08,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:08,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:08,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:08,430 INFO L87 Difference]: Start difference. First operand 13374 states and 18487 transitions. Second operand 3 states. [2019-09-10 06:48:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:08,613 INFO L93 Difference]: Finished difference Result 19743 states and 27295 transitions. [2019-09-10 06:48:08,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:08,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 06:48:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:08,637 INFO L225 Difference]: With dead ends: 19743 [2019-09-10 06:48:08,637 INFO L226 Difference]: Without dead ends: 19743 [2019-09-10 06:48:08,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19743 states. [2019-09-10 06:48:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19743 to 12842. [2019-09-10 06:48:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12842 states. [2019-09-10 06:48:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12842 states to 12842 states and 17739 transitions. [2019-09-10 06:48:08,776 INFO L78 Accepts]: Start accepts. Automaton has 12842 states and 17739 transitions. Word has length 67 [2019-09-10 06:48:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:08,776 INFO L475 AbstractCegarLoop]: Abstraction has 12842 states and 17739 transitions. [2019-09-10 06:48:08,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12842 states and 17739 transitions. [2019-09-10 06:48:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:48:08,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:08,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:08,779 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1412507135, now seen corresponding path program 1 times [2019-09-10 06:48:08,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:08,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:09,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:09,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:48:09,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:09,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:48:09,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:48:09,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:48:09,689 INFO L87 Difference]: Start difference. First operand 12842 states and 17739 transitions. Second operand 18 states. [2019-09-10 06:48:10,256 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 06:48:10,443 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 06:48:10,742 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 06:48:10,965 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 06:48:11,148 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:48:11,374 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-10 06:48:11,644 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 06:48:12,056 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:48:12,426 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 06:48:14,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:14,704 INFO L93 Difference]: Finished difference Result 30630 states and 42474 transitions. [2019-09-10 06:48:14,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:48:14,704 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-09-10 06:48:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:14,747 INFO L225 Difference]: With dead ends: 30630 [2019-09-10 06:48:14,747 INFO L226 Difference]: Without dead ends: 30630 [2019-09-10 06:48:14,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:48:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30630 states. [2019-09-10 06:48:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30630 to 12818. [2019-09-10 06:48:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12818 states. [2019-09-10 06:48:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12818 states to 12818 states and 17705 transitions. [2019-09-10 06:48:15,096 INFO L78 Accepts]: Start accepts. Automaton has 12818 states and 17705 transitions. Word has length 68 [2019-09-10 06:48:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:15,096 INFO L475 AbstractCegarLoop]: Abstraction has 12818 states and 17705 transitions. [2019-09-10 06:48:15,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:48:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 12818 states and 17705 transitions. [2019-09-10 06:48:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:48:15,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:15,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:15,099 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash -370961391, now seen corresponding path program 1 times [2019-09-10 06:48:15,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:15,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:15,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:15,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:15,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:15,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:15,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:15,170 INFO L87 Difference]: Start difference. First operand 12818 states and 17705 transitions. Second operand 5 states. [2019-09-10 06:48:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:15,260 INFO L93 Difference]: Finished difference Result 12010 states and 16614 transitions. [2019-09-10 06:48:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:48:15,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:48:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:15,276 INFO L225 Difference]: With dead ends: 12010 [2019-09-10 06:48:15,277 INFO L226 Difference]: Without dead ends: 12010 [2019-09-10 06:48:15,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12010 states. [2019-09-10 06:48:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12010 to 12006. [2019-09-10 06:48:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12006 states. [2019-09-10 06:48:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12006 states to 12006 states and 16612 transitions. [2019-09-10 06:48:15,403 INFO L78 Accepts]: Start accepts. Automaton has 12006 states and 16612 transitions. Word has length 71 [2019-09-10 06:48:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:15,403 INFO L475 AbstractCegarLoop]: Abstraction has 12006 states and 16612 transitions. [2019-09-10 06:48:15,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 12006 states and 16612 transitions. [2019-09-10 06:48:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:48:15,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:15,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:15,407 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:15,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1227529657, now seen corresponding path program 1 times [2019-09-10 06:48:15,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:15,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:15,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:15,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:48:15,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:15,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:48:15,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:48:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:48:15,493 INFO L87 Difference]: Start difference. First operand 12006 states and 16612 transitions. Second operand 6 states. [2019-09-10 06:48:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:15,648 INFO L93 Difference]: Finished difference Result 22710 states and 30757 transitions. [2019-09-10 06:48:15,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:15,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-10 06:48:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:15,681 INFO L225 Difference]: With dead ends: 22710 [2019-09-10 06:48:15,682 INFO L226 Difference]: Without dead ends: 22710 [2019-09-10 06:48:15,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22710 states. [2019-09-10 06:48:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22710 to 12405. [2019-09-10 06:48:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12405 states. [2019-09-10 06:48:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12405 states to 12405 states and 16902 transitions. [2019-09-10 06:48:15,948 INFO L78 Accepts]: Start accepts. Automaton has 12405 states and 16902 transitions. Word has length 74 [2019-09-10 06:48:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:15,949 INFO L475 AbstractCegarLoop]: Abstraction has 12405 states and 16902 transitions. [2019-09-10 06:48:15,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:48:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 12405 states and 16902 transitions. [2019-09-10 06:48:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:48:15,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:15,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:15,956 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1119890230, now seen corresponding path program 1 times [2019-09-10 06:48:15,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:15,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:15,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:15,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:16,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:16,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:16,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:16,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:16,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:16,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:16,010 INFO L87 Difference]: Start difference. First operand 12405 states and 16902 transitions. Second operand 3 states. [2019-09-10 06:48:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:16,125 INFO L93 Difference]: Finished difference Result 22002 states and 29470 transitions. [2019-09-10 06:48:16,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:16,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:48:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:16,156 INFO L225 Difference]: With dead ends: 22002 [2019-09-10 06:48:16,156 INFO L226 Difference]: Without dead ends: 22002 [2019-09-10 06:48:16,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22002 states. [2019-09-10 06:48:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22002 to 21734. [2019-09-10 06:48:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-09-10 06:48:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 29203 transitions. [2019-09-10 06:48:16,415 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 29203 transitions. Word has length 75 [2019-09-10 06:48:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:16,416 INFO L475 AbstractCegarLoop]: Abstraction has 21734 states and 29203 transitions. [2019-09-10 06:48:16,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 29203 transitions. [2019-09-10 06:48:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:48:16,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:16,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:16,422 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash 22683295, now seen corresponding path program 1 times [2019-09-10 06:48:16,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:16,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:16,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:16,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:16,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:16,465 INFO L87 Difference]: Start difference. First operand 21734 states and 29203 transitions. Second operand 3 states. [2019-09-10 06:48:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:16,566 INFO L93 Difference]: Finished difference Result 33593 states and 44487 transitions. [2019-09-10 06:48:16,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:16,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 06:48:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:16,604 INFO L225 Difference]: With dead ends: 33593 [2019-09-10 06:48:16,604 INFO L226 Difference]: Without dead ends: 33593 [2019-09-10 06:48:16,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33593 states. [2019-09-10 06:48:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33593 to 30759. [2019-09-10 06:48:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30759 states. [2019-09-10 06:48:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30759 states to 30759 states and 41038 transitions. [2019-09-10 06:48:16,846 INFO L78 Accepts]: Start accepts. Automaton has 30759 states and 41038 transitions. Word has length 76 [2019-09-10 06:48:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:16,846 INFO L475 AbstractCegarLoop]: Abstraction has 30759 states and 41038 transitions. [2019-09-10 06:48:16,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30759 states and 41038 transitions. [2019-09-10 06:48:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:48:16,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:16,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:16,850 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1396060808, now seen corresponding path program 1 times [2019-09-10 06:48:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:16,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:16,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:16,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:16,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:16,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:16,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:16,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:16,897 INFO L87 Difference]: Start difference. First operand 30759 states and 41038 transitions. Second operand 5 states. [2019-09-10 06:48:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:17,284 INFO L93 Difference]: Finished difference Result 65131 states and 84182 transitions. [2019-09-10 06:48:17,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:17,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 06:48:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:17,344 INFO L225 Difference]: With dead ends: 65131 [2019-09-10 06:48:17,344 INFO L226 Difference]: Without dead ends: 65131 [2019-09-10 06:48:17,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65131 states. [2019-09-10 06:48:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65131 to 34442. [2019-09-10 06:48:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34442 states. [2019-09-10 06:48:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34442 states to 34442 states and 44918 transitions. [2019-09-10 06:48:17,945 INFO L78 Accepts]: Start accepts. Automaton has 34442 states and 44918 transitions. Word has length 81 [2019-09-10 06:48:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:17,945 INFO L475 AbstractCegarLoop]: Abstraction has 34442 states and 44918 transitions. [2019-09-10 06:48:17,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 34442 states and 44918 transitions. [2019-09-10 06:48:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:48:17,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:17,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:17,948 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1228531457, now seen corresponding path program 1 times [2019-09-10 06:48:17,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:17,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:17,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:17,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:18,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:18,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:48:18,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:18,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:48:18,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:48:18,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:48:18,040 INFO L87 Difference]: Start difference. First operand 34442 states and 44918 transitions. Second operand 5 states. [2019-09-10 06:48:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:18,614 INFO L93 Difference]: Finished difference Result 117432 states and 149426 transitions. [2019-09-10 06:48:18,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:48:18,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 06:48:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:18,745 INFO L225 Difference]: With dead ends: 117432 [2019-09-10 06:48:18,745 INFO L226 Difference]: Without dead ends: 117432 [2019-09-10 06:48:18,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:48:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117432 states. [2019-09-10 06:48:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117432 to 68760. [2019-09-10 06:48:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68760 states. [2019-09-10 06:48:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68760 states to 68760 states and 89484 transitions. [2019-09-10 06:48:19,468 INFO L78 Accepts]: Start accepts. Automaton has 68760 states and 89484 transitions. Word has length 83 [2019-09-10 06:48:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:19,468 INFO L475 AbstractCegarLoop]: Abstraction has 68760 states and 89484 transitions. [2019-09-10 06:48:19,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:48:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 68760 states and 89484 transitions. [2019-09-10 06:48:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:48:19,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:19,478 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:19,478 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:19,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:19,478 INFO L82 PathProgramCache]: Analyzing trace with hash -505184882, now seen corresponding path program 1 times [2019-09-10 06:48:19,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:19,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:19,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:19,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:19,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 06:48:19,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:19,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:19,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:19,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:19,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:19,539 INFO L87 Difference]: Start difference. First operand 68760 states and 89484 transitions. Second operand 3 states. [2019-09-10 06:48:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:19,733 INFO L93 Difference]: Finished difference Result 66628 states and 84397 transitions. [2019-09-10 06:48:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:19,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 06:48:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:19,818 INFO L225 Difference]: With dead ends: 66628 [2019-09-10 06:48:19,819 INFO L226 Difference]: Without dead ends: 66628 [2019-09-10 06:48:19,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66628 states. [2019-09-10 06:48:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66628 to 62780. [2019-09-10 06:48:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62780 states. [2019-09-10 06:48:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62780 states to 62780 states and 80334 transitions. [2019-09-10 06:48:21,708 INFO L78 Accepts]: Start accepts. Automaton has 62780 states and 80334 transitions. Word has length 94 [2019-09-10 06:48:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:21,708 INFO L475 AbstractCegarLoop]: Abstraction has 62780 states and 80334 transitions. [2019-09-10 06:48:21,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 62780 states and 80334 transitions. [2019-09-10 06:48:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:48:21,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:21,715 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:21,715 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1041325055, now seen corresponding path program 1 times [2019-09-10 06:48:21,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:21,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:21,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:21,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:21,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:48:21,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:21,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:48:21,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:48:21,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:21,762 INFO L87 Difference]: Start difference. First operand 62780 states and 80334 transitions. Second operand 3 states. [2019-09-10 06:48:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:22,030 INFO L93 Difference]: Finished difference Result 117820 states and 146925 transitions. [2019-09-10 06:48:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:48:22,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 06:48:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:22,218 INFO L225 Difference]: With dead ends: 117820 [2019-09-10 06:48:22,219 INFO L226 Difference]: Without dead ends: 117820 [2019-09-10 06:48:22,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:48:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117820 states. [2019-09-10 06:48:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117820 to 103380. [2019-09-10 06:48:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103380 states. [2019-09-10 06:48:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103380 states to 103380 states and 130176 transitions. [2019-09-10 06:48:23,607 INFO L78 Accepts]: Start accepts. Automaton has 103380 states and 130176 transitions. Word has length 95 [2019-09-10 06:48:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:23,607 INFO L475 AbstractCegarLoop]: Abstraction has 103380 states and 130176 transitions. [2019-09-10 06:48:23,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:48:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 103380 states and 130176 transitions. [2019-09-10 06:48:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:48:23,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:23,615 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:23,615 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:23,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2081371009, now seen corresponding path program 1 times [2019-09-10 06:48:23,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:23,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:23,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:23,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:23,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:23,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:48:23,798 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], [69], [71], [75], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [499], [509], [523], [531], [547], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:48:23,863 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:23,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:24,069 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:24,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:24,604 INFO L272 AbstractInterpreter]: Visited 92 different actions 326 times. Merged at 31 different actions 206 times. Widened at 10 different actions 22 times. Performed 1112 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1112 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 9 different actions. Largest state had 114 variables. [2019-09-10 06:48:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:24,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:24,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:24,611 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) [2019-09-10 06:48:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:24,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:48:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:24,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:48:24,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:24,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:25,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:26,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:26,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:26,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:26,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 06:48:26,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:26,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:48:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:48:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:48:26,647 INFO L87 Difference]: Start difference. First operand 103380 states and 130176 transitions. Second operand 19 states. [2019-09-10 06:48:27,189 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 06:48:29,003 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 06:48:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:32,591 INFO L93 Difference]: Finished difference Result 314410 states and 394241 transitions. [2019-09-10 06:48:32,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:48:32,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-09-10 06:48:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:33,475 INFO L225 Difference]: With dead ends: 314410 [2019-09-10 06:48:33,475 INFO L226 Difference]: Without dead ends: 314410 [2019-09-10 06:48:33,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=383, Invalid=1509, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 06:48:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314410 states. [2019-09-10 06:48:39,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314410 to 104639. [2019-09-10 06:48:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104639 states. [2019-09-10 06:48:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104639 states to 104639 states and 131694 transitions. [2019-09-10 06:48:39,368 INFO L78 Accepts]: Start accepts. Automaton has 104639 states and 131694 transitions. Word has length 98 [2019-09-10 06:48:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:39,369 INFO L475 AbstractCegarLoop]: Abstraction has 104639 states and 131694 transitions. [2019-09-10 06:48:39,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:48:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 104639 states and 131694 transitions. [2019-09-10 06:48:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:48:39,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:39,389 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:39,389 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash -569185905, now seen corresponding path program 1 times [2019-09-10 06:48:39,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:39,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:39,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:39,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:39,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:48:39,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:48:39,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:48:39,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:48:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:48:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:48:39,599 INFO L87 Difference]: Start difference. First operand 104639 states and 131694 transitions. Second operand 10 states. [2019-09-10 06:48:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:43,060 INFO L93 Difference]: Finished difference Result 343680 states and 429341 transitions. [2019-09-10 06:48:43,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 06:48:43,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-10 06:48:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:48:43,819 INFO L225 Difference]: With dead ends: 343680 [2019-09-10 06:48:43,820 INFO L226 Difference]: Without dead ends: 343680 [2019-09-10 06:48:43,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 06:48:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343680 states. [2019-09-10 06:48:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343680 to 143322. [2019-09-10 06:48:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143322 states. [2019-09-10 06:48:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143322 states to 143322 states and 180406 transitions. [2019-09-10 06:48:46,009 INFO L78 Accepts]: Start accepts. Automaton has 143322 states and 180406 transitions. Word has length 98 [2019-09-10 06:48:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:48:46,009 INFO L475 AbstractCegarLoop]: Abstraction has 143322 states and 180406 transitions. [2019-09-10 06:48:46,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:48:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 143322 states and 180406 transitions. [2019-09-10 06:48:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:48:46,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:48:46,016 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:48:46,016 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:48:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:46,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1695242657, now seen corresponding path program 1 times [2019-09-10 06:48:46,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:48:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:46,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:48:46,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:48:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:48,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:48,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:48:48,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 06:48:48,717 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [147], [150], [153], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [497], [511], [523], [531], [547], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:48:48,726 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:48:48,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:48:48,748 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:48:48,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:48:48,990 INFO L272 AbstractInterpreter]: Visited 92 different actions 366 times. Merged at 33 different actions 243 times. Widened at 12 different actions 36 times. Performed 1280 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1280 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 8 different actions. Largest state had 114 variables. [2019-09-10 06:48:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:48:48,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:48:48,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:48:48,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:48:49,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:48:49,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:48:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:48:49,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:48:49,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:48:49,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:49,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:48:49,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:48:50,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:48:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:48:50,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:48:50,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 06:48:50,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:48:50,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:48:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:48:50,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:48:50,250 INFO L87 Difference]: Start difference. First operand 143322 states and 180406 transitions. Second operand 19 states. [2019-09-10 06:48:50,569 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 06:48:50,734 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 06:48:50,884 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:48:53,834 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:48:54,277 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 06:48:55,193 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:48:56,612 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:48:57,214 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 06:48:58,245 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 06:48:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:48:59,649 INFO L93 Difference]: Finished difference Result 433242 states and 537943 transitions. [2019-09-10 06:48:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:48:59,649 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-09-10 06:48:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:00,358 INFO L225 Difference]: With dead ends: 433242 [2019-09-10 06:49:00,359 INFO L226 Difference]: Without dead ends: 433242 [2019-09-10 06:49:00,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 174 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=654, Invalid=2208, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 06:49:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433242 states. [2019-09-10 06:49:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433242 to 189081. [2019-09-10 06:49:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189081 states. [2019-09-10 06:49:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189081 states to 189081 states and 237211 transitions. [2019-09-10 06:49:03,932 INFO L78 Accepts]: Start accepts. Automaton has 189081 states and 237211 transitions. Word has length 98 [2019-09-10 06:49:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:03,933 INFO L475 AbstractCegarLoop]: Abstraction has 189081 states and 237211 transitions. [2019-09-10 06:49:03,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:49:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 189081 states and 237211 transitions. [2019-09-10 06:49:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:49:03,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:03,940 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:03,940 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:03,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:03,941 INFO L82 PathProgramCache]: Analyzing trace with hash -568794473, now seen corresponding path program 1 times [2019-09-10 06:49:03,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:03,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:03,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:03,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:03,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:04,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:04,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:04,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:49:04,096 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], [69], [71], [75], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [198], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [335], [337], [350], [358], [377], [386], [390], [403], [411], [430], [445], [448], [451], [454], [456], [458], [499], [509], [523], [531], [547], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:49:04,105 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:04,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:04,123 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:04,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:49:04,375 INFO L272 AbstractInterpreter]: Visited 93 different actions 358 times. Merged at 32 different actions 235 times. Widened at 10 different actions 28 times. Performed 1250 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1250 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 10 different actions. Largest state had 114 variables. [2019-09-10 06:49:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:04,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:49:04,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:04,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:49:04,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:04,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:49:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:04,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 06:49:04,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:04,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:05,583 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-10 06:49:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:49:05,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:49:06,303 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:49:06,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [5] total 23 [2019-09-10 06:49:06,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:06,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:49:06,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:49:06,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:49:06,305 INFO L87 Difference]: Start difference. First operand 189081 states and 237211 transitions. Second operand 11 states. [2019-09-10 06:49:07,226 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:49:07,682 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 06:49:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:09,167 INFO L93 Difference]: Finished difference Result 426158 states and 533224 transitions. [2019-09-10 06:49:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:49:09,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-10 06:49:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:09,727 INFO L225 Difference]: With dead ends: 426158 [2019-09-10 06:49:09,727 INFO L226 Difference]: Without dead ends: 426158 [2019-09-10 06:49:09,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:49:10,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426158 states. [2019-09-10 06:49:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426158 to 212872. [2019-09-10 06:49:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212872 states. [2019-09-10 06:49:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212872 states to 212872 states and 266625 transitions. [2019-09-10 06:49:16,789 INFO L78 Accepts]: Start accepts. Automaton has 212872 states and 266625 transitions. Word has length 99 [2019-09-10 06:49:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:16,790 INFO L475 AbstractCegarLoop]: Abstraction has 212872 states and 266625 transitions. [2019-09-10 06:49:16,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:49:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 212872 states and 266625 transitions. [2019-09-10 06:49:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:49:16,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:16,795 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:16,795 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:16,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:16,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1968104405, now seen corresponding path program 1 times [2019-09-10 06:49:16,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:16,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:16,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:16,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:16,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:49:16,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:16,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:16,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:16,841 INFO L87 Difference]: Start difference. First operand 212872 states and 266625 transitions. Second operand 3 states. [2019-09-10 06:49:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:17,290 INFO L93 Difference]: Finished difference Result 203264 states and 253097 transitions. [2019-09-10 06:49:17,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:17,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:49:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:17,518 INFO L225 Difference]: With dead ends: 203264 [2019-09-10 06:49:17,518 INFO L226 Difference]: Without dead ends: 203264 [2019-09-10 06:49:17,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203264 states. [2019-09-10 06:49:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203264 to 203264. [2019-09-10 06:49:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203264 states. [2019-09-10 06:49:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203264 states to 203264 states and 253097 transitions. [2019-09-10 06:49:20,092 INFO L78 Accepts]: Start accepts. Automaton has 203264 states and 253097 transitions. Word has length 99 [2019-09-10 06:49:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:20,092 INFO L475 AbstractCegarLoop]: Abstraction has 203264 states and 253097 transitions. [2019-09-10 06:49:20,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 203264 states and 253097 transitions. [2019-09-10 06:49:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:49:20,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:20,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:20,099 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1836683574, now seen corresponding path program 1 times [2019-09-10 06:49:20,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:20,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:20,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:20,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:20,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:20,241 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:49:20,241 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [317], [322], [335], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [430], [445], [458], [466], [485], [499], [511], [521], [552], [568], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:49:20,243 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:20,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:20,256 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:20,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:49:20,365 INFO L272 AbstractInterpreter]: Visited 93 different actions 273 times. Merged at 34 different actions 163 times. Widened at 8 different actions 16 times. Performed 978 root evaluator evaluations with a maximum evaluation depth of 5. Performed 978 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 8 different actions. Largest state had 114 variables. [2019-09-10 06:49:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:20,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:49:20,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:20,366 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) [2019-09-10 06:49:20,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:20,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:49:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:20,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:49:20,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:20,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:49:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:49:20,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 06:49:21,301 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:49:21,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [5] total 23 [2019-09-10 06:49:21,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:21,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:49:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:49:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:49:21,303 INFO L87 Difference]: Start difference. First operand 203264 states and 253097 transitions. Second operand 11 states. [2019-09-10 06:49:22,156 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 06:49:22,426 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 06:49:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:26,732 INFO L93 Difference]: Finished difference Result 324048 states and 402965 transitions. [2019-09-10 06:49:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:49:26,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-10 06:49:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:27,104 INFO L225 Difference]: With dead ends: 324048 [2019-09-10 06:49:27,104 INFO L226 Difference]: Without dead ends: 324048 [2019-09-10 06:49:27,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:49:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324048 states. [2019-09-10 06:49:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324048 to 237333. [2019-09-10 06:49:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237333 states. [2019-09-10 06:49:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237333 states to 237333 states and 295565 transitions. [2019-09-10 06:49:29,789 INFO L78 Accepts]: Start accepts. Automaton has 237333 states and 295565 transitions. Word has length 99 [2019-09-10 06:49:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:29,790 INFO L475 AbstractCegarLoop]: Abstraction has 237333 states and 295565 transitions. [2019-09-10 06:49:29,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:49:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 237333 states and 295565 transitions. [2019-09-10 06:49:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:49:29,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:29,795 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:29,795 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -73895053, now seen corresponding path program 1 times [2019-09-10 06:49:29,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:29,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:29,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:29,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:29,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:29,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:29,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:49:29,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:29,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:49:29,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:49:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:29,860 INFO L87 Difference]: Start difference. First operand 237333 states and 295565 transitions. Second operand 3 states. [2019-09-10 06:49:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:30,492 INFO L93 Difference]: Finished difference Result 237335 states and 289672 transitions. [2019-09-10 06:49:30,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:49:30,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 06:49:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:30,736 INFO L225 Difference]: With dead ends: 237335 [2019-09-10 06:49:30,736 INFO L226 Difference]: Without dead ends: 237335 [2019-09-10 06:49:30,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:49:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237335 states. [2019-09-10 06:49:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237335 to 234406. [2019-09-10 06:49:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234406 states. [2019-09-10 06:49:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234406 states to 234406 states and 286144 transitions. [2019-09-10 06:49:33,661 INFO L78 Accepts]: Start accepts. Automaton has 234406 states and 286144 transitions. Word has length 99 [2019-09-10 06:49:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:33,661 INFO L475 AbstractCegarLoop]: Abstraction has 234406 states and 286144 transitions. [2019-09-10 06:49:33,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:49:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 234406 states and 286144 transitions. [2019-09-10 06:49:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:49:33,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:33,666 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:33,666 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1387106381, now seen corresponding path program 1 times [2019-09-10 06:49:33,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:33,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:33,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:33,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:33,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:49:33,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 06:49:33,787 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [147], [150], [153], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [317], [322], [333], [337], [350], [358], [377], [388], [390], [393], [396], [399], [401], [403], [445], [458], [466], [485], [497], [511], [523], [531], [547], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:49:33,788 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:49:33,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:49:33,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:49:33,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:49:33,938 INFO L272 AbstractInterpreter]: Visited 93 different actions 346 times. Merged at 34 different actions 226 times. Widened at 13 different actions 32 times. Performed 1177 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 10 different actions. Largest state had 114 variables. [2019-09-10 06:49:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:33,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:49:33,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:49:33,938 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) [2019-09-10 06:49:33,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:33,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:49:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:34,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 06:49:34,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:49:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:34,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:49:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:34,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:49:34,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 18 [2019-09-10 06:49:34,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:49:34,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:49:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:49:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:49:34,447 INFO L87 Difference]: Start difference. First operand 234406 states and 286144 transitions. Second operand 11 states. [2019-09-10 06:49:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:35,389 INFO L93 Difference]: Finished difference Result 356089 states and 429722 transitions. [2019-09-10 06:49:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:49:35,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-10 06:49:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:39,983 INFO L225 Difference]: With dead ends: 356089 [2019-09-10 06:49:39,983 INFO L226 Difference]: Without dead ends: 356089 [2019-09-10 06:49:39,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:49:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356089 states. [2019-09-10 06:49:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356089 to 287706. [2019-09-10 06:49:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287706 states. [2019-09-10 06:49:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287706 states to 287706 states and 349849 transitions. [2019-09-10 06:49:42,479 INFO L78 Accepts]: Start accepts. Automaton has 287706 states and 349849 transitions. Word has length 99 [2019-09-10 06:49:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:42,479 INFO L475 AbstractCegarLoop]: Abstraction has 287706 states and 349849 transitions. [2019-09-10 06:49:42,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:49:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 287706 states and 349849 transitions. [2019-09-10 06:49:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:49:42,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:42,486 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:42,486 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1894982123, now seen corresponding path program 1 times [2019-09-10 06:49:42,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:42,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:42,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:42,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:42,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:49:42,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:42,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:49:42,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:42,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:49:42,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:49:42,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:49:42,544 INFO L87 Difference]: Start difference. First operand 287706 states and 349849 transitions. Second operand 4 states. [2019-09-10 06:49:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:44,833 INFO L93 Difference]: Finished difference Result 440558 states and 535627 transitions. [2019-09-10 06:49:44,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:49:44,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:49:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:45,316 INFO L225 Difference]: With dead ends: 440558 [2019-09-10 06:49:45,316 INFO L226 Difference]: Without dead ends: 440558 [2019-09-10 06:49:45,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:49:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440558 states. [2019-09-10 06:49:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440558 to 273090. [2019-09-10 06:49:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273090 states. [2019-09-10 06:49:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273090 states to 273090 states and 332128 transitions. [2019-09-10 06:49:53,930 INFO L78 Accepts]: Start accepts. Automaton has 273090 states and 332128 transitions. Word has length 108 [2019-09-10 06:49:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:49:53,931 INFO L475 AbstractCegarLoop]: Abstraction has 273090 states and 332128 transitions. [2019-09-10 06:49:53,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:49:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 273090 states and 332128 transitions. [2019-09-10 06:49:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:49:53,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:49:53,937 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:49:53,938 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:49:53,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:49:53,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1134154608, now seen corresponding path program 1 times [2019-09-10 06:49:53,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:49:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:53,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:49:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:49:53,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:49:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:49:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:49:53,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:49:53,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:49:53,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:49:53,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:49:53,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:49:53,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:49:53,985 INFO L87 Difference]: Start difference. First operand 273090 states and 332128 transitions. Second operand 5 states. [2019-09-10 06:49:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:49:54,748 INFO L93 Difference]: Finished difference Result 284182 states and 343063 transitions. [2019-09-10 06:49:54,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:49:54,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-10 06:49:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:49:55,051 INFO L225 Difference]: With dead ends: 284182 [2019-09-10 06:49:55,052 INFO L226 Difference]: Without dead ends: 284182 [2019-09-10 06:49:55,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:49:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284182 states. [2019-09-10 06:50:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284182 to 264698. [2019-09-10 06:50:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264698 states. [2019-09-10 06:50:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264698 states to 264698 states and 319568 transitions. [2019-09-10 06:50:02,254 INFO L78 Accepts]: Start accepts. Automaton has 264698 states and 319568 transitions. Word has length 108 [2019-09-10 06:50:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:02,254 INFO L475 AbstractCegarLoop]: Abstraction has 264698 states and 319568 transitions. [2019-09-10 06:50:02,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:50:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 264698 states and 319568 transitions. [2019-09-10 06:50:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:50:02,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:02,262 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:02,262 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1423111520, now seen corresponding path program 1 times [2019-09-10 06:50:02,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:02,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:02,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:02,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:02,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:02,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 06:50:02,601 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], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [499], [509], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:50:02,605 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:02,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:02,617 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:02,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:02,787 INFO L272 AbstractInterpreter]: Visited 106 different actions 380 times. Merged at 41 different actions 248 times. Widened at 13 different actions 34 times. Performed 1252 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 19 fixpoints after 10 different actions. Largest state had 117 variables. [2019-09-10 06:50:02,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:02,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:02,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:02,788 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-09-10 06:50:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:02,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:50:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:02,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:50:02,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:02,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:03,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:03,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:03,871 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:50:03,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [12] total 32 [2019-09-10 06:50:03,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:03,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:50:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:50:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:50:03,874 INFO L87 Difference]: Start difference. First operand 264698 states and 319568 transitions. Second operand 12 states. [2019-09-10 06:50:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:05,808 INFO L93 Difference]: Finished difference Result 291073 states and 350533 transitions. [2019-09-10 06:50:05,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:50:05,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-10 06:50:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:06,116 INFO L225 Difference]: With dead ends: 291073 [2019-09-10 06:50:06,117 INFO L226 Difference]: Without dead ends: 291073 [2019-09-10 06:50:06,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:50:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291073 states. [2019-09-10 06:50:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291073 to 283543. [2019-09-10 06:50:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283543 states. [2019-09-10 06:50:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283543 states to 283543 states and 341789 transitions. [2019-09-10 06:50:12,821 INFO L78 Accepts]: Start accepts. Automaton has 283543 states and 341789 transitions. Word has length 111 [2019-09-10 06:50:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:12,821 INFO L475 AbstractCegarLoop]: Abstraction has 283543 states and 341789 transitions. [2019-09-10 06:50:12,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:50:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 283543 states and 341789 transitions. [2019-09-10 06:50:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:50:12,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:12,828 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:12,828 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 168777847, now seen corresponding path program 1 times [2019-09-10 06:50:12,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:12,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:12,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:50:12,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:12,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:50:12,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:12,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:50:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:50:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:50:12,874 INFO L87 Difference]: Start difference. First operand 283543 states and 341789 transitions. Second operand 4 states. [2019-09-10 06:50:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:13,852 INFO L93 Difference]: Finished difference Result 390750 states and 469141 transitions. [2019-09-10 06:50:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:13,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:50:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:14,273 INFO L225 Difference]: With dead ends: 390750 [2019-09-10 06:50:14,274 INFO L226 Difference]: Without dead ends: 390750 [2019-09-10 06:50:14,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:50:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390750 states. [2019-09-10 06:50:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390750 to 283418. [2019-09-10 06:50:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283418 states. [2019-09-10 06:50:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283418 states to 283418 states and 341631 transitions. [2019-09-10 06:50:19,278 INFO L78 Accepts]: Start accepts. Automaton has 283418 states and 341631 transitions. Word has length 111 [2019-09-10 06:50:19,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:19,279 INFO L475 AbstractCegarLoop]: Abstraction has 283418 states and 341631 transitions. [2019-09-10 06:50:19,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:50:19,279 INFO L276 IsEmpty]: Start isEmpty. Operand 283418 states and 341631 transitions. [2019-09-10 06:50:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:50:19,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:19,283 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:19,283 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash 805339762, now seen corresponding path program 1 times [2019-09-10 06:50:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:19,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:19,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:19,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:50:19,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 06:50:19,561 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], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [145], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [335], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [497], [523], [531], [547], [610], [611], [615], [616], [617] [2019-09-10 06:50:19,563 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:50:19,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:50:19,576 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:50:19,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:50:19,759 INFO L272 AbstractInterpreter]: Visited 106 different actions 413 times. Merged at 41 different actions 281 times. Widened at 11 different actions 37 times. Performed 1334 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1334 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 10 different actions. Largest state had 117 variables. [2019-09-10 06:50:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:19,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:50:19,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:50:19,759 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-09-10 06:50:19,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:19,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:50:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:19,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:50:19,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:50:19,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:19,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:19,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:20,298 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:50:20,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:50:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:50:21,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:50:21,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 06:50:21,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:50:21,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 06:50:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 06:50:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2019-09-10 06:50:21,012 INFO L87 Difference]: Start difference. First operand 283418 states and 341631 transitions. Second operand 22 states. [2019-09-10 06:50:27,299 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-09-10 06:50:28,227 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-09-10 06:50:28,444 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-09-10 06:50:28,637 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:50:29,264 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:50:29,584 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:50:29,911 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-09-10 06:50:30,114 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-10 06:50:30,261 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:50:30,449 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 06:50:31,187 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-10 06:50:31,335 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:50:31,922 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:50:33,430 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 06:50:35,490 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:50:35,825 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:50:35,988 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 06:50:36,174 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-09-10 06:50:36,366 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 06:50:36,694 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 06:50:37,769 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:50:38,073 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 06:50:38,487 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-10 06:50:39,610 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 06:50:41,520 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-09-10 06:50:43,162 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-09-10 06:50:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:47,334 INFO L93 Difference]: Finished difference Result 757596 states and 905486 transitions. [2019-09-10 06:50:47,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-10 06:50:47,334 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-09-10 06:50:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:50:48,297 INFO L225 Difference]: With dead ends: 757596 [2019-09-10 06:50:48,298 INFO L226 Difference]: Without dead ends: 757596 [2019-09-10 06:50:48,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8299 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=5132, Invalid=21274, Unknown=0, NotChecked=0, Total=26406 [2019-09-10 06:50:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757596 states. [2019-09-10 06:50:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757596 to 283404. [2019-09-10 06:50:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283404 states. [2019-09-10 06:50:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283404 states to 283404 states and 341614 transitions. [2019-09-10 06:50:55,275 INFO L78 Accepts]: Start accepts. Automaton has 283404 states and 341614 transitions. Word has length 111 [2019-09-10 06:50:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:50:55,275 INFO L475 AbstractCegarLoop]: Abstraction has 283404 states and 341614 transitions. [2019-09-10 06:50:55,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 06:50:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 283404 states and 341614 transitions. [2019-09-10 06:50:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:50:55,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:50:55,280 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:50:55,280 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:50:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:50:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash -232607389, now seen corresponding path program 1 times [2019-09-10 06:50:55,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:50:55,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:55,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:50:55,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:50:55,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:50:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:50:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:50:55,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:50:55,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:50:55,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:50:55,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:50:55,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:50:55,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:50:55,329 INFO L87 Difference]: Start difference. First operand 283404 states and 341614 transitions. Second operand 4 states. [2019-09-10 06:50:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:50:56,343 INFO L93 Difference]: Finished difference Result 446267 states and 536499 transitions. [2019-09-10 06:50:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:50:56,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 06:50:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:01,760 INFO L225 Difference]: With dead ends: 446267 [2019-09-10 06:51:01,761 INFO L226 Difference]: Without dead ends: 446267 [2019-09-10 06:51:01,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:51:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446267 states. [2019-09-10 06:51:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446267 to 321262. [2019-09-10 06:51:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321262 states. [2019-09-10 06:51:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321262 states to 321262 states and 387066 transitions. [2019-09-10 06:51:05,083 INFO L78 Accepts]: Start accepts. Automaton has 321262 states and 387066 transitions. Word has length 111 [2019-09-10 06:51:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:05,084 INFO L475 AbstractCegarLoop]: Abstraction has 321262 states and 387066 transitions. [2019-09-10 06:51:05,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:51:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 321262 states and 387066 transitions. [2019-09-10 06:51:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:51:05,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:05,088 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:05,088 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1669773282, now seen corresponding path program 1 times [2019-09-10 06:51:05,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:05,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:05,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:05,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:51:05,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:51:05,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:51:05,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:51:05,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:51:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:51:05,363 INFO L87 Difference]: Start difference. First operand 321262 states and 387066 transitions. Second operand 12 states. [2019-09-10 06:51:07,066 WARN L188 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 06:51:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:08,796 INFO L93 Difference]: Finished difference Result 410246 states and 494398 transitions. [2019-09-10 06:51:08,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 06:51:08,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-09-10 06:51:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:09,286 INFO L225 Difference]: With dead ends: 410246 [2019-09-10 06:51:09,287 INFO L226 Difference]: Without dead ends: 410246 [2019-09-10 06:51:09,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:51:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410246 states. [2019-09-10 06:51:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410246 to 321139. [2019-09-10 06:51:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321139 states. [2019-09-10 06:51:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321139 states to 321139 states and 386929 transitions. [2019-09-10 06:51:18,094 INFO L78 Accepts]: Start accepts. Automaton has 321139 states and 386929 transitions. Word has length 111 [2019-09-10 06:51:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:18,095 INFO L475 AbstractCegarLoop]: Abstraction has 321139 states and 386929 transitions. [2019-09-10 06:51:18,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:51:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 321139 states and 386929 transitions. [2019-09-10 06:51:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:51:18,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:18,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:18,099 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1361145022, now seen corresponding path program 1 times [2019-09-10 06:51:18,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:18,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:18,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:18,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:18,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:18,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:51:18,558 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [153], [156], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [490], [493], [511], [521], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:51:18,560 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:18,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:18,572 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:18,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:51:18,644 INFO L272 AbstractInterpreter]: Visited 107 different actions 195 times. Merged at 38 different actions 77 times. Never widened. Performed 762 root evaluator evaluations with a maximum evaluation depth of 5. Performed 762 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 117 variables. [2019-09-10 06:51:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:18,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:51:18,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:18,645 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) [2019-09-10 06:51:18,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:18,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:51:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:18,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 06:51:18,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:51:18,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:18,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:18,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:19,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:51:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:19,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:51:19,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 30 [2019-09-10 06:51:19,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:51:19,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 06:51:19,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 06:51:19,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:51:19,603 INFO L87 Difference]: Start difference. First operand 321139 states and 386929 transitions. Second operand 24 states. [2019-09-10 06:51:22,982 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2019-09-10 06:51:23,694 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 06:51:24,068 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 06:51:24,962 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 06:51:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:51:29,539 INFO L93 Difference]: Finished difference Result 476570 states and 571324 transitions. [2019-09-10 06:51:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:51:29,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2019-09-10 06:51:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:51:30,127 INFO L225 Difference]: With dead ends: 476570 [2019-09-10 06:51:30,128 INFO L226 Difference]: Without dead ends: 476570 [2019-09-10 06:51:30,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 06:51:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476570 states. [2019-09-10 06:51:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476570 to 343087. [2019-09-10 06:51:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343087 states. [2019-09-10 06:51:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343087 states to 343087 states and 412461 transitions. [2019-09-10 06:51:34,432 INFO L78 Accepts]: Start accepts. Automaton has 343087 states and 412461 transitions. Word has length 112 [2019-09-10 06:51:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:51:34,432 INFO L475 AbstractCegarLoop]: Abstraction has 343087 states and 412461 transitions. [2019-09-10 06:51:34,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 06:51:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 343087 states and 412461 transitions. [2019-09-10 06:51:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 06:51:34,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:51:34,436 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:51:34,437 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:51:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1994384747, now seen corresponding path program 1 times [2019-09-10 06:51:34,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:51:34,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:34,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:34,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:51:34,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:51:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:36,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:36,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:51:36,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 06:51:36,556 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [511], [521], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:51:36,559 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:51:36,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:51:36,570 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:51:36,651 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:51:36,651 INFO L272 AbstractInterpreter]: Visited 107 different actions 210 times. Merged at 39 different actions 91 times. Never widened. Performed 783 root evaluator evaluations with a maximum evaluation depth of 5. Performed 783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 117 variables. [2019-09-10 06:51:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:51:36,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:51:36,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:51:36,652 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-09-10 06:51:36,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:51:36,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:51:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:51:36,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 06:51:36,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:51:36,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:36,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:37,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:37,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:37,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:51:37,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:51:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:51:38,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:51:38,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 40 [2019-09-10 06:51:38,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:51:38,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 06:51:38,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 06:51:38,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:51:38,137 INFO L87 Difference]: Start difference. First operand 343087 states and 412461 transitions. Second operand 30 states. [2019-09-10 06:51:38,519 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2019-09-10 06:51:39,717 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-09-10 06:51:39,977 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-09-10 06:51:40,181 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 06:51:40,413 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 06:51:40,709 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-10 06:51:41,509 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 06:51:41,895 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-09-10 06:51:42,159 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 06:51:42,712 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:51:43,350 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 06:51:43,738 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 06:51:47,586 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 06:51:48,048 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:51:48,374 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 06:51:48,748 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:51:49,406 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:51:49,778 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:51:50,477 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:51:50,944 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:51:51,310 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:51:51,685 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:51:52,156 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:51:52,415 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 06:51:52,607 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:51:52,979 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 06:51:53,274 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 06:51:53,664 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-10 06:51:54,007 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 06:51:54,619 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:51:55,035 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-09-10 06:51:55,267 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:51:55,612 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 06:51:56,115 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 06:51:56,419 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 06:51:56,745 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-09-10 06:51:57,018 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 06:51:57,527 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-10 06:51:57,940 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-09-10 06:51:58,276 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:51:58,588 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 06:51:59,432 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 06:52:00,037 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 06:52:00,333 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 06:52:00,898 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-10 06:52:01,226 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 06:52:01,694 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 06:52:01,998 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 06:52:02,528 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 06:52:03,557 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 06:52:03,887 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 06:52:04,187 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 06:52:04,438 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 06:52:04,897 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 06:52:05,209 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 06:52:05,428 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 06:52:05,862 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-10 06:52:06,244 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-10 06:52:06,494 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 06:52:06,775 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 06:52:07,327 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 06:52:07,675 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 06:52:08,058 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-09-10 06:52:08,422 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 06:52:08,753 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-09-10 06:52:09,223 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 06:52:09,562 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-10 06:52:09,865 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 06:52:10,158 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 88 [2019-09-10 06:52:10,783 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-09-10 06:52:11,020 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:52:11,523 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-10 06:52:11,747 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 06:52:11,999 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 06:52:12,463 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-09-10 06:52:12,830 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-10 06:52:13,087 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:52:13,375 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 06:52:13,556 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 06:52:14,252 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 06:52:15,152 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 06:52:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:16,401 INFO L93 Difference]: Finished difference Result 580235 states and 696454 transitions. [2019-09-10 06:52:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-10 06:52:16,402 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2019-09-10 06:52:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:17,076 INFO L225 Difference]: With dead ends: 580235 [2019-09-10 06:52:17,076 INFO L226 Difference]: Without dead ends: 580235 [2019-09-10 06:52:17,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=3617, Invalid=20253, Unknown=0, NotChecked=0, Total=23870 [2019-09-10 06:52:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580235 states. [2019-09-10 06:52:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580235 to 316674. [2019-09-10 06:52:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316674 states. [2019-09-10 06:52:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316674 states to 316674 states and 380364 transitions. [2019-09-10 06:52:22,309 INFO L78 Accepts]: Start accepts. Automaton has 316674 states and 380364 transitions. Word has length 112 [2019-09-10 06:52:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:22,310 INFO L475 AbstractCegarLoop]: Abstraction has 316674 states and 380364 transitions. [2019-09-10 06:52:22,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 06:52:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 316674 states and 380364 transitions. [2019-09-10 06:52:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:52:22,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:22,314 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:22,314 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1765900276, now seen corresponding path program 1 times [2019-09-10 06:52:22,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:22,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:22,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:23,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:23,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:23,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:52:23,208 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], [69], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [198], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [386], [390], [403], [411], [414], [417], [420], [422], [445], [448], [451], [454], [456], [458], [499], [509], [514], [519], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:52:23,212 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:23,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:23,222 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:23,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:52:23,378 INFO L272 AbstractInterpreter]: Visited 108 different actions 368 times. Merged at 42 different actions 239 times. Widened at 11 different actions 18 times. Performed 1291 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1291 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 10 different actions. Largest state had 117 variables. [2019-09-10 06:52:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:23,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:52:23,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:23,378 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-09-10 06:52:23,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:23,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:52:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:23,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:52:23,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:52:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:24,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:52:24,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:24,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:25,747 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:52:25,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [23] total 38 [2019-09-10 06:52:25,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:25,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:52:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:52:25,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1309, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:52:25,748 INFO L87 Difference]: Start difference. First operand 316674 states and 380364 transitions. Second operand 12 states. [2019-09-10 06:52:26,787 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-10 06:52:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:28,654 INFO L93 Difference]: Finished difference Result 333036 states and 399636 transitions. [2019-09-10 06:52:28,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:52:28,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2019-09-10 06:52:28,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:28,996 INFO L225 Difference]: With dead ends: 333036 [2019-09-10 06:52:28,996 INFO L226 Difference]: Without dead ends: 333036 [2019-09-10 06:52:28,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 06:52:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333036 states. [2019-09-10 06:52:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333036 to 320716. [2019-09-10 06:52:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320716 states. [2019-09-10 06:52:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320716 states to 320716 states and 385114 transitions. [2019-09-10 06:52:34,355 INFO L78 Accepts]: Start accepts. Automaton has 320716 states and 385114 transitions. Word has length 113 [2019-09-10 06:52:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:34,356 INFO L475 AbstractCegarLoop]: Abstraction has 320716 states and 385114 transitions. [2019-09-10 06:52:34,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:52:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 320716 states and 385114 transitions. [2019-09-10 06:52:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:52:34,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:34,361 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:34,361 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:34,361 INFO L82 PathProgramCache]: Analyzing trace with hash -3713276, now seen corresponding path program 1 times [2019-09-10 06:52:34,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:34,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:34,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:34,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:34,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:34,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:34,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:52:34,900 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:52:34,900 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], [69], [71], [75], [78], [81], [84], [86], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [142], [147], [150], [153], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [333], [337], [350], [358], [361], [364], [367], [369], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [497], [502], [507], [523], [531], [547], [610], [611], [615], [616], [617] [2019-09-10 06:52:34,904 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:52:34,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:52:34,917 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:52:40,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:52:40,582 INFO L272 AbstractInterpreter]: Visited 108 different actions 243 times. Merged at 42 different actions 122 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 13 fixpoints after 9 different actions. Largest state had 117 variables. [2019-09-10 06:52:40,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:40,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:52:40,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:52:40,583 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) [2019-09-10 06:52:40,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:40,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:52:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:40,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:52:40,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:52:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:42,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:52:42,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:52:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:52:42,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:52:42,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 31 [2019-09-10 06:52:42,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:52:42,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 06:52:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 06:52:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:52:42,806 INFO L87 Difference]: Start difference. First operand 320716 states and 385114 transitions. Second operand 27 states. [2019-09-10 06:52:44,937 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-10 06:52:45,493 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 06:52:45,788 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-09-10 06:52:45,968 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 06:52:46,950 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-09-10 06:52:47,433 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 06:52:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:52:50,133 INFO L93 Difference]: Finished difference Result 603582 states and 724829 transitions. [2019-09-10 06:52:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:52:50,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 113 [2019-09-10 06:52:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:52:50,883 INFO L225 Difference]: With dead ends: 603582 [2019-09-10 06:52:50,883 INFO L226 Difference]: Without dead ends: 603582 [2019-09-10 06:52:50,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 195 SyntacticMatches, 19 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 06:52:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603582 states. [2019-09-10 06:52:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603582 to 320746. [2019-09-10 06:52:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320746 states. [2019-09-10 06:52:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320746 states to 320746 states and 385144 transitions. [2019-09-10 06:52:56,162 INFO L78 Accepts]: Start accepts. Automaton has 320746 states and 385144 transitions. Word has length 113 [2019-09-10 06:52:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:52:56,162 INFO L475 AbstractCegarLoop]: Abstraction has 320746 states and 385144 transitions. [2019-09-10 06:52:56,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 06:52:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 320746 states and 385144 transitions. [2019-09-10 06:52:56,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:52:56,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:52:56,168 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:52:56,168 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:52:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:52:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1826730707, now seen corresponding path program 1 times [2019-09-10 06:52:56,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:52:56,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:52:56,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:52:56,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:52:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:52:57,423 WARN L188 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-09-10 06:52:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 06:52:57,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:52:57,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:52:57,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:52:57,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:52:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:52:57,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:52:57,573 INFO L87 Difference]: Start difference. First operand 320746 states and 385144 transitions. Second operand 12 states. [2019-09-10 06:52:58,016 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 06:52:58,183 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:52:58,364 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:52:58,549 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 06:52:58,752 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:52:58,957 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-10 06:52:59,129 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 06:52:59,295 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 06:53:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:00,682 INFO L93 Difference]: Finished difference Result 472979 states and 567569 transitions. [2019-09-10 06:53:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:53:00,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2019-09-10 06:53:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:06,434 INFO L225 Difference]: With dead ends: 472979 [2019-09-10 06:53:06,434 INFO L226 Difference]: Without dead ends: 472979 [2019-09-10 06:53:06,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2019-09-10 06:53:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472979 states. [2019-09-10 06:53:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472979 to 320627. [2019-09-10 06:53:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320627 states. [2019-09-10 06:53:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320627 states to 320627 states and 385014 transitions. [2019-09-10 06:53:09,591 INFO L78 Accepts]: Start accepts. Automaton has 320627 states and 385014 transitions. Word has length 113 [2019-09-10 06:53:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:09,592 INFO L475 AbstractCegarLoop]: Abstraction has 320627 states and 385014 transitions. [2019-09-10 06:53:09,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:53:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 320627 states and 385014 transitions. [2019-09-10 06:53:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 06:53:09,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:09,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:09,596 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:09,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1393001621, now seen corresponding path program 1 times [2019-09-10 06:53:09,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:09,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:09,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:09,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:09,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:10,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:10,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:10,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 06:53:10,521 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [153], [156], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [458], [466], [469], [472], [475], [477], [490], [495], [511], [521], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:53:10,523 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:10,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:10,530 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:11,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:11,481 INFO L272 AbstractInterpreter]: Visited 108 different actions 428 times. Merged at 41 different actions 292 times. Widened at 12 different actions 39 times. Performed 1409 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1409 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 117 variables. [2019-09-10 06:53:11,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:11,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:11,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:11,481 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:53:11,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:11,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:53:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:11,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 06:53:11,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:11,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:11,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:11,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:11,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:12,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:12,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:12,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:53:12,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 35 [2019-09-10 06:53:12,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:53:12,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:53:12,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:53:12,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:53:12,715 INFO L87 Difference]: Start difference. First operand 320627 states and 385014 transitions. Second operand 26 states. [2019-09-10 06:53:13,278 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-10 06:53:13,497 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 06:53:14,700 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-10 06:53:14,992 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 06:53:15,377 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 06:53:15,763 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 06:53:15,993 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:53:16,313 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 06:53:16,643 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:53:16,947 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 06:53:17,303 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:53:17,692 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 06:53:20,614 WARN L188 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 06:53:21,038 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-10 06:53:21,470 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-09-10 06:53:21,749 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 06:53:22,009 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-10 06:53:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:23,291 INFO L93 Difference]: Finished difference Result 513515 states and 617048 transitions. [2019-09-10 06:53:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 06:53:23,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 113 [2019-09-10 06:53:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:23,927 INFO L225 Difference]: With dead ends: 513515 [2019-09-10 06:53:23,927 INFO L226 Difference]: Without dead ends: 513515 [2019-09-10 06:53:23,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 197 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=758, Invalid=3024, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:53:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513515 states. [2019-09-10 06:53:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513515 to 307716. [2019-09-10 06:53:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307716 states. [2019-09-10 06:53:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307716 states to 307716 states and 369831 transitions. [2019-09-10 06:53:28,828 INFO L78 Accepts]: Start accepts. Automaton has 307716 states and 369831 transitions. Word has length 113 [2019-09-10 06:53:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:28,828 INFO L475 AbstractCegarLoop]: Abstraction has 307716 states and 369831 transitions. [2019-09-10 06:53:28,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:53:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 307716 states and 369831 transitions. [2019-09-10 06:53:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:53:28,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:28,833 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:28,834 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash 976093693, now seen corresponding path program 1 times [2019-09-10 06:53:28,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:28,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:28,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:28,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:29,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:29,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:53:29,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 06:53:29,233 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], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [206], [208], [211], [214], [217], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [326], [329], [337], [340], [343], [346], [348], [350], [388], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [610], [611], [615], [616], [617] [2019-09-10 06:53:29,237 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:53:29,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:53:29,244 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:53:29,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:53:29,395 INFO L272 AbstractInterpreter]: Visited 110 different actions 409 times. Merged at 40 different actions 272 times. Widened at 14 different actions 29 times. Performed 1296 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1296 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 12 different actions. Largest state had 118 variables. [2019-09-10 06:53:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:29,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:53:29,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:53:29,395 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:53:29,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:29,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:53:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:29,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 06:53:29,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:53:29,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:29,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:30,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:53:30,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:30,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:53:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:35,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:53:35,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 38 [2019-09-10 06:53:35,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:53:35,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 06:53:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 06:53:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 06:53:35,823 INFO L87 Difference]: Start difference. First operand 307716 states and 369831 transitions. Second operand 28 states. [2019-09-10 06:53:36,202 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:53:37,056 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-10 06:53:37,639 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:53:37,912 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:53:38,405 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:53:38,977 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-10 06:53:39,391 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 06:53:39,825 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-09-10 06:53:40,370 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:53:40,897 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-09-10 06:53:41,232 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:53:41,700 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:53:42,098 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-10 06:53:42,362 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:53:42,806 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 06:53:43,420 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-09-10 06:53:43,890 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:53:44,300 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:53:44,634 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-10 06:53:45,236 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-09-10 06:53:45,829 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-09-10 06:53:48,302 WARN L188 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:53:48,905 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-09-10 06:53:49,342 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:53:49,930 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-09-10 06:53:50,652 WARN L188 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-09-10 06:53:51,192 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 06:53:51,803 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:53:52,458 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-09-10 06:53:53,074 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 06:53:54,346 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-09-10 06:53:54,812 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-09-10 06:53:55,551 WARN L188 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 06:53:56,032 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 06:53:56,431 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 06:53:56,965 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 06:53:57,390 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:53:57,787 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:53:58,332 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-09-10 06:53:58,648 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-10 06:53:59,343 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-09-10 06:53:59,824 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-09-10 06:54:00,265 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:54:00,812 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 105 [2019-09-10 06:54:01,383 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 97 [2019-09-10 06:54:01,768 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 06:54:02,292 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-09-10 06:54:02,636 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-10 06:54:02,911 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:54:03,554 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-09-10 06:54:04,016 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-09-10 06:54:04,573 WARN L188 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-09-10 06:54:04,953 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 06:54:05,363 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 06:54:05,878 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:54:06,223 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-09-10 06:54:06,749 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-10 06:54:07,208 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2019-09-10 06:54:07,662 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 06:54:08,224 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-09-10 06:54:08,600 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-09-10 06:54:08,934 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:54:11,815 WARN L188 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-09-10 06:54:12,910 WARN L188 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 06:54:13,414 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:54:13,901 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-09-10 06:54:14,452 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:54:14,685 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-10 06:54:15,091 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 06:54:15,742 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 06:54:16,191 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:54:16,708 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:54:17,186 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-09-10 06:54:17,787 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:54:18,268 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:54:18,995 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:54:19,282 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:54:19,661 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:54:20,004 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 06:54:20,648 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-10 06:54:20,977 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:54:21,684 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 06:54:22,074 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:54:22,624 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:54:22,983 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:54:23,396 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 06:54:23,918 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-09-10 06:54:24,449 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2019-09-10 06:54:24,948 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:54:25,337 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 06:54:25,749 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-09-10 06:54:26,198 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-09-10 06:54:26,702 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 06:54:27,073 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:54:27,582 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 06:54:27,899 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 06:54:28,351 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-10 06:54:29,106 WARN L188 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-09-10 06:54:29,940 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 06:54:30,460 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 06:54:30,947 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 06:54:31,427 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 100 [2019-09-10 06:54:32,225 WARN L188 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 06:54:32,592 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:54:32,932 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:54:34,042 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-09-10 06:54:34,461 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-10 06:54:34,854 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:54:35,566 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 104 [2019-09-10 06:54:35,869 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 06:54:36,321 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 06:54:36,982 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-10 06:54:37,419 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2019-09-10 06:54:37,950 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-09-10 06:54:38,533 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-09-10 06:54:39,059 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 105 [2019-09-10 06:54:39,476 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 06:54:40,090 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-10 06:54:40,447 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:54:40,872 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:54:41,380 WARN L188 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-09-10 06:54:41,961 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 06:54:42,713 WARN L188 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-10 06:54:43,130 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 06:54:43,481 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-10 06:54:43,932 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 06:54:44,395 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:54:44,745 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 06:54:45,154 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:54:45,573 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 06:54:46,396 WARN L188 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-09-10 06:54:47,130 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2019-09-10 06:54:47,653 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:54:48,337 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-09-10 06:54:48,833 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-10 06:54:49,470 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-09-10 06:54:50,223 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 108 [2019-09-10 06:54:50,572 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:54:51,522 WARN L188 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 06:54:52,212 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-09-10 06:54:52,652 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:54:53,223 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-09-10 06:54:53,723 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2019-09-10 06:54:54,353 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2019-09-10 06:54:55,029 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-09-10 06:54:55,635 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-09-10 06:54:56,115 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 06:54:56,627 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:54:57,076 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2019-09-10 06:54:57,700 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-09-10 06:54:58,150 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2019-09-10 06:54:58,703 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-09-10 06:54:59,167 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-10 06:54:59,686 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-09-10 06:55:00,101 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2019-09-10 06:55:00,576 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 06:55:00,923 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:55:02,469 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:55:02,980 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-09-10 06:55:03,647 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-09-10 06:55:04,022 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 06:55:04,403 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:55:04,916 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 06:55:05,640 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 06:55:06,289 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-09-10 06:55:06,958 WARN L188 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:55:07,498 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 06:55:07,781 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:55:08,398 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 06:55:08,696 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-09-10 06:55:09,182 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 06:55:10,323 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-09-10 06:55:10,860 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-09-10 06:55:11,471 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:55:12,027 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2019-09-10 06:55:12,640 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-09-10 06:55:13,294 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 06:55:13,856 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:55:14,486 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 98 [2019-09-10 06:55:15,006 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-09-10 06:55:15,563 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2019-09-10 06:55:16,218 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:55:16,692 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:55:17,107 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:55:17,486 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:55:18,093 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-09-10 06:55:18,761 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-09-10 06:55:19,349 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-09-10 06:55:19,982 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-09-10 06:55:20,814 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-09-10 06:55:21,451 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-10 06:55:22,111 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:55:22,701 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2019-09-10 06:55:23,219 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:55:23,937 WARN L188 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 06:55:24,500 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 06:55:24,848 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-10 06:55:25,387 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-09-10 06:55:25,771 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-09-10 06:55:26,180 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-09-10 06:55:26,690 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-09-10 06:55:27,230 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-09-10 06:55:27,635 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 06:55:28,293 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 06:55:28,737 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2019-09-10 06:55:29,188 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:55:29,630 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-09-10 06:55:30,099 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-09-10 06:55:30,874 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-09-10 06:55:31,263 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:55:32,056 WARN L188 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2019-09-10 06:55:32,510 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-09-10 06:55:32,871 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-09-10 06:55:33,605 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 06:55:34,239 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-09-10 06:55:34,739 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 06:55:35,106 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-09-10 06:55:35,581 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-09-10 06:55:36,227 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-09-10 06:55:36,600 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:55:37,236 WARN L188 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 06:55:37,866 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-09-10 06:55:38,337 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 89 [2019-09-10 06:55:38,725 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:55:39,361 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-09-10 06:55:39,850 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:55:40,269 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-09-10 06:55:40,695 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2019-09-10 06:55:41,343 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-10 06:55:42,017 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-09-10 06:55:42,646 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2019-09-10 06:55:43,219 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:55:43,964 WARN L188 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-10 06:55:44,712 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-09-10 06:55:45,229 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:55:45,617 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 06:55:46,097 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:55:46,551 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-09-10 06:55:47,585 WARN L188 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-09-10 06:55:47,989 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:55:48,439 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:55:48,999 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-10 06:55:49,382 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:55:50,152 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-09-10 06:55:50,659 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2019-09-10 06:55:51,642 WARN L188 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2019-09-10 06:55:52,183 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 06:55:52,711 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:55:53,375 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-09-10 06:55:53,734 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:55:54,199 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:55:54,460 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-10 06:55:55,149 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-10 06:55:55,727 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-09-10 06:55:56,348 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 06:55:56,596 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 06:55:56,964 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 06:55:57,429 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-09-10 06:55:57,786 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-09-10 06:55:58,216 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-09-10 06:55:58,545 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 06:55:59,300 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-09-10 06:56:00,294 WARN L188 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-09-10 06:56:01,588 WARN L188 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 06:56:02,170 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:56:02,536 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-09-10 06:56:02,987 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:56:03,605 WARN L188 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2019-09-10 06:56:04,208 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:56:04,925 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-09-10 06:56:05,441 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 06:56:05,973 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-09-10 06:56:06,437 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2019-09-10 06:56:07,497 WARN L188 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 06:56:08,331 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 06:56:08,762 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-09-10 06:56:09,187 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-10 06:56:09,651 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:56:10,098 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 06:56:10,854 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-09-10 06:56:11,314 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2019-09-10 06:56:11,834 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-09-10 06:56:12,649 WARN L188 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-09-10 06:56:13,060 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 06:56:15,956 WARN L188 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-09-10 06:56:16,647 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-09-10 06:56:17,111 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-09-10 06:56:17,493 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-09-10 06:56:17,815 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-09-10 06:56:18,183 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-09-10 06:56:19,118 WARN L188 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2019-09-10 06:56:19,555 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-09-10 06:56:20,291 WARN L188 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-09-10 06:56:20,744 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-10 06:56:21,260 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-09-10 06:56:21,811 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-09-10 06:56:22,199 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-10 06:56:23,439 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-09-10 06:56:24,274 WARN L188 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-09-10 06:56:24,815 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-09-10 06:56:25,441 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 06:56:25,991 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-09-10 06:56:26,277 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-10 06:56:26,789 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-09-10 06:56:27,349 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 06:56:27,768 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-09-10 06:56:28,338 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2019-09-10 06:56:29,077 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-09-10 06:56:29,522 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 06:56:30,066 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-10 06:56:30,519 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-09-10 06:56:31,107 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-10 06:56:31,573 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 06:56:32,097 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-10 06:56:32,630 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-10 06:56:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:33,612 INFO L93 Difference]: Finished difference Result 743079 states and 881298 transitions. [2019-09-10 06:56:33,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 321 states. [2019-09-10 06:56:33,612 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 115 [2019-09-10 06:56:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:35,343 INFO L225 Difference]: With dead ends: 743079 [2019-09-10 06:56:35,344 INFO L226 Difference]: Without dead ends: 743079 [2019-09-10 06:56:35,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 180 SyntacticMatches, 31 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52862 ImplicationChecksByTransitivity, 162.1s TimeCoverageRelationStatistics Valid=16558, Invalid=110534, Unknown=0, NotChecked=0, Total=127092 [2019-09-10 06:56:35,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743079 states. [2019-09-10 06:56:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743079 to 319512. [2019-09-10 06:56:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319512 states. [2019-09-10 06:56:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319512 states to 319512 states and 383657 transitions. [2019-09-10 06:56:41,483 INFO L78 Accepts]: Start accepts. Automaton has 319512 states and 383657 transitions. Word has length 115 [2019-09-10 06:56:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:41,483 INFO L475 AbstractCegarLoop]: Abstraction has 319512 states and 383657 transitions. [2019-09-10 06:56:41,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 06:56:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 319512 states and 383657 transitions. [2019-09-10 06:56:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:56:41,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:41,488 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:41,488 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash -670355544, now seen corresponding path program 1 times [2019-09-10 06:56:41,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:41,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:41,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:41,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:41,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:56:41,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:41,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:56:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:56:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:41,546 INFO L87 Difference]: Start difference. First operand 319512 states and 383657 transitions. Second operand 3 states. [2019-09-10 06:56:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:41,743 INFO L93 Difference]: Finished difference Result 103625 states and 120321 transitions. [2019-09-10 06:56:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:41,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:56:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:41,834 INFO L225 Difference]: With dead ends: 103625 [2019-09-10 06:56:41,834 INFO L226 Difference]: Without dead ends: 103625 [2019-09-10 06:56:41,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103625 states. [2019-09-10 06:56:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103625 to 100728. [2019-09-10 06:56:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100728 states. [2019-09-10 06:56:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100728 states to 100728 states and 117200 transitions. [2019-09-10 06:56:44,295 INFO L78 Accepts]: Start accepts. Automaton has 100728 states and 117200 transitions. Word has length 117 [2019-09-10 06:56:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:44,295 INFO L475 AbstractCegarLoop]: Abstraction has 100728 states and 117200 transitions. [2019-09-10 06:56:44,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:56:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 100728 states and 117200 transitions. [2019-09-10 06:56:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:56:44,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:44,299 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:44,299 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash 186822146, now seen corresponding path program 1 times [2019-09-10 06:56:44,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:44,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:44,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:44,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:44,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:44,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:56:44,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 06:56:44,649 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], [69], [71], [75], [78], [81], [84], [86], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [128], [131], [133], [136], [139], [142], [145], [147], [150], [153], [156], [159], [161], [164], [167], [171], [192], [195], [198], [201], [206], [208], [211], [214], [217], [220], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [254], [259], [262], [265], [273], [324], [337], [340], [343], [346], [348], [350], [379], [382], [390], [393], [396], [399], [401], [403], [445], [448], [451], [454], [456], [458], [610], [611], [615], [616], [617] [2019-09-10 06:56:44,651 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:56:44,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:56:44,659 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:56:44,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:56:44,744 INFO L272 AbstractInterpreter]: Visited 112 different actions 240 times. Merged at 42 different actions 116 times. Never widened. Performed 891 root evaluator evaluations with a maximum evaluation depth of 5. Performed 891 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 7 different actions. Largest state had 118 variables. [2019-09-10 06:56:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:44,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:56:44,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:56:44,745 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:56:44,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:44,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:56:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:44,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-10 06:56:44,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:56:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:45,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:45,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:45,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:46,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:56:46,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:46,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:56:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:48,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:56:48,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2019-09-10 06:56:48,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:56:48,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 06:56:48,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 06:56:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 06:56:48,808 INFO L87 Difference]: Start difference. First operand 100728 states and 117200 transitions. Second operand 34 states. [2019-09-10 06:56:48,980 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 06:56:50,807 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-09-10 06:56:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:54,608 INFO L93 Difference]: Finished difference Result 199824 states and 232532 transitions. [2019-09-10 06:56:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:56:54,609 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 117 [2019-09-10 06:56:54,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:54,841 INFO L225 Difference]: With dead ends: 199824 [2019-09-10 06:56:54,842 INFO L226 Difference]: Without dead ends: 199824 [2019-09-10 06:56:54,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 186 SyntacticMatches, 18 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=510, Invalid=3650, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 06:56:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199824 states. [2019-09-10 06:56:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199824 to 100531. [2019-09-10 06:56:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100531 states. [2019-09-10 06:56:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100531 states to 100531 states and 116974 transitions. [2019-09-10 06:56:57,303 INFO L78 Accepts]: Start accepts. Automaton has 100531 states and 116974 transitions. Word has length 117 [2019-09-10 06:56:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:56:57,304 INFO L475 AbstractCegarLoop]: Abstraction has 100531 states and 116974 transitions. [2019-09-10 06:56:57,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 06:56:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 100531 states and 116974 transitions. [2019-09-10 06:56:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:56:57,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:56:57,307 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:56:57,307 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:56:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:56:57,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1468187216, now seen corresponding path program 1 times [2019-09-10 06:56:57,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:56:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:57,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:56:57,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:56:57,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:56:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:56:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:56:57,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:56:57,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:56:57,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:56:57,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:56:57,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:56:57,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:56:57,692 INFO L87 Difference]: Start difference. First operand 100531 states and 116974 transitions. Second operand 18 states. [2019-09-10 06:57:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:01,490 INFO L93 Difference]: Finished difference Result 134766 states and 156299 transitions. [2019-09-10 06:57:01,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:57:01,491 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2019-09-10 06:57:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:01,619 INFO L225 Difference]: With dead ends: 134766 [2019-09-10 06:57:01,619 INFO L226 Difference]: Without dead ends: 134766 [2019-09-10 06:57:01,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:57:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134766 states. [2019-09-10 06:57:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134766 to 101017. [2019-09-10 06:57:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101017 states. [2019-09-10 06:57:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101017 states to 101017 states and 117512 transitions. [2019-09-10 06:57:05,918 INFO L78 Accepts]: Start accepts. Automaton has 101017 states and 117512 transitions. Word has length 118 [2019-09-10 06:57:05,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:05,918 INFO L475 AbstractCegarLoop]: Abstraction has 101017 states and 117512 transitions. [2019-09-10 06:57:05,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:57:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 101017 states and 117512 transitions. [2019-09-10 06:57:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 06:57:05,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:05,925 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:05,925 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 175322984, now seen corresponding path program 1 times [2019-09-10 06:57:05,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:05,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:05,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-10 06:57:06,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:06,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:57:06,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:06,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:57:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:57:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:57:06,324 INFO L87 Difference]: Start difference. First operand 101017 states and 117512 transitions. Second operand 13 states. [2019-09-10 06:57:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:09,084 INFO L93 Difference]: Finished difference Result 138628 states and 160742 transitions. [2019-09-10 06:57:09,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 06:57:09,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 141 [2019-09-10 06:57:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:09,201 INFO L225 Difference]: With dead ends: 138628 [2019-09-10 06:57:09,202 INFO L226 Difference]: Without dead ends: 138628 [2019-09-10 06:57:09,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:57:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138628 states. [2019-09-10 06:57:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138628 to 104635. [2019-09-10 06:57:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104635 states. [2019-09-10 06:57:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104635 states to 104635 states and 121296 transitions. [2019-09-10 06:57:10,266 INFO L78 Accepts]: Start accepts. Automaton has 104635 states and 121296 transitions. Word has length 141 [2019-09-10 06:57:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:10,266 INFO L475 AbstractCegarLoop]: Abstraction has 104635 states and 121296 transitions. [2019-09-10 06:57:10,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:57:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 104635 states and 121296 transitions. [2019-09-10 06:57:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 06:57:10,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:10,273 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:10,273 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -117967079, now seen corresponding path program 1 times [2019-09-10 06:57:10,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:10,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 06:57:10,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:10,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:10,550 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2019-09-10 06:57:10,550 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], [69], [71], [75], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [198], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [275], [278], [281], [284], [286], [288], [317], [322], [335], [337], [350], [358], [377], [386], [388], [390], [403], [411], [414], [417], [420], [422], [430], [445], [448], [451], [454], [456], [458], [499], [509], [523], [531], [547], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:57:10,552 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:10,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:10,561 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:10,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:57:10,905 INFO L272 AbstractInterpreter]: Visited 104 different actions 573 times. Merged at 43 different actions 400 times. Widened at 15 different actions 62 times. Performed 1725 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1725 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 73 fixpoints after 15 different actions. Largest state had 116 variables. [2019-09-10 06:57:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:10,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:57:10,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:10,906 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:57:10,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:10,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:57:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:11,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:57:11,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:57:11,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:11,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:57:13,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:57:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 06:57:14,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:57:14,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 34 [2019-09-10 06:57:14,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:57:14,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 06:57:14,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 06:57:14,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:57:14,016 INFO L87 Difference]: Start difference. First operand 104635 states and 121296 transitions. Second operand 25 states. [2019-09-10 06:57:20,329 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-09-10 06:57:21,071 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 06:57:21,717 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 06:57:22,016 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 06:57:22,423 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-09-10 06:57:22,736 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 06:57:22,907 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 06:57:23,207 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 06:57:23,609 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-09-10 06:57:24,013 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 06:57:24,208 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 06:57:24,584 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 06:57:25,159 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 06:57:25,401 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 06:57:25,619 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:57:26,050 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 06:57:26,288 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 06:57:27,027 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 06:57:27,601 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-09-10 06:57:28,059 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 06:57:28,794 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 06:57:29,297 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 06:57:29,667 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 06:57:29,870 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 06:57:30,778 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 06:57:30,949 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:57:31,440 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 06:57:31,891 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 06:57:32,628 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 06:57:33,093 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 06:57:33,365 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 06:57:33,574 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-10 06:57:34,031 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-10 06:57:34,732 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 06:57:35,439 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 06:57:35,653 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2019-09-10 06:57:36,005 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 06:57:37,793 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-09-10 06:57:38,209 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:57:38,365 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:57:38,904 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-10 06:57:39,175 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 06:57:39,732 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 06:57:40,085 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 06:57:40,330 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-10 06:57:41,676 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-09-10 06:57:42,638 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 06:57:42,914 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 06:57:43,591 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 06:57:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:44,509 INFO L93 Difference]: Finished difference Result 258418 states and 296188 transitions. [2019-09-10 06:57:44,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 06:57:44,509 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2019-09-10 06:57:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:44,748 INFO L225 Difference]: With dead ends: 258418 [2019-09-10 06:57:44,748 INFO L226 Difference]: Without dead ends: 258418 [2019-09-10 06:57:44,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 257 SyntacticMatches, 11 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7329 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=3762, Invalid=20418, Unknown=0, NotChecked=0, Total=24180 [2019-09-10 06:57:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258418 states. [2019-09-10 06:57:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258418 to 159259. [2019-09-10 06:57:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159259 states. [2019-09-10 06:57:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159259 states to 159259 states and 184314 transitions. [2019-09-10 06:57:46,490 INFO L78 Accepts]: Start accepts. Automaton has 159259 states and 184314 transitions. Word has length 143 [2019-09-10 06:57:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:46,490 INFO L475 AbstractCegarLoop]: Abstraction has 159259 states and 184314 transitions. [2019-09-10 06:57:46,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 06:57:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 159259 states and 184314 transitions. [2019-09-10 06:57:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 06:57:46,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:46,498 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:46,498 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:46,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1611272552, now seen corresponding path program 1 times [2019-09-10 06:57:46,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:46,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:46,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 06:57:47,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:47,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:47,438 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2019-09-10 06:57:47,438 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [71], [75], [88], [92], [95], [98], [101], [103], [105], [108], [111], [115], [118], [122], [125], [133], [136], [147], [150], [161], [164], [167], [171], [192], [195], [206], [208], [211], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [251], [259], [269], [273], [275], [288], [296], [315], [317], [322], [335], [337], [340], [343], [346], [348], [350], [388], [390], [403], [411], [430], [445], [458], [466], [469], [472], [475], [477], [499], [511], [521], [552], [568], [573], [589], [610], [611], [615], [616], [617] [2019-09-10 06:57:47,440 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:47,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:47,450 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:47,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:57:47,620 INFO L272 AbstractInterpreter]: Visited 100 different actions 427 times. Merged at 38 different actions 287 times. Widened at 13 different actions 46 times. Performed 1413 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1413 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 11 different actions. Largest state had 115 variables. [2019-09-10 06:57:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:47,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:57:47,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:47,620 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:57:47,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:47,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:57:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:47,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 06:57:47,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:57:47,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:47,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:47,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:47,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 59 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:57:48,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:57:48,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:57:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 59 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:57:48,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:57:48,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 31 [2019-09-10 06:57:48,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:57:48,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 06:57:48,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 06:57:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:57:48,645 INFO L87 Difference]: Start difference. First operand 159259 states and 184314 transitions. Second operand 26 states. [2019-09-10 06:57:52,525 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2019-09-10 06:57:52,823 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 06:57:53,587 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 43 [2019-09-10 06:57:53,869 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-09-10 06:57:54,252 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-10 06:57:54,434 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2019-09-10 06:57:54,744 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 43 [2019-09-10 06:57:55,199 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 06:57:55,407 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-10 06:57:55,593 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-10 06:57:55,767 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:57:56,031 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-10 06:57:56,652 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 06:57:57,288 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-09-10 06:57:57,554 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-10 06:57:57,872 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:57:58,711 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 06:57:59,575 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 06:58:00,268 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 06:58:00,852 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 06:58:02,067 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 06:58:02,438 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 06:58:03,108 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 06:58:03,469 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 06:58:04,024 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 06:58:04,237 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-09-10 06:58:04,677 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 06:58:05,170 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-10 06:58:06,158 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 06:58:08,357 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 06:58:08,850 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-10 06:58:09,204 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 06:58:10,028 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 06:58:10,374 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 06:58:11,239 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 06:58:12,130 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 06:58:13,522 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 06:58:13,751 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 06:58:14,452 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 06:58:16,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:16,145 INFO L93 Difference]: Finished difference Result 241874 states and 280004 transitions. [2019-09-10 06:58:16,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 06:58:16,146 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 144 [2019-09-10 06:58:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:16,412 INFO L225 Difference]: With dead ends: 241874 [2019-09-10 06:58:16,413 INFO L226 Difference]: Without dead ends: 241874 [2019-09-10 06:58:16,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 269 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2651 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1830, Invalid=9090, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 06:58:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241874 states. [2019-09-10 06:58:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241874 to 172484. [2019-09-10 06:58:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172484 states. [2019-09-10 06:58:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172484 states to 172484 states and 199849 transitions. [2019-09-10 06:58:18,762 INFO L78 Accepts]: Start accepts. Automaton has 172484 states and 199849 transitions. Word has length 144 [2019-09-10 06:58:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:18,763 INFO L475 AbstractCegarLoop]: Abstraction has 172484 states and 199849 transitions. [2019-09-10 06:58:18,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 06:58:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 172484 states and 199849 transitions. [2019-09-10 06:58:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 06:58:18,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:18,771 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:18,771 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:18,772 INFO L82 PathProgramCache]: Analyzing trace with hash -195414294, now seen corresponding path program 1 times [2019-09-10 06:58:18,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:18,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:18,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:18,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:18,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 06:58:19,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:19,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 06:58:19,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:19,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 06:58:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 06:58:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:58:19,154 INFO L87 Difference]: Start difference. First operand 172484 states and 199849 transitions. Second operand 15 states. [2019-09-10 06:58:21,420 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-10 06:58:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:26,362 INFO L93 Difference]: Finished difference Result 239325 states and 277691 transitions. [2019-09-10 06:58:26,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 06:58:26,362 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 144 [2019-09-10 06:58:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:26,619 INFO L225 Difference]: With dead ends: 239325 [2019-09-10 06:58:26,619 INFO L226 Difference]: Without dead ends: 239325 [2019-09-10 06:58:26,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=475, Invalid=1687, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 06:58:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239325 states. [2019-09-10 06:58:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239325 to 172411. [2019-09-10 06:58:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172411 states. [2019-09-10 06:58:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172411 states to 172411 states and 199767 transitions. [2019-09-10 06:58:28,251 INFO L78 Accepts]: Start accepts. Automaton has 172411 states and 199767 transitions. Word has length 144 [2019-09-10 06:58:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:28,251 INFO L475 AbstractCegarLoop]: Abstraction has 172411 states and 199767 transitions. [2019-09-10 06:58:28,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 06:58:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 172411 states and 199767 transitions. [2019-09-10 06:58:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 06:58:28,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:28,259 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:28,259 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:28,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1078502161, now seen corresponding path program 1 times [2019-09-10 06:58:28,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:28,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:28,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:28,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:28,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:58:29,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:29,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:58:29,148 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 06:58:29,148 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], [69], [71], [75], [88], [92], [105], [108], [111], [115], [118], [122], [133], [136], [139], [147], [150], [161], [164], [167], [171], [192], [195], [198], [206], [208], [211], [214], [222], [224], [227], [230], [232], [234], [237], [238], [240], [243], [248], [259], [271], [273], [275], [278], [281], [284], [286], [288], [317], [322], [333], [335], [337], [350], [358], [377], [386], [390], [403], [411], [414], [417], [420], [422], [430], [445], [448], [451], [454], [456], [458], [499], [509], [523], [531], [547], [552], [568], [610], [611], [615], [616], [617] [2019-09-10 06:58:29,150 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:58:29,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:58:29,159 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:58:29,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:58:29,367 INFO L272 AbstractInterpreter]: Visited 105 different actions 559 times. Merged at 44 different actions 383 times. Widened at 15 different actions 60 times. Performed 1722 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1722 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 67 fixpoints after 16 different actions. Largest state had 116 variables. [2019-09-10 06:58:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:29,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:58:29,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:29,367 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:58:29,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:29,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:58:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:29,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 06:58:29,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:58:29,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:29,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:29,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:29,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:58:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:58:30,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:58:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 06:58:31,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:58:31,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 36 [2019-09-10 06:58:31,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:58:31,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 06:58:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 06:58:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1176, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:58:31,112 INFO L87 Difference]: Start difference. First operand 172411 states and 199767 transitions. Second operand 30 states. [2019-09-10 06:58:31,314 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 06:58:32,247 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2019-09-10 06:58:32,622 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-09-10 06:58:32,881 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-09-10 06:58:33,258 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2019-09-10 06:58:33,958 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 69 [2019-09-10 06:58:34,205 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 06:58:34,406 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 06:58:34,840 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-09-10 06:58:35,532 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 59 [2019-09-10 06:58:35,951 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 66 [2019-09-10 06:58:36,195 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 06:58:36,677 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 06:58:37,313 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 06:58:37,684 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-10 06:58:38,144 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 82 [2019-09-10 06:58:38,722 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 91 [2019-09-10 06:58:39,273 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 94 [2019-09-10 06:58:39,595 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 06:58:40,025 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 71 [2019-09-10 06:58:40,536 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 06:58:40,830 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 06:58:41,211 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 06:58:41,640 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-10 06:58:42,186 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 97 [2019-09-10 06:58:42,763 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 06:58:43,268 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 06:58:43,574 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-09-10 06:58:44,280 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 93 [2019-09-10 06:58:44,765 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 85 [2019-09-10 06:58:45,144 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-10 06:58:45,742 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 87 [2019-09-10 06:58:46,435 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 88 [2019-09-10 06:58:47,011 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 06:58:47,301 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 06:58:47,910 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 87 [2019-09-10 06:58:48,461 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 100 [2019-09-10 06:58:50,324 WARN L188 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2019-09-10 06:58:51,699 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 100 [2019-09-10 06:58:52,057 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 06:58:52,680 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2019-09-10 06:58:52,970 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 06:58:53,292 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:58:53,528 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 06:58:54,322 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-09-10 06:58:54,647 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-09-10 06:58:55,494 WARN L188 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2019-09-10 06:58:56,287 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2019-09-10 06:58:56,510 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 06:58:56,961 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 06:58:57,252 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-09-10 06:58:57,589 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 06:58:58,202 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90