java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:00:46,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:00:46,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:00:46,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:00:46,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:00:46,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:00:46,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:00:46,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:00:46,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:00:46,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:00:46,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:00:46,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:00:46,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:00:46,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:00:46,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:00:46,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:00:46,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:00:46,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:00:46,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:00:46,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:00:46,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:00:46,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:00:46,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:00:46,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:00:46,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:00:46,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:00:46,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:00:46,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:00:46,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:00:46,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:00:46,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:00:46,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:00:46,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:00:46,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:00:46,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:00:46,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:00:46,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:00:46,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:00:46,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:00:46,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:00:46,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:00:46,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 03:00:46,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:00:46,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:00:46,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:00:46,353 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:00:46,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:00:46,354 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:00:46,354 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:00:46,355 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:00:46,355 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:00:46,355 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:00:46,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:00:46,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:00:46,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:00:46,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:00:46,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:00:46,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:00:46,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:00:46,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:00:46,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:00:46,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:00:46,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:00:46,358 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:00:46,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:00:46,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:00:46,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:00:46,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:00:46,359 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:00:46,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:00:46,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:00:46,360 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:00:46,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:00:46,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:00:46,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:00:46,405 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:00:46,406 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:00:46,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-03 03:00:46,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f0580f9/bb8cec0c98c449e9842d4b54ad298beb/FLAG314530884 [2019-10-03 03:00:47,194 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:00:47,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-03 03:00:47,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f0580f9/bb8cec0c98c449e9842d4b54ad298beb/FLAG314530884 [2019-10-03 03:00:47,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f0580f9/bb8cec0c98c449e9842d4b54ad298beb [2019-10-03 03:00:47,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:00:47,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:00:47,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:00:47,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:00:47,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:00:47,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48490568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:47, skipping insertion in model container [2019-10-03 03:00:47,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:00:47" (1/1) ... [2019-10-03 03:00:47,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:00:47,461 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:00:48,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:00:48,624 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:00:49,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:00:49,099 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:00:49,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49 WrapperNode [2019-10-03 03:00:49,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:00:49,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:00:49,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:00:49,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:00:49,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... [2019-10-03 03:00:49,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... [2019-10-03 03:00:49,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... [2019-10-03 03:00:49,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... [2019-10-03 03:00:49,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... [2019-10-03 03:00:49,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... [2019-10-03 03:00:49,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... [2019-10-03 03:00:49,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:00:49,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:00:49,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:00:49,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:00:49,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:00:49,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:00:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:00:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:00:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:00:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:00:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:00:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:00:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:00:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:00:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:00:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:00:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:00:49,440 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:00:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:00:49,441 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:00:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:00:49,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:00:49,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:00:53,307 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:00:53,309 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:00:53,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:00:53 BoogieIcfgContainer [2019-10-03 03:00:53,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:00:53,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:00:53,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:00:53,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:00:53,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:00:47" (1/3) ... [2019-10-03 03:00:53,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ea4f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:00:53, skipping insertion in model container [2019-10-03 03:00:53,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:00:49" (2/3) ... [2019-10-03 03:00:53,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ea4f16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:00:53, skipping insertion in model container [2019-10-03 03:00:53,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:00:53" (3/3) ... [2019-10-03 03:00:53,324 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-03 03:00:53,335 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:00:53,345 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-03 03:00:53,365 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-03 03:00:53,398 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:00:53,398 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:00:53,399 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:00:53,399 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:00:53,400 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:00:53,400 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:00:53,400 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:00:53,400 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:00:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states. [2019-10-03 03:00:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:53,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:53,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:53,484 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1212138476, now seen corresponding path program 1 times [2019-10-03 03:00:53,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:53,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:53,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:53,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:53,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:54,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:54,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:00:54,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:54,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:54,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:54,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:00:54,196 INFO L87 Difference]: Start difference. First operand 1195 states. Second operand 6 states. [2019-10-03 03:00:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:56,185 INFO L93 Difference]: Finished difference Result 1629 states and 2742 transitions. [2019-10-03 03:00:56,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:56,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-03 03:00:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:56,215 INFO L225 Difference]: With dead ends: 1629 [2019-10-03 03:00:56,215 INFO L226 Difference]: Without dead ends: 1617 [2019-10-03 03:00:56,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:00:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-10-03 03:00:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1594. [2019-10-03 03:00:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-10-03 03:00:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2070 transitions. [2019-10-03 03:00:56,345 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2070 transitions. Word has length 56 [2019-10-03 03:00:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:56,346 INFO L475 AbstractCegarLoop]: Abstraction has 1594 states and 2070 transitions. [2019-10-03 03:00:56,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2070 transitions. [2019-10-03 03:00:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:56,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:56,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:56,355 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:56,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1633149148, now seen corresponding path program 1 times [2019-10-03 03:00:56,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:56,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:56,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:56,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:56,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:00:56,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:56,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:00:56,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:00:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:00:56,629 INFO L87 Difference]: Start difference. First operand 1594 states and 2070 transitions. Second operand 6 states. [2019-10-03 03:00:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:58,070 INFO L93 Difference]: Finished difference Result 2530 states and 3365 transitions. [2019-10-03 03:00:58,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:58,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-03 03:00:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:58,083 INFO L225 Difference]: With dead ends: 2530 [2019-10-03 03:00:58,084 INFO L226 Difference]: Without dead ends: 2530 [2019-10-03 03:00:58,085 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:00:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-10-03 03:00:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2514. [2019-10-03 03:00:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-10-03 03:00:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3354 transitions. [2019-10-03 03:00:58,160 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3354 transitions. Word has length 56 [2019-10-03 03:00:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:58,160 INFO L475 AbstractCegarLoop]: Abstraction has 2514 states and 3354 transitions. [2019-10-03 03:00:58,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:00:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3354 transitions. [2019-10-03 03:00:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:58,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:58,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:58,167 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash -755922083, now seen corresponding path program 1 times [2019-10-03 03:00:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:58,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:58,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:58,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:00:58,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:58,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:00:58,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:00:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:00:58,319 INFO L87 Difference]: Start difference. First operand 2514 states and 3354 transitions. Second operand 5 states. [2019-10-03 03:00:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:59,730 INFO L93 Difference]: Finished difference Result 3904 states and 5178 transitions. [2019-10-03 03:00:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:00:59,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-03 03:00:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:59,751 INFO L225 Difference]: With dead ends: 3904 [2019-10-03 03:00:59,751 INFO L226 Difference]: Without dead ends: 3904 [2019-10-03 03:00:59,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:00:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-10-03 03:00:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3898. [2019-10-03 03:00:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-03 03:00:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5174 transitions. [2019-10-03 03:00:59,860 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5174 transitions. Word has length 56 [2019-10-03 03:00:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:59,861 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5174 transitions. [2019-10-03 03:00:59,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:00:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5174 transitions. [2019-10-03 03:00:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:00:59,866 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:59,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:59,867 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash -418972447, now seen corresponding path program 1 times [2019-10-03 03:00:59,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:59,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:59,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:00,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:00,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:01:00,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:00,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:01:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:01:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:01:00,155 INFO L87 Difference]: Start difference. First operand 3898 states and 5174 transitions. Second operand 8 states. [2019-10-03 03:01:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:02,690 INFO L93 Difference]: Finished difference Result 7575 states and 10755 transitions. [2019-10-03 03:01:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:01:02,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-03 03:01:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:02,725 INFO L225 Difference]: With dead ends: 7575 [2019-10-03 03:01:02,725 INFO L226 Difference]: Without dead ends: 7575 [2019-10-03 03:01:02,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:01:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7575 states. [2019-10-03 03:01:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7575 to 3898. [2019-10-03 03:01:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-03 03:01:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5173 transitions. [2019-10-03 03:01:02,850 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5173 transitions. Word has length 58 [2019-10-03 03:01:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:02,850 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5173 transitions. [2019-10-03 03:01:02,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:01:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5173 transitions. [2019-10-03 03:01:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:01:02,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:02,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:02,855 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1952539007, now seen corresponding path program 1 times [2019-10-03 03:01:02,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:02,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:02,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:03,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:03,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:03,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:03,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:03,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:03,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:03,090 INFO L87 Difference]: Start difference. First operand 3898 states and 5173 transitions. Second operand 9 states. [2019-10-03 03:01:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:06,863 INFO L93 Difference]: Finished difference Result 8302 states and 11713 transitions. [2019-10-03 03:01:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:01:06,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-03 03:01:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:06,906 INFO L225 Difference]: With dead ends: 8302 [2019-10-03 03:01:06,907 INFO L226 Difference]: Without dead ends: 8302 [2019-10-03 03:01:06,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:01:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-10-03 03:01:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 3898. [2019-10-03 03:01:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-03 03:01:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5172 transitions. [2019-10-03 03:01:07,027 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5172 transitions. Word has length 58 [2019-10-03 03:01:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:07,028 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5172 transitions. [2019-10-03 03:01:07,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5172 transitions. [2019-10-03 03:01:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:01:07,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:07,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:07,034 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash -215970595, now seen corresponding path program 1 times [2019-10-03 03:01:07,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:07,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:07,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:07,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:07,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:07,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:01:07,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:07,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:01:07,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:01:07,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:07,221 INFO L87 Difference]: Start difference. First operand 3898 states and 5172 transitions. Second operand 9 states. [2019-10-03 03:01:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:10,550 INFO L93 Difference]: Finished difference Result 9285 states and 12952 transitions. [2019-10-03 03:01:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:01:10,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-03 03:01:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:10,587 INFO L225 Difference]: With dead ends: 9285 [2019-10-03 03:01:10,587 INFO L226 Difference]: Without dead ends: 9285 [2019-10-03 03:01:10,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:01:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2019-10-03 03:01:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 3898. [2019-10-03 03:01:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-10-03 03:01:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5171 transitions. [2019-10-03 03:01:10,711 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5171 transitions. Word has length 58 [2019-10-03 03:01:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:10,711 INFO L475 AbstractCegarLoop]: Abstraction has 3898 states and 5171 transitions. [2019-10-03 03:01:10,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:01:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5171 transitions. [2019-10-03 03:01:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:01:10,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:10,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:10,717 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash 834918715, now seen corresponding path program 1 times [2019-10-03 03:01:10,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:10,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:10,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:10,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:10,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:10,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:10,813 INFO L87 Difference]: Start difference. First operand 3898 states and 5171 transitions. Second operand 3 states. [2019-10-03 03:01:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:10,891 INFO L93 Difference]: Finished difference Result 4287 states and 5786 transitions. [2019-10-03 03:01:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:10,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:01:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:10,909 INFO L225 Difference]: With dead ends: 4287 [2019-10-03 03:01:10,910 INFO L226 Difference]: Without dead ends: 4287 [2019-10-03 03:01:10,910 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-10-03 03:01:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3971. [2019-10-03 03:01:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-10-03 03:01:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5314 transitions. [2019-10-03 03:01:10,973 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5314 transitions. Word has length 59 [2019-10-03 03:01:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:10,975 INFO L475 AbstractCegarLoop]: Abstraction has 3971 states and 5314 transitions. [2019-10-03 03:01:10,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5314 transitions. [2019-10-03 03:01:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:01:10,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:10,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:10,979 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:10,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:10,980 INFO L82 PathProgramCache]: Analyzing trace with hash 132280932, now seen corresponding path program 1 times [2019-10-03 03:01:10,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:10,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:10,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:10,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:11,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:11,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:11,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:11,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,101 INFO L87 Difference]: Start difference. First operand 3971 states and 5314 transitions. Second operand 3 states. [2019-10-03 03:01:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:11,215 INFO L93 Difference]: Finished difference Result 4943 states and 6772 transitions. [2019-10-03 03:01:11,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:11,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:01:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:11,227 INFO L225 Difference]: With dead ends: 4943 [2019-10-03 03:01:11,227 INFO L226 Difference]: Without dead ends: 4943 [2019-10-03 03:01:11,228 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2019-10-03 03:01:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 4463. [2019-10-03 03:01:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4463 states. [2019-10-03 03:01:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 6066 transitions. [2019-10-03 03:01:11,308 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 6066 transitions. Word has length 59 [2019-10-03 03:01:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:11,308 INFO L475 AbstractCegarLoop]: Abstraction has 4463 states and 6066 transitions. [2019-10-03 03:01:11,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 6066 transitions. [2019-10-03 03:01:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:01:11,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:11,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:11,313 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1642469980, now seen corresponding path program 1 times [2019-10-03 03:01:11,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:11,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:11,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:11,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:11,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:11,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,442 INFO L87 Difference]: Start difference. First operand 4463 states and 6066 transitions. Second operand 3 states. [2019-10-03 03:01:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:11,561 INFO L93 Difference]: Finished difference Result 5699 states and 7849 transitions. [2019-10-03 03:01:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:11,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-03 03:01:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:11,573 INFO L225 Difference]: With dead ends: 5699 [2019-10-03 03:01:11,574 INFO L226 Difference]: Without dead ends: 5699 [2019-10-03 03:01:11,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-10-03 03:01:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 5697. [2019-10-03 03:01:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-10-03 03:01:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 7848 transitions. [2019-10-03 03:01:11,732 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 7848 transitions. Word has length 59 [2019-10-03 03:01:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:11,733 INFO L475 AbstractCegarLoop]: Abstraction has 5697 states and 7848 transitions. [2019-10-03 03:01:11,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 7848 transitions. [2019-10-03 03:01:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:01:11,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:11,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:11,737 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 11887072, now seen corresponding path program 1 times [2019-10-03 03:01:11,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:11,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:11,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:11,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:11,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:11,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,819 INFO L87 Difference]: Start difference. First operand 5697 states and 7848 transitions. Second operand 3 states. [2019-10-03 03:01:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:11,932 INFO L93 Difference]: Finished difference Result 8543 states and 12087 transitions. [2019-10-03 03:01:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:11,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 03:01:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:11,948 INFO L225 Difference]: With dead ends: 8543 [2019-10-03 03:01:11,949 INFO L226 Difference]: Without dead ends: 8543 [2019-10-03 03:01:11,949 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2019-10-03 03:01:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 6757. [2019-10-03 03:01:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6757 states. [2019-10-03 03:01:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 9505 transitions. [2019-10-03 03:01:12,062 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 9505 transitions. Word has length 60 [2019-10-03 03:01:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:12,063 INFO L475 AbstractCegarLoop]: Abstraction has 6757 states and 9505 transitions. [2019-10-03 03:01:12,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 9505 transitions. [2019-10-03 03:01:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:01:12,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:12,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:12,067 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2065078364, now seen corresponding path program 1 times [2019-10-03 03:01:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:12,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:12,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:12,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:12,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:12,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:12,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:12,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:12,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:12,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:12,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:12,194 INFO L87 Difference]: Start difference. First operand 6757 states and 9505 transitions. Second operand 3 states. [2019-10-03 03:01:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:12,397 INFO L93 Difference]: Finished difference Result 10944 states and 15634 transitions. [2019-10-03 03:01:12,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:12,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 03:01:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:12,428 INFO L225 Difference]: With dead ends: 10944 [2019-10-03 03:01:12,428 INFO L226 Difference]: Without dead ends: 10944 [2019-10-03 03:01:12,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10944 states. [2019-10-03 03:01:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10944 to 8515. [2019-10-03 03:01:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-10-03 03:01:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 12125 transitions. [2019-10-03 03:01:12,620 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 12125 transitions. Word has length 60 [2019-10-03 03:01:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:12,620 INFO L475 AbstractCegarLoop]: Abstraction has 8515 states and 12125 transitions. [2019-10-03 03:01:12,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 12125 transitions. [2019-10-03 03:01:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:01:12,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:12,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:12,623 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1780702045, now seen corresponding path program 1 times [2019-10-03 03:01:12,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:12,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:12,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:12,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:13,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:13,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:01:13,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:13,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:01:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:01:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:01:13,137 INFO L87 Difference]: Start difference. First operand 8515 states and 12125 transitions. Second operand 10 states. [2019-10-03 03:01:13,839 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-10-03 03:01:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:14,841 INFO L93 Difference]: Finished difference Result 26250 states and 37719 transitions. [2019-10-03 03:01:14,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:01:14,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-10-03 03:01:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:14,896 INFO L225 Difference]: With dead ends: 26250 [2019-10-03 03:01:14,896 INFO L226 Difference]: Without dead ends: 26250 [2019-10-03 03:01:14,901 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:01:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26250 states. [2019-10-03 03:01:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26250 to 8397. [2019-10-03 03:01:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8397 states. [2019-10-03 03:01:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8397 states to 8397 states and 11978 transitions. [2019-10-03 03:01:15,167 INFO L78 Accepts]: Start accepts. Automaton has 8397 states and 11978 transitions. Word has length 60 [2019-10-03 03:01:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:15,167 INFO L475 AbstractCegarLoop]: Abstraction has 8397 states and 11978 transitions. [2019-10-03 03:01:15,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:01:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 8397 states and 11978 transitions. [2019-10-03 03:01:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:01:15,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:15,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:15,170 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:15,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:15,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1604028375, now seen corresponding path program 1 times [2019-10-03 03:01:15,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:15,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:15,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:15,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:15,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:15,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:01:15,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:15,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:01:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:01:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:01:15,950 INFO L87 Difference]: Start difference. First operand 8397 states and 11978 transitions. Second operand 19 states. [2019-10-03 03:01:16,187 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-03 03:01:17,037 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-03 03:01:17,270 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-10-03 03:01:17,560 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:01:17,755 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:01:18,522 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-03 03:01:18,667 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-10-03 03:01:19,185 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-03 03:01:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:22,871 INFO L93 Difference]: Finished difference Result 26896 states and 38827 transitions. [2019-10-03 03:01:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:01:22,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2019-10-03 03:01:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:22,926 INFO L225 Difference]: With dead ends: 26896 [2019-10-03 03:01:22,926 INFO L226 Difference]: Without dead ends: 26896 [2019-10-03 03:01:22,927 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:01:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26896 states. [2019-10-03 03:01:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26896 to 8410. [2019-10-03 03:01:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8410 states. [2019-10-03 03:01:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8410 states to 8410 states and 11996 transitions. [2019-10-03 03:01:23,192 INFO L78 Accepts]: Start accepts. Automaton has 8410 states and 11996 transitions. Word has length 61 [2019-10-03 03:01:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:23,193 INFO L475 AbstractCegarLoop]: Abstraction has 8410 states and 11996 transitions. [2019-10-03 03:01:23,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:01:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 8410 states and 11996 transitions. [2019-10-03 03:01:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 03:01:23,196 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:23,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:23,196 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:23,197 INFO L82 PathProgramCache]: Analyzing trace with hash -212777880, now seen corresponding path program 1 times [2019-10-03 03:01:23,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:23,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:23,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:23,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:24,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:24,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 03:01:24,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:24,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:01:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:01:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:01:24,051 INFO L87 Difference]: Start difference. First operand 8410 states and 11996 transitions. Second operand 15 states. [2019-10-03 03:01:24,718 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-03 03:01:25,006 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:01:25,272 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:01:25,654 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-03 03:01:27,166 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-03 03:01:27,731 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-03 03:01:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:28,733 INFO L93 Difference]: Finished difference Result 17066 states and 24383 transitions. [2019-10-03 03:01:28,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:01:28,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-10-03 03:01:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:28,757 INFO L225 Difference]: With dead ends: 17066 [2019-10-03 03:01:28,758 INFO L226 Difference]: Without dead ends: 17066 [2019-10-03 03:01:28,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-10-03 03:01:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17066 states. [2019-10-03 03:01:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17066 to 8401. [2019-10-03 03:01:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8401 states. [2019-10-03 03:01:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8401 states to 8401 states and 11984 transitions. [2019-10-03 03:01:29,033 INFO L78 Accepts]: Start accepts. Automaton has 8401 states and 11984 transitions. Word has length 62 [2019-10-03 03:01:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:29,034 INFO L475 AbstractCegarLoop]: Abstraction has 8401 states and 11984 transitions. [2019-10-03 03:01:29,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:01:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8401 states and 11984 transitions. [2019-10-03 03:01:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 03:01:29,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:29,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:29,037 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:29,038 INFO L82 PathProgramCache]: Analyzing trace with hash -287029914, now seen corresponding path program 1 times [2019-10-03 03:01:29,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:29,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:29,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:29,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:29,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:29,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:29,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:29,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:29,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:29,156 INFO L87 Difference]: Start difference. First operand 8401 states and 11984 transitions. Second operand 6 states. [2019-10-03 03:01:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:29,405 INFO L93 Difference]: Finished difference Result 30047 states and 41990 transitions. [2019-10-03 03:01:29,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:01:29,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-03 03:01:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:29,439 INFO L225 Difference]: With dead ends: 30047 [2019-10-03 03:01:29,439 INFO L226 Difference]: Without dead ends: 30047 [2019-10-03 03:01:29,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:01:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30047 states. [2019-10-03 03:01:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30047 to 26291. [2019-10-03 03:01:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26291 states. [2019-10-03 03:01:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26291 states to 26291 states and 36779 transitions. [2019-10-03 03:01:29,767 INFO L78 Accepts]: Start accepts. Automaton has 26291 states and 36779 transitions. Word has length 65 [2019-10-03 03:01:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:29,768 INFO L475 AbstractCegarLoop]: Abstraction has 26291 states and 36779 transitions. [2019-10-03 03:01:29,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 26291 states and 36779 transitions. [2019-10-03 03:01:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:01:29,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:29,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:29,771 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:29,772 INFO L82 PathProgramCache]: Analyzing trace with hash -586005098, now seen corresponding path program 1 times [2019-10-03 03:01:29,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:29,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:29,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:29,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:29,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:29,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:29,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:29,893 INFO L87 Difference]: Start difference. First operand 26291 states and 36779 transitions. Second operand 5 states. [2019-10-03 03:01:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:30,107 INFO L93 Difference]: Finished difference Result 15688 states and 21437 transitions. [2019-10-03 03:01:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:30,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-03 03:01:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:30,121 INFO L225 Difference]: With dead ends: 15688 [2019-10-03 03:01:30,121 INFO L226 Difference]: Without dead ends: 15688 [2019-10-03 03:01:30,121 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15688 states. [2019-10-03 03:01:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15688 to 12519. [2019-10-03 03:01:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12519 states. [2019-10-03 03:01:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12519 states to 12519 states and 17153 transitions. [2019-10-03 03:01:30,257 INFO L78 Accepts]: Start accepts. Automaton has 12519 states and 17153 transitions. Word has length 66 [2019-10-03 03:01:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:30,257 INFO L475 AbstractCegarLoop]: Abstraction has 12519 states and 17153 transitions. [2019-10-03 03:01:30,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 12519 states and 17153 transitions. [2019-10-03 03:01:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 03:01:30,261 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:30,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:30,261 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash -584887692, now seen corresponding path program 1 times [2019-10-03 03:01:30,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:30,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:30,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:30,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:30,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:30,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:01:30,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:30,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:01:30,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:01:30,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:01:30,374 INFO L87 Difference]: Start difference. First operand 12519 states and 17153 transitions. Second operand 6 states. [2019-10-03 03:01:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:30,604 INFO L93 Difference]: Finished difference Result 22385 states and 30162 transitions. [2019-10-03 03:01:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:30,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-03 03:01:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:30,624 INFO L225 Difference]: With dead ends: 22385 [2019-10-03 03:01:30,625 INFO L226 Difference]: Without dead ends: 22385 [2019-10-03 03:01:30,625 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22385 states. [2019-10-03 03:01:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22385 to 12927. [2019-10-03 03:01:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12927 states. [2019-10-03 03:01:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12927 states to 12927 states and 17470 transitions. [2019-10-03 03:01:30,809 INFO L78 Accepts]: Start accepts. Automaton has 12927 states and 17470 transitions. Word has length 70 [2019-10-03 03:01:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:30,810 INFO L475 AbstractCegarLoop]: Abstraction has 12927 states and 17470 transitions. [2019-10-03 03:01:30,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:01:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12927 states and 17470 transitions. [2019-10-03 03:01:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-03 03:01:30,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:30,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:30,815 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash -793759712, now seen corresponding path program 1 times [2019-10-03 03:01:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:30,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:30,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:30,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:30,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:30,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:30,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:30,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:30,902 INFO L87 Difference]: Start difference. First operand 12927 states and 17470 transitions. Second operand 3 states. [2019-10-03 03:01:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:31,012 INFO L93 Difference]: Finished difference Result 22127 states and 29665 transitions. [2019-10-03 03:01:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:31,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-03 03:01:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:31,037 INFO L225 Difference]: With dead ends: 22127 [2019-10-03 03:01:31,037 INFO L226 Difference]: Without dead ends: 22127 [2019-10-03 03:01:31,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22127 states. [2019-10-03 03:01:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22127 to 22125. [2019-10-03 03:01:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22125 states. [2019-10-03 03:01:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22125 states to 22125 states and 29664 transitions. [2019-10-03 03:01:31,244 INFO L78 Accepts]: Start accepts. Automaton has 22125 states and 29664 transitions. Word has length 71 [2019-10-03 03:01:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:31,245 INFO L475 AbstractCegarLoop]: Abstraction has 22125 states and 29664 transitions. [2019-10-03 03:01:31,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 22125 states and 29664 transitions. [2019-10-03 03:01:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 03:01:31,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:31,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:31,251 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:31,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:31,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1879683765, now seen corresponding path program 1 times [2019-10-03 03:01:31,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:31,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:31,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:31,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:31,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:31,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:31,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:31,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:31,349 INFO L87 Difference]: Start difference. First operand 22125 states and 29664 transitions. Second operand 5 states. [2019-10-03 03:01:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:32,108 INFO L93 Difference]: Finished difference Result 48568 states and 63842 transitions. [2019-10-03 03:01:32,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:32,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-03 03:01:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:32,159 INFO L225 Difference]: With dead ends: 48568 [2019-10-03 03:01:32,159 INFO L226 Difference]: Without dead ends: 48568 [2019-10-03 03:01:32,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48568 states. [2019-10-03 03:01:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48568 to 29319. [2019-10-03 03:01:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29319 states. [2019-10-03 03:01:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29319 states to 29319 states and 38668 transitions. [2019-10-03 03:01:33,414 INFO L78 Accepts]: Start accepts. Automaton has 29319 states and 38668 transitions. Word has length 75 [2019-10-03 03:01:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:33,414 INFO L475 AbstractCegarLoop]: Abstraction has 29319 states and 38668 transitions. [2019-10-03 03:01:33,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29319 states and 38668 transitions. [2019-10-03 03:01:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 03:01:33,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:33,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:33,420 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 435599465, now seen corresponding path program 1 times [2019-10-03 03:01:33,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:33,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:33,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:33,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:33,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:33,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:33,525 INFO L87 Difference]: Start difference. First operand 29319 states and 38668 transitions. Second operand 5 states. [2019-10-03 03:01:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:34,251 INFO L93 Difference]: Finished difference Result 73342 states and 94566 transitions. [2019-10-03 03:01:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:34,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-03 03:01:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:34,322 INFO L225 Difference]: With dead ends: 73342 [2019-10-03 03:01:34,322 INFO L226 Difference]: Without dead ends: 73342 [2019-10-03 03:01:34,323 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73342 states. [2019-10-03 03:01:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73342 to 49878. [2019-10-03 03:01:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49878 states. [2019-10-03 03:01:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49878 states to 49878 states and 65222 transitions. [2019-10-03 03:01:35,914 INFO L78 Accepts]: Start accepts. Automaton has 49878 states and 65222 transitions. Word has length 81 [2019-10-03 03:01:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:35,914 INFO L475 AbstractCegarLoop]: Abstraction has 49878 states and 65222 transitions. [2019-10-03 03:01:35,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 49878 states and 65222 transitions. [2019-10-03 03:01:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 03:01:35,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:35,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:35,918 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1991987475, now seen corresponding path program 1 times [2019-10-03 03:01:35,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:35,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:36,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:36,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:36,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:36,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:36,010 INFO L87 Difference]: Start difference. First operand 49878 states and 65222 transitions. Second operand 3 states. [2019-10-03 03:01:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:36,337 INFO L93 Difference]: Finished difference Result 88949 states and 113880 transitions. [2019-10-03 03:01:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:36,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-03 03:01:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:36,460 INFO L225 Difference]: With dead ends: 88949 [2019-10-03 03:01:36,460 INFO L226 Difference]: Without dead ends: 88949 [2019-10-03 03:01:36,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88949 states. [2019-10-03 03:01:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88949 to 66953. [2019-10-03 03:01:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66953 states. [2019-10-03 03:01:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66953 states to 66953 states and 86015 transitions. [2019-10-03 03:01:39,124 INFO L78 Accepts]: Start accepts. Automaton has 66953 states and 86015 transitions. Word has length 83 [2019-10-03 03:01:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:39,124 INFO L475 AbstractCegarLoop]: Abstraction has 66953 states and 86015 transitions. [2019-10-03 03:01:39,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 66953 states and 86015 transitions. [2019-10-03 03:01:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-03 03:01:39,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:39,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:39,129 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -530585101, now seen corresponding path program 1 times [2019-10-03 03:01:39,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:39,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:39,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:39,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:39,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:39,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:39,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:39,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:39,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:39,217 INFO L87 Difference]: Start difference. First operand 66953 states and 86015 transitions. Second operand 3 states. [2019-10-03 03:01:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:39,531 INFO L93 Difference]: Finished difference Result 89433 states and 112065 transitions. [2019-10-03 03:01:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:39,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-03 03:01:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:39,674 INFO L225 Difference]: With dead ends: 89433 [2019-10-03 03:01:39,675 INFO L226 Difference]: Without dead ends: 89433 [2019-10-03 03:01:39,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89433 states. [2019-10-03 03:01:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89433 to 67520. [2019-10-03 03:01:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67520 states. [2019-10-03 03:01:40,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67520 states to 67520 states and 84969 transitions. [2019-10-03 03:01:40,597 INFO L78 Accepts]: Start accepts. Automaton has 67520 states and 84969 transitions. Word has length 86 [2019-10-03 03:01:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:40,598 INFO L475 AbstractCegarLoop]: Abstraction has 67520 states and 84969 transitions. [2019-10-03 03:01:40,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 67520 states and 84969 transitions. [2019-10-03 03:01:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 03:01:40,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:40,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:40,602 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2116981400, now seen corresponding path program 1 times [2019-10-03 03:01:40,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:40,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:40,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:40,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:40,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:40,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:40,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:40,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:40,686 INFO L87 Difference]: Start difference. First operand 67520 states and 84969 transitions. Second operand 3 states. [2019-10-03 03:01:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:41,170 INFO L93 Difference]: Finished difference Result 79098 states and 97268 transitions. [2019-10-03 03:01:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:41,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-03 03:01:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:41,245 INFO L225 Difference]: With dead ends: 79098 [2019-10-03 03:01:41,245 INFO L226 Difference]: Without dead ends: 79098 [2019-10-03 03:01:41,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79098 states. [2019-10-03 03:01:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79098 to 75549. [2019-10-03 03:01:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75549 states. [2019-10-03 03:01:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75549 states to 75549 states and 93720 transitions. [2019-10-03 03:01:42,021 INFO L78 Accepts]: Start accepts. Automaton has 75549 states and 93720 transitions. Word has length 89 [2019-10-03 03:01:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:42,021 INFO L475 AbstractCegarLoop]: Abstraction has 75549 states and 93720 transitions. [2019-10-03 03:01:42,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 75549 states and 93720 transitions. [2019-10-03 03:01:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:01:42,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:42,029 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:42,029 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1675942405, now seen corresponding path program 1 times [2019-10-03 03:01:42,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:42,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:42,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:42,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:42,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:42,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:01:42,176 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2019-10-03 03:01:42,178 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [166], [169], [170], [172], [175], [178], [199], [201], [203], [3199], [3203], [3206], [3209], [3212], [3216], [3328], [3331], [3352], [3354], [3356], [3419], [3466], [3469], [3472], [3476], [3479], [3482], [3486], [3488], [3491], [3495], [3498], [3507], [3509], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3689], [3694], [3699], [3701], [3720], [3722], [3741], [3858], [3861], [3864], [3868], [3871], [3875], [3879], [3881], [3885], [3888], [3891], [3894], [3899], [3901], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:01:42,226 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:01:42,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:01:42,459 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:01:43,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:01:43,007 INFO L272 AbstractInterpreter]: Visited 89 different actions 333 times. Merged at 29 different actions 222 times. Widened at 12 different actions 40 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 19 fixpoints after 6 different actions. Largest state had 390 variables. [2019-10-03 03:01:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:43,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:01:43,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:01:43,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:01:43,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:43,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:01:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:43,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-03 03:01:43,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:01:44,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:44,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:01:44,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:01:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:44,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:01:44,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2019-10-03 03:01:44,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:01:44,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:01:44,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:01:44,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:01:44,593 INFO L87 Difference]: Start difference. First operand 75549 states and 93720 transitions. Second operand 12 states. [2019-10-03 03:01:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:48,152 INFO L93 Difference]: Finished difference Result 133515 states and 165580 transitions. [2019-10-03 03:01:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:01:48,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-10-03 03:01:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:48,496 INFO L225 Difference]: With dead ends: 133515 [2019-10-03 03:01:48,496 INFO L226 Difference]: Without dead ends: 133515 [2019-10-03 03:01:48,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=364, Invalid=968, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 03:01:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133515 states. [2019-10-03 03:01:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133515 to 86250. [2019-10-03 03:01:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86250 states. [2019-10-03 03:01:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86250 states to 86250 states and 107383 transitions. [2019-10-03 03:01:51,294 INFO L78 Accepts]: Start accepts. Automaton has 86250 states and 107383 transitions. Word has length 95 [2019-10-03 03:01:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:51,295 INFO L475 AbstractCegarLoop]: Abstraction has 86250 states and 107383 transitions. [2019-10-03 03:01:51,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:01:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 86250 states and 107383 transitions. [2019-10-03 03:01:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 03:01:51,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:51,316 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:51,317 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:51,317 INFO L82 PathProgramCache]: Analyzing trace with hash 106004821, now seen corresponding path program 1 times [2019-10-03 03:01:51,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:51,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:51,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:51,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:51,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:51,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:51,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:51,422 INFO L87 Difference]: Start difference. First operand 86250 states and 107383 transitions. Second operand 5 states. [2019-10-03 03:01:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:52,126 INFO L93 Difference]: Finished difference Result 105276 states and 129011 transitions. [2019-10-03 03:01:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:01:52,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-03 03:01:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:52,265 INFO L225 Difference]: With dead ends: 105276 [2019-10-03 03:01:52,265 INFO L226 Difference]: Without dead ends: 105276 [2019-10-03 03:01:52,266 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:01:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105276 states. [2019-10-03 03:01:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105276 to 83187. [2019-10-03 03:01:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83187 states. [2019-10-03 03:01:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83187 states to 83187 states and 101878 transitions. [2019-10-03 03:01:53,638 INFO L78 Accepts]: Start accepts. Automaton has 83187 states and 101878 transitions. Word has length 99 [2019-10-03 03:01:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:53,638 INFO L475 AbstractCegarLoop]: Abstraction has 83187 states and 101878 transitions. [2019-10-03 03:01:53,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 83187 states and 101878 transitions. [2019-10-03 03:01:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 03:01:53,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:53,645 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:53,645 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash -291839216, now seen corresponding path program 1 times [2019-10-03 03:01:53,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:53,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:53,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 03:01:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:53,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:53,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:53,746 INFO L87 Difference]: Start difference. First operand 83187 states and 101878 transitions. Second operand 3 states. [2019-10-03 03:01:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:54,021 INFO L93 Difference]: Finished difference Result 81911 states and 98757 transitions. [2019-10-03 03:01:54,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:54,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-03 03:01:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:54,137 INFO L225 Difference]: With dead ends: 81911 [2019-10-03 03:01:54,137 INFO L226 Difference]: Without dead ends: 81911 [2019-10-03 03:01:54,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81911 states. [2019-10-03 03:01:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81911 to 81689. [2019-10-03 03:01:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81689 states. [2019-10-03 03:01:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81689 states to 81689 states and 98536 transitions. [2019-10-03 03:01:55,742 INFO L78 Accepts]: Start accepts. Automaton has 81689 states and 98536 transitions. Word has length 99 [2019-10-03 03:01:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:55,743 INFO L475 AbstractCegarLoop]: Abstraction has 81689 states and 98536 transitions. [2019-10-03 03:01:55,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 81689 states and 98536 transitions. [2019-10-03 03:01:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:01:55,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:55,753 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:55,753 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:55,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:55,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1348348173, now seen corresponding path program 1 times [2019-10-03 03:01:55,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:55,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:01:55,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:55,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:55,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:55,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:55,849 INFO L87 Difference]: Start difference. First operand 81689 states and 98536 transitions. Second operand 3 states. [2019-10-03 03:01:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:56,106 INFO L93 Difference]: Finished difference Result 81583 states and 97254 transitions. [2019-10-03 03:01:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:56,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-03 03:01:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:56,224 INFO L225 Difference]: With dead ends: 81583 [2019-10-03 03:01:56,224 INFO L226 Difference]: Without dead ends: 81583 [2019-10-03 03:01:56,225 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81583 states. [2019-10-03 03:01:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81583 to 60348. [2019-10-03 03:01:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60348 states. [2019-10-03 03:01:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60348 states to 60348 states and 72317 transitions. [2019-10-03 03:01:57,269 INFO L78 Accepts]: Start accepts. Automaton has 60348 states and 72317 transitions. Word has length 101 [2019-10-03 03:01:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:57,269 INFO L475 AbstractCegarLoop]: Abstraction has 60348 states and 72317 transitions. [2019-10-03 03:01:57,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 60348 states and 72317 transitions. [2019-10-03 03:01:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 03:01:57,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:57,276 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:57,276 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:57,277 INFO L82 PathProgramCache]: Analyzing trace with hash 170954536, now seen corresponding path program 1 times [2019-10-03 03:01:57,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:57,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:57,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:57,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:57,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:57,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:57,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:57,401 INFO L87 Difference]: Start difference. First operand 60348 states and 72317 transitions. Second operand 5 states. [2019-10-03 03:01:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:57,715 INFO L93 Difference]: Finished difference Result 91174 states and 109152 transitions. [2019-10-03 03:01:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:57,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 03:01:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:57,804 INFO L225 Difference]: With dead ends: 91174 [2019-10-03 03:01:57,804 INFO L226 Difference]: Without dead ends: 91174 [2019-10-03 03:01:57,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91174 states. [2019-10-03 03:01:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91174 to 76949. [2019-10-03 03:01:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76949 states. [2019-10-03 03:01:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76949 states to 76949 states and 92073 transitions. [2019-10-03 03:01:58,880 INFO L78 Accepts]: Start accepts. Automaton has 76949 states and 92073 transitions. Word has length 104 [2019-10-03 03:01:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:58,880 INFO L475 AbstractCegarLoop]: Abstraction has 76949 states and 92073 transitions. [2019-10-03 03:01:58,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:01:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 76949 states and 92073 transitions. [2019-10-03 03:01:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-03 03:01:58,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:58,888 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:58,888 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash -240157060, now seen corresponding path program 1 times [2019-10-03 03:01:58,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:58,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:58,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:58,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 03:01:59,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:59,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:01:59,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:59,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:01:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:01:59,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:01:59,019 INFO L87 Difference]: Start difference. First operand 76949 states and 92073 transitions. Second operand 5 states. [2019-10-03 03:01:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:59,483 INFO L93 Difference]: Finished difference Result 99221 states and 118697 transitions. [2019-10-03 03:01:59,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:01:59,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-03 03:01:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:59,623 INFO L225 Difference]: With dead ends: 99221 [2019-10-03 03:01:59,623 INFO L226 Difference]: Without dead ends: 99221 [2019-10-03 03:01:59,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:01:59,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99221 states. [2019-10-03 03:02:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99221 to 88101. [2019-10-03 03:02:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88101 states. [2019-10-03 03:02:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88101 states to 88101 states and 105376 transitions. [2019-10-03 03:02:01,103 INFO L78 Accepts]: Start accepts. Automaton has 88101 states and 105376 transitions. Word has length 104 [2019-10-03 03:02:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:01,104 INFO L475 AbstractCegarLoop]: Abstraction has 88101 states and 105376 transitions. [2019-10-03 03:02:01,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 88101 states and 105376 transitions. [2019-10-03 03:02:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 03:02:01,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:01,111 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:01,111 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1523617051, now seen corresponding path program 1 times [2019-10-03 03:02:01,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:01,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:01,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:01,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:01,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:02:01,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:01,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:02:01,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:01,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:02:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:02:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:02:01,198 INFO L87 Difference]: Start difference. First operand 88101 states and 105376 transitions. Second operand 4 states. [2019-10-03 03:02:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:01,949 INFO L93 Difference]: Finished difference Result 121545 states and 145044 transitions. [2019-10-03 03:02:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:01,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-03 03:02:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:02,096 INFO L225 Difference]: With dead ends: 121545 [2019-10-03 03:02:02,096 INFO L226 Difference]: Without dead ends: 121545 [2019-10-03 03:02:02,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121545 states. [2019-10-03 03:02:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121545 to 88101. [2019-10-03 03:02:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88101 states. [2019-10-03 03:02:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88101 states to 88101 states and 105376 transitions. [2019-10-03 03:02:02,988 INFO L78 Accepts]: Start accepts. Automaton has 88101 states and 105376 transitions. Word has length 110 [2019-10-03 03:02:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:02,988 INFO L475 AbstractCegarLoop]: Abstraction has 88101 states and 105376 transitions. [2019-10-03 03:02:02,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:02:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 88101 states and 105376 transitions. [2019-10-03 03:02:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 03:02:02,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:02,998 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:02,999 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:03,000 INFO L82 PathProgramCache]: Analyzing trace with hash -374913254, now seen corresponding path program 1 times [2019-10-03 03:02:03,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:03,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:03,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:03,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:03,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:03,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:03,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:03,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-10-03 03:02:03,278 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [199], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1278], [1281], [1284], [1287], [1291], [1295], [2773], [2776], [2780], [2782], [2785], [2788], [2792], [2795], [2799], [2802], [2805], [2808], [2816], [2820], [3328], [3331], [3352], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:02:03,282 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:03,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:03,391 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:04,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:04,527 INFO L272 AbstractInterpreter]: Visited 103 different actions 437 times. Merged at 40 different actions 305 times. Widened at 16 different actions 58 times. Performed 1956 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 10 different actions. Largest state had 392 variables. [2019-10-03 03:02:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:04,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:04,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:04,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:04,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:04,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:05,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-03 03:02:05,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:05,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:05,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:06,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:06,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:06,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:06,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:06,696 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:02:06,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [10] total 31 [2019-10-03 03:02:06,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:06,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 03:02:06,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 03:02:06,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:02:06,698 INFO L87 Difference]: Start difference. First operand 88101 states and 105376 transitions. Second operand 13 states. [2019-10-03 03:02:06,846 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-10-03 03:02:11,065 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-03 03:02:11,395 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-03 03:02:11,680 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-03 03:02:12,159 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-03 03:02:13,614 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-03 03:02:13,795 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:02:13,953 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-03 03:02:14,498 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-03 03:02:14,790 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:02:15,034 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:02:15,234 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-03 03:02:15,895 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:02:16,318 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:02:17,010 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-03 03:02:17,168 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-10-03 03:02:17,519 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-03 03:02:18,048 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-10-03 03:02:19,332 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-03 03:02:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:19,724 INFO L93 Difference]: Finished difference Result 241826 states and 287495 transitions. [2019-10-03 03:02:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-03 03:02:19,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-10-03 03:02:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,993 INFO L225 Difference]: With dead ends: 241826 [2019-10-03 03:02:19,993 INFO L226 Difference]: Without dead ends: 241826 [2019-10-03 03:02:19,995 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 190 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1108, Invalid=4442, Unknown=0, NotChecked=0, Total=5550 [2019-10-03 03:02:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241826 states. [2019-10-03 03:02:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241826 to 101700. [2019-10-03 03:02:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101700 states. [2019-10-03 03:02:21,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101700 states to 101700 states and 121500 transitions. [2019-10-03 03:02:21,457 INFO L78 Accepts]: Start accepts. Automaton has 101700 states and 121500 transitions. Word has length 110 [2019-10-03 03:02:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:21,457 INFO L475 AbstractCegarLoop]: Abstraction has 101700 states and 121500 transitions. [2019-10-03 03:02:21,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 03:02:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 101700 states and 121500 transitions. [2019-10-03 03:02:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 03:02:21,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:21,465 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:02:21,465 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:21,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:21,466 INFO L82 PathProgramCache]: Analyzing trace with hash 812250873, now seen corresponding path program 1 times [2019-10-03 03:02:21,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:21,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:21,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:22,168 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 18 [2019-10-03 03:02:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:22,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:22,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:02:22,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-10-03 03:02:22,257 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [498], [501], [504], [507], [511], [515], [929], [932], [935], [939], [942], [946], [949], [952], [955], [963], [967], [3328], [3331], [3352], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:02:22,269 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:02:22,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:02:22,382 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:02:22,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:02:22,754 INFO L272 AbstractInterpreter]: Visited 103 different actions 342 times. Merged at 40 different actions 218 times. Widened at 11 different actions 26 times. Performed 1737 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1737 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 11 different actions. Largest state had 392 variables. [2019-10-03 03:02:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:22,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:02:22,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:02:22,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:02:22,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:22,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:02:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:23,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 2076 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:02:23,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:02:23,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:24,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:02:24,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:24,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:24,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:24,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:02:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:24,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:02:24,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2019-10-03 03:02:24,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:02:24,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:02:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:02:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:02:24,446 INFO L87 Difference]: Start difference. First operand 101700 states and 121500 transitions. Second operand 18 states. [2019-10-03 03:02:24,650 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-10-03 03:02:24,860 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:02:25,002 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-03 03:02:25,165 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:02:32,516 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-10-03 03:02:33,415 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-03 03:02:34,981 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-03 03:02:35,586 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-03 03:02:35,997 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-03 03:02:36,962 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-10-03 03:02:37,480 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:02:37,967 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-03 03:02:38,377 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-03 03:02:39,223 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-10-03 03:02:40,280 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-03 03:02:41,088 WARN L191 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:02:41,704 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-03 03:02:42,239 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-10-03 03:02:42,864 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-03 03:02:43,686 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-03 03:02:44,450 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-03 03:02:44,793 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:02:45,549 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-03 03:02:45,891 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-03 03:02:47,716 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-10-03 03:02:48,527 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-03 03:02:48,844 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-10-03 03:02:49,097 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-03 03:02:49,385 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-03 03:02:49,801 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:02:50,361 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:02:51,201 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-10-03 03:02:51,768 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-03 03:02:52,234 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-03 03:02:52,707 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:02:53,448 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:02:54,459 WARN L191 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-10-03 03:02:55,080 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-03 03:02:55,483 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-03 03:02:55,772 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-03 03:02:56,235 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-03 03:02:56,468 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-03 03:02:56,979 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-03 03:02:57,721 WARN L191 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-10-03 03:02:58,590 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:02:58,880 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-10-03 03:02:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:59,457 INFO L93 Difference]: Finished difference Result 318340 states and 377892 transitions. [2019-10-03 03:02:59,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-03 03:02:59,457 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2019-10-03 03:02:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:59,880 INFO L225 Difference]: With dead ends: 318340 [2019-10-03 03:02:59,880 INFO L226 Difference]: Without dead ends: 318340 [2019-10-03 03:02:59,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 192 SyntacticMatches, 13 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3635 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=1983, Invalid=10007, Unknown=0, NotChecked=0, Total=11990 [2019-10-03 03:03:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318340 states. [2019-10-03 03:03:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318340 to 109401. [2019-10-03 03:03:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109401 states. [2019-10-03 03:03:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109401 states to 109401 states and 130571 transitions. [2019-10-03 03:03:02,761 INFO L78 Accepts]: Start accepts. Automaton has 109401 states and 130571 transitions. Word has length 110 [2019-10-03 03:03:02,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:02,762 INFO L475 AbstractCegarLoop]: Abstraction has 109401 states and 130571 transitions. [2019-10-03 03:03:02,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:03:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 109401 states and 130571 transitions. [2019-10-03 03:03:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 03:03:02,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:02,771 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:02,771 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -500839479, now seen corresponding path program 1 times [2019-10-03 03:03:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:02,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:02,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:02,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:02,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 03:03:02,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:02,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:03:02,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:02,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:03:02,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:03:02,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:02,944 INFO L87 Difference]: Start difference. First operand 109401 states and 130571 transitions. Second operand 9 states. [2019-10-03 03:03:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:05,734 INFO L93 Difference]: Finished difference Result 208834 states and 249395 transitions. [2019-10-03 03:03:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:03:05,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-10-03 03:03:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:05,996 INFO L225 Difference]: With dead ends: 208834 [2019-10-03 03:03:05,996 INFO L226 Difference]: Without dead ends: 208834 [2019-10-03 03:03:05,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:03:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208834 states. [2019-10-03 03:03:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208834 to 109401. [2019-10-03 03:03:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109401 states. [2019-10-03 03:03:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109401 states to 109401 states and 130570 transitions. [2019-10-03 03:03:07,461 INFO L78 Accepts]: Start accepts. Automaton has 109401 states and 130570 transitions. Word has length 111 [2019-10-03 03:03:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:07,461 INFO L475 AbstractCegarLoop]: Abstraction has 109401 states and 130570 transitions. [2019-10-03 03:03:07,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:03:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 109401 states and 130570 transitions. [2019-10-03 03:03:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:03:07,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:07,472 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:07,473 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 651814601, now seen corresponding path program 1 times [2019-10-03 03:03:07,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:07,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:07,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:07,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:07,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-10-03 03:03:07,846 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [187], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1278], [1281], [1284], [1287], [1291], [1295], [2773], [2776], [2780], [2782], [2785], [2788], [2792], [2795], [2799], [2802], [2805], [2808], [2816], [2820], [3328], [3331], [3352], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:03:07,852 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:07,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:07,962 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:08,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:08,542 INFO L272 AbstractInterpreter]: Visited 105 different actions 458 times. Merged at 42 different actions 324 times. Widened at 16 different actions 59 times. Performed 2021 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2021 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 10 different actions. Largest state had 392 variables. [2019-10-03 03:03:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:08,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:08,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:08,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:08,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:08,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:09,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 2077 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-03 03:03:09,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:09,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:09,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:09,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:10,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [12] total 27 [2019-10-03 03:03:10,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:10,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2019-10-03 03:03:10,383 INFO L87 Difference]: Start difference. First operand 109401 states and 130570 transitions. Second operand 10 states. [2019-10-03 03:03:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:12,299 INFO L93 Difference]: Finished difference Result 140399 states and 166750 transitions. [2019-10-03 03:03:12,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:03:12,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2019-10-03 03:03:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:12,477 INFO L225 Difference]: With dead ends: 140399 [2019-10-03 03:03:12,477 INFO L226 Difference]: Without dead ends: 140399 [2019-10-03 03:03:12,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 03:03:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140399 states. [2019-10-03 03:03:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140399 to 121393. [2019-10-03 03:03:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121393 states. [2019-10-03 03:03:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121393 states to 121393 states and 144707 transitions. [2019-10-03 03:03:13,559 INFO L78 Accepts]: Start accepts. Automaton has 121393 states and 144707 transitions. Word has length 112 [2019-10-03 03:03:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:13,560 INFO L475 AbstractCegarLoop]: Abstraction has 121393 states and 144707 transitions. [2019-10-03 03:03:13,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 121393 states and 144707 transitions. [2019-10-03 03:03:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:03:13,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:13,572 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:13,572 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash 34603032, now seen corresponding path program 1 times [2019-10-03 03:03:13,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:13,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:13,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:13,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:03:13,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:13,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:03:13,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:13,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:03:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:03:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:03:13,660 INFO L87 Difference]: Start difference. First operand 121393 states and 144707 transitions. Second operand 4 states. [2019-10-03 03:03:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:14,659 INFO L93 Difference]: Finished difference Result 203754 states and 241757 transitions. [2019-10-03 03:03:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:14,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-03 03:03:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:14,914 INFO L225 Difference]: With dead ends: 203754 [2019-10-03 03:03:14,914 INFO L226 Difference]: Without dead ends: 203754 [2019-10-03 03:03:14,914 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203754 states. [2019-10-03 03:03:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203754 to 121313. [2019-10-03 03:03:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121313 states. [2019-10-03 03:03:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121313 states to 121313 states and 144613 transitions. [2019-10-03 03:03:17,083 INFO L78 Accepts]: Start accepts. Automaton has 121313 states and 144613 transitions. Word has length 112 [2019-10-03 03:03:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:17,083 INFO L475 AbstractCegarLoop]: Abstraction has 121313 states and 144613 transitions. [2019-10-03 03:03:17,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:03:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 121313 states and 144613 transitions. [2019-10-03 03:03:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 03:03:17,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:17,092 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:17,093 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1928045207, now seen corresponding path program 1 times [2019-10-03 03:03:17,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:17,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:17,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:17,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:17,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 03:03:17,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:17,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:03:17,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:17,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:03:17,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:03:17,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:03:17,270 INFO L87 Difference]: Start difference. First operand 121313 states and 144613 transitions. Second operand 8 states. [2019-10-03 03:03:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:18,704 INFO L93 Difference]: Finished difference Result 152723 states and 181664 transitions. [2019-10-03 03:03:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:03:18,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-10-03 03:03:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:18,880 INFO L225 Difference]: With dead ends: 152723 [2019-10-03 03:03:18,880 INFO L226 Difference]: Without dead ends: 152723 [2019-10-03 03:03:18,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:03:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152723 states. [2019-10-03 03:03:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152723 to 121187. [2019-10-03 03:03:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121187 states. [2019-10-03 03:03:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121187 states to 121187 states and 144470 transitions. [2019-10-03 03:03:20,732 INFO L78 Accepts]: Start accepts. Automaton has 121187 states and 144470 transitions. Word has length 112 [2019-10-03 03:03:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:20,733 INFO L475 AbstractCegarLoop]: Abstraction has 121187 states and 144470 transitions. [2019-10-03 03:03:20,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:03:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 121187 states and 144470 transitions. [2019-10-03 03:03:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:03:20,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:20,741 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:20,741 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:20,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1637379935, now seen corresponding path program 1 times [2019-10-03 03:03:20,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:20,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:20,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:20,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:20,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:20,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:20,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:20,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-10-03 03:03:20,994 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1278], [1281], [1284], [1287], [1291], [1295], [2773], [2776], [2780], [2782], [2785], [2788], [2792], [2795], [2799], [2802], [2805], [2808], [2816], [2820], [3328], [3331], [3352], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:03:20,997 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:20,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:21,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:21,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:21,745 INFO L272 AbstractInterpreter]: Visited 106 different actions 500 times. Merged at 43 different actions 362 times. Widened at 15 different actions 70 times. Performed 2109 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2109 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 11 different actions. Largest state had 392 variables. [2019-10-03 03:03:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:21,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:21,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:21,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:21,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:21,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:22,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:03:22,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:22,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:22,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:23,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:23,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:03:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2019-10-03 03:03:23,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:23,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:03:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:03:23,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-10-03 03:03:23,581 INFO L87 Difference]: Start difference. First operand 121187 states and 144470 transitions. Second operand 19 states. [2019-10-03 03:03:24,181 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-03 03:03:26,598 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-10-03 03:03:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:30,438 INFO L93 Difference]: Finished difference Result 299865 states and 356379 transitions. [2019-10-03 03:03:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:03:30,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 113 [2019-10-03 03:03:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:30,785 INFO L225 Difference]: With dead ends: 299865 [2019-10-03 03:03:30,786 INFO L226 Difference]: Without dead ends: 299865 [2019-10-03 03:03:30,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 194 SyntacticMatches, 20 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 03:03:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299865 states. [2019-10-03 03:03:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299865 to 121241. [2019-10-03 03:03:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121241 states. [2019-10-03 03:03:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121241 states to 121241 states and 144530 transitions. [2019-10-03 03:03:33,516 INFO L78 Accepts]: Start accepts. Automaton has 121241 states and 144530 transitions. Word has length 113 [2019-10-03 03:03:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:33,517 INFO L475 AbstractCegarLoop]: Abstraction has 121241 states and 144530 transitions. [2019-10-03 03:03:33,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:03:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 121241 states and 144530 transitions. [2019-10-03 03:03:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:03:33,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:33,527 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:33,527 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:33,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1997250102, now seen corresponding path program 1 times [2019-10-03 03:03:33,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:33,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:33,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:33,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:33,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:33,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:33,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:33,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:33,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:33,611 INFO L87 Difference]: Start difference. First operand 121241 states and 144530 transitions. Second operand 3 states. [2019-10-03 03:03:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:33,936 INFO L93 Difference]: Finished difference Result 139627 states and 165969 transitions. [2019-10-03 03:03:33,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:33,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-03 03:03:33,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:34,078 INFO L225 Difference]: With dead ends: 139627 [2019-10-03 03:03:34,078 INFO L226 Difference]: Without dead ends: 139627 [2019-10-03 03:03:34,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139627 states. [2019-10-03 03:03:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139627 to 126868. [2019-10-03 03:03:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126868 states. [2019-10-03 03:03:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126868 states to 126868 states and 150687 transitions. [2019-10-03 03:03:35,217 INFO L78 Accepts]: Start accepts. Automaton has 126868 states and 150687 transitions. Word has length 113 [2019-10-03 03:03:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:35,218 INFO L475 AbstractCegarLoop]: Abstraction has 126868 states and 150687 transitions. [2019-10-03 03:03:35,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 126868 states and 150687 transitions. [2019-10-03 03:03:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 03:03:35,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:35,226 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:35,227 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1164512815, now seen corresponding path program 1 times [2019-10-03 03:03:35,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:35,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:35,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:35,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:35,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:35,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-10-03 03:03:35,602 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [498], [501], [504], [507], [511], [515], [929], [932], [935], [939], [942], [946], [949], [952], [955], [963], [967], [3328], [3331], [3334], [3337], [3340], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3673], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:03:35,605 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:35,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:35,668 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:36,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:36,273 INFO L272 AbstractInterpreter]: Visited 106 different actions 508 times. Merged at 43 different actions 374 times. Widened at 17 different actions 68 times. Performed 2222 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2222 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 12 different actions. Largest state had 392 variables. [2019-10-03 03:03:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:36,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:36,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:36,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:36,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:36,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:37,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-03 03:03:37,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:37,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:37,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:37,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:37,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:37,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:37,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:37,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:37,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:38,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:38,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:38,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:38,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:03:38,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:38,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 29 [2019-10-03 03:03:38,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:38,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-03 03:03:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-03 03:03:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2019-10-03 03:03:38,145 INFO L87 Difference]: Start difference. First operand 126868 states and 150687 transitions. Second operand 24 states. [2019-10-03 03:03:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:42,778 INFO L93 Difference]: Finished difference Result 338571 states and 399878 transitions. [2019-10-03 03:03:42,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-03 03:03:42,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2019-10-03 03:03:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:43,155 INFO L225 Difference]: With dead ends: 338571 [2019-10-03 03:03:43,156 INFO L226 Difference]: Without dead ends: 338571 [2019-10-03 03:03:43,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=542, Invalid=2214, Unknown=0, NotChecked=0, Total=2756 [2019-10-03 03:03:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338571 states. [2019-10-03 03:03:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338571 to 127016. [2019-10-03 03:03:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127016 states. [2019-10-03 03:03:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127016 states to 127016 states and 150854 transitions. [2019-10-03 03:03:45,863 INFO L78 Accepts]: Start accepts. Automaton has 127016 states and 150854 transitions. Word has length 113 [2019-10-03 03:03:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:45,863 INFO L475 AbstractCegarLoop]: Abstraction has 127016 states and 150854 transitions. [2019-10-03 03:03:45,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-03 03:03:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 127016 states and 150854 transitions. [2019-10-03 03:03:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:03:45,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:45,871 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:45,872 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1888162720, now seen corresponding path program 1 times [2019-10-03 03:03:45,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:45,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:45,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:45,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:46,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:46,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:46,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 03:03:46,085 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1276], [1300], [1306], [1335], [1338], [1341], [1345], [1349], [2873], [2876], [2880], [2882], [2885], [2888], [2892], [2895], [2899], [2902], [2905], [2908], [2913], [3328], [3331], [3352], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:03:46,087 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:46,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:46,151 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:46,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:46,637 INFO L272 AbstractInterpreter]: Visited 107 different actions 498 times. Merged at 43 different actions 359 times. Widened at 15 different actions 67 times. Performed 2102 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2102 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 25 fixpoints after 10 different actions. Largest state had 393 variables. [2019-10-03 03:03:46,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:46,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:46,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:46,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:46,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:46,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:47,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-03 03:03:47,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:47,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:47,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:47,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:47,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:48,358 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:48,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [10] total 26 [2019-10-03 03:03:48,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:48,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:48,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:03:48,360 INFO L87 Difference]: Start difference. First operand 127016 states and 150854 transitions. Second operand 10 states. [2019-10-03 03:03:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:49,948 INFO L93 Difference]: Finished difference Result 122909 states and 145660 transitions. [2019-10-03 03:03:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:03:49,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-03 03:03:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:50,074 INFO L225 Difference]: With dead ends: 122909 [2019-10-03 03:03:50,074 INFO L226 Difference]: Without dead ends: 122909 [2019-10-03 03:03:50,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2019-10-03 03:03:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122909 states. [2019-10-03 03:03:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122909 to 120196. [2019-10-03 03:03:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120196 states. [2019-10-03 03:03:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120196 states to 120196 states and 142682 transitions. [2019-10-03 03:03:51,158 INFO L78 Accepts]: Start accepts. Automaton has 120196 states and 142682 transitions. Word has length 114 [2019-10-03 03:03:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:51,158 INFO L475 AbstractCegarLoop]: Abstraction has 120196 states and 142682 transitions. [2019-10-03 03:03:51,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 120196 states and 142682 transitions. [2019-10-03 03:03:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:03:51,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:51,167 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:03:51,167 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -134197463, now seen corresponding path program 1 times [2019-10-03 03:03:51,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:51,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:51,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:52,255 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-10-03 03:03:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:52,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:52,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:52,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 03:03:52,871 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [988], [1238], [1242], [1245], [1248], [1251], [1254], [1257], [1261], [1264], [1267], [1270], [1273], [1278], [1281], [1284], [1287], [1291], [1295], [2773], [2776], [2780], [2782], [2785], [2788], [2792], [2795], [2799], [2802], [2805], [2808], [2816], [2820], [3328], [3331], [3334], [3350], [3354], [3356], [3358], [3377], [3379], [3382], [3385], [3388], [3396], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:03:52,873 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:52,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:52,929 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:53,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:53,748 INFO L272 AbstractInterpreter]: Visited 107 different actions 414 times. Merged at 44 different actions 284 times. Widened at 14 different actions 38 times. Performed 1883 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1883 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 10 different actions. Largest state had 392 variables. [2019-10-03 03:03:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:53,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:53,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:53,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:03:53,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:53,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:54,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 03:03:54,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:54,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:55,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:55,702 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:03:55,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [21] total 39 [2019-10-03 03:03:55,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:55,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:03:55,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:03:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1374, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:03:55,703 INFO L87 Difference]: Start difference. First operand 120196 states and 142682 transitions. Second operand 11 states. [2019-10-03 03:03:56,718 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-10-03 03:03:56,883 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-03 03:03:57,613 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-03 03:03:57,849 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-03 03:03:58,349 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-03 03:03:58,853 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-03 03:03:59,236 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-03 03:03:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:59,492 INFO L93 Difference]: Finished difference Result 153556 states and 181052 transitions. [2019-10-03 03:03:59,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 03:03:59,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2019-10-03 03:03:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:59,636 INFO L225 Difference]: With dead ends: 153556 [2019-10-03 03:03:59,637 INFO L226 Difference]: Without dead ends: 153556 [2019-10-03 03:03:59,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=395, Invalid=2685, Unknown=0, NotChecked=0, Total=3080 [2019-10-03 03:03:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153556 states. [2019-10-03 03:04:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153556 to 129640. [2019-10-03 03:04:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129640 states. [2019-10-03 03:04:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129640 states to 129640 states and 153952 transitions. [2019-10-03 03:04:01,192 INFO L78 Accepts]: Start accepts. Automaton has 129640 states and 153952 transitions. Word has length 114 [2019-10-03 03:04:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:01,192 INFO L475 AbstractCegarLoop]: Abstraction has 129640 states and 153952 transitions. [2019-10-03 03:04:01,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:04:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 129640 states and 153952 transitions. [2019-10-03 03:04:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:04:01,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:01,201 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:01,201 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1939635797, now seen corresponding path program 1 times [2019-10-03 03:04:01,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:01,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:01,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:01,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:01,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:01,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 03:04:01,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:01,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 03:04:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 03:04:01,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-03 03:04:01,654 INFO L87 Difference]: Start difference. First operand 129640 states and 153952 transitions. Second operand 16 states. [2019-10-03 03:04:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:04,991 INFO L93 Difference]: Finished difference Result 224817 states and 267114 transitions. [2019-10-03 03:04:04,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:04:04,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 114 [2019-10-03 03:04:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:05,367 INFO L225 Difference]: With dead ends: 224817 [2019-10-03 03:04:05,367 INFO L226 Difference]: Without dead ends: 224617 [2019-10-03 03:04:05,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=363, Invalid=1197, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 03:04:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224617 states. [2019-10-03 03:04:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224617 to 127180. [2019-10-03 03:04:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127180 states. [2019-10-03 03:04:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127180 states to 127180 states and 150952 transitions. [2019-10-03 03:04:07,449 INFO L78 Accepts]: Start accepts. Automaton has 127180 states and 150952 transitions. Word has length 114 [2019-10-03 03:04:07,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:07,450 INFO L475 AbstractCegarLoop]: Abstraction has 127180 states and 150952 transitions. [2019-10-03 03:04:07,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 03:04:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 127180 states and 150952 transitions. [2019-10-03 03:04:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:04:07,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:07,460 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:07,461 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1751705136, now seen corresponding path program 1 times [2019-10-03 03:04:07,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:07,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:07,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:07,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:07,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:07,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:07,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:04:07,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:07,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:04:07,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:04:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:07,544 INFO L87 Difference]: Start difference. First operand 127180 states and 150952 transitions. Second operand 3 states. [2019-10-03 03:04:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:07,858 INFO L93 Difference]: Finished difference Result 87614 states and 101298 transitions. [2019-10-03 03:04:07,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:04:07,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-03 03:04:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:07,980 INFO L225 Difference]: With dead ends: 87614 [2019-10-03 03:04:07,980 INFO L226 Difference]: Without dead ends: 87553 [2019-10-03 03:04:07,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87553 states. [2019-10-03 03:04:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87553 to 84677. [2019-10-03 03:04:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84677 states. [2019-10-03 03:04:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84677 states to 84677 states and 98309 transitions. [2019-10-03 03:04:09,371 INFO L78 Accepts]: Start accepts. Automaton has 84677 states and 98309 transitions. Word has length 114 [2019-10-03 03:04:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:09,371 INFO L475 AbstractCegarLoop]: Abstraction has 84677 states and 98309 transitions. [2019-10-03 03:04:09,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:04:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 84677 states and 98309 transitions. [2019-10-03 03:04:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:04:09,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:09,376 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:09,377 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1746006088, now seen corresponding path program 1 times [2019-10-03 03:04:09,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:09,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:09,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:09,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:09,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:09,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:09,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:09,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-10-03 03:04:09,915 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [496], [520], [526], [1844], [1847], [1850], [1854], [1858], [2285], [2288], [2291], [2295], [2298], [2302], [2305], [2308], [2311], [2316], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:04:09,917 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:09,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:10,007 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:10,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:10,401 INFO L272 AbstractInterpreter]: Visited 107 different actions 416 times. Merged at 43 different actions 285 times. Widened at 13 different actions 38 times. Performed 1900 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 393 variables. [2019-10-03 03:04:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:10,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:10,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:10,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:04:10,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:10,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:10,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 2083 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:04:10,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:11,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:11,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:11,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:11,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:11,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2019-10-03 03:04:11,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:11,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-03 03:04:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-03 03:04:11,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:04:11,663 INFO L87 Difference]: Start difference. First operand 84677 states and 98309 transitions. Second operand 23 states. [2019-10-03 03:04:15,765 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2019-10-03 03:04:16,503 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 47 [2019-10-03 03:04:16,701 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-10-03 03:04:17,350 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-10-03 03:04:18,089 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2019-10-03 03:04:18,359 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2019-10-03 03:04:19,295 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 [2019-10-03 03:04:19,519 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-03 03:04:19,731 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2019-10-03 03:04:20,113 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 53 [2019-10-03 03:04:20,668 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-10-03 03:04:20,907 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 49 [2019-10-03 03:04:21,132 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2019-10-03 03:04:21,310 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2019-10-03 03:04:21,472 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-03 03:04:21,763 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-10-03 03:04:22,836 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-03 03:04:23,257 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2019-10-03 03:04:23,447 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2019-10-03 03:04:23,813 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-10-03 03:04:24,007 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-03 03:04:24,272 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-10-03 03:04:24,474 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-10-03 03:04:24,674 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-10-03 03:04:24,841 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-03 03:04:25,080 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-03 03:04:25,257 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-03 03:04:25,493 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-10-03 03:04:25,687 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-03 03:04:25,929 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-03 03:04:26,145 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-10-03 03:04:27,242 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-03 03:04:27,456 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2019-10-03 03:04:27,640 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-10-03 03:04:27,947 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-10-03 03:04:28,127 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-10-03 03:04:28,519 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-03 03:04:28,672 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-03 03:04:29,137 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-10-03 03:04:29,295 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-03 03:04:29,505 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-03 03:04:29,828 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 35 [2019-10-03 03:04:30,025 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-10-03 03:04:30,222 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-03 03:04:30,414 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-03 03:04:30,670 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-03 03:04:30,890 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 38 [2019-10-03 03:04:31,147 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2019-10-03 03:04:31,411 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 57 [2019-10-03 03:04:31,611 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 35 [2019-10-03 03:04:31,991 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2019-10-03 03:04:32,205 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 32 [2019-10-03 03:04:33,238 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2019-10-03 03:04:33,418 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2019-10-03 03:04:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:34,955 INFO L93 Difference]: Finished difference Result 230455 states and 264841 transitions. [2019-10-03 03:04:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-10-03 03:04:34,956 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 114 [2019-10-03 03:04:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:35,173 INFO L225 Difference]: With dead ends: 230455 [2019-10-03 03:04:35,173 INFO L226 Difference]: Without dead ends: 230455 [2019-10-03 03:04:35,177 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5113 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3227, Invalid=13803, Unknown=0, NotChecked=0, Total=17030 [2019-10-03 03:04:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230455 states. [2019-10-03 03:04:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230455 to 87576. [2019-10-03 03:04:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87576 states. [2019-10-03 03:04:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87576 states to 87576 states and 101547 transitions. [2019-10-03 03:04:36,449 INFO L78 Accepts]: Start accepts. Automaton has 87576 states and 101547 transitions. Word has length 114 [2019-10-03 03:04:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:36,450 INFO L475 AbstractCegarLoop]: Abstraction has 87576 states and 101547 transitions. [2019-10-03 03:04:36,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-03 03:04:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 87576 states and 101547 transitions. [2019-10-03 03:04:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:04:36,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:36,454 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:36,454 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1420870122, now seen corresponding path program 1 times [2019-10-03 03:04:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:36,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:36,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:36,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 03:04:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:04:36,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:36,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:04:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:04:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:04:36,759 INFO L87 Difference]: Start difference. First operand 87576 states and 101547 transitions. Second operand 10 states. [2019-10-03 03:04:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:38,309 INFO L93 Difference]: Finished difference Result 203389 states and 235560 transitions. [2019-10-03 03:04:38,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:04:38,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-03 03:04:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:38,498 INFO L225 Difference]: With dead ends: 203389 [2019-10-03 03:04:38,499 INFO L226 Difference]: Without dead ends: 203389 [2019-10-03 03:04:38,499 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:04:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203389 states. [2019-10-03 03:04:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203389 to 87010. [2019-10-03 03:04:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87010 states. [2019-10-03 03:04:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87010 states to 87010 states and 100908 transitions. [2019-10-03 03:04:39,660 INFO L78 Accepts]: Start accepts. Automaton has 87010 states and 100908 transitions. Word has length 114 [2019-10-03 03:04:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:39,660 INFO L475 AbstractCegarLoop]: Abstraction has 87010 states and 100908 transitions. [2019-10-03 03:04:39,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:04:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 87010 states and 100908 transitions. [2019-10-03 03:04:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 03:04:39,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:39,666 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:39,667 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash 19136080, now seen corresponding path program 1 times [2019-10-03 03:04:39,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:39,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:39,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:39,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:39,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:04:39,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:39,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:04:39,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:04:39,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:04:39,916 INFO L87 Difference]: Start difference. First operand 87010 states and 100908 transitions. Second operand 10 states. [2019-10-03 03:04:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:42,361 INFO L93 Difference]: Finished difference Result 116079 states and 134548 transitions. [2019-10-03 03:04:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 03:04:42,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-03 03:04:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:42,464 INFO L225 Difference]: With dead ends: 116079 [2019-10-03 03:04:42,464 INFO L226 Difference]: Without dead ends: 116079 [2019-10-03 03:04:42,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2019-10-03 03:04:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116079 states. [2019-10-03 03:04:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116079 to 87785. [2019-10-03 03:04:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87785 states. [2019-10-03 03:04:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87785 states to 87785 states and 101747 transitions. [2019-10-03 03:04:43,288 INFO L78 Accepts]: Start accepts. Automaton has 87785 states and 101747 transitions. Word has length 114 [2019-10-03 03:04:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:43,288 INFO L475 AbstractCegarLoop]: Abstraction has 87785 states and 101747 transitions. [2019-10-03 03:04:43,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:04:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 87785 states and 101747 transitions. [2019-10-03 03:04:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 03:04:43,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:43,292 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:43,293 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1698734734, now seen corresponding path program 1 times [2019-10-03 03:04:43,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:43,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:43,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:43,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:43,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:43,541 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-10-03 03:04:43,542 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [166], [169], [170], [172], [175], [178], [181], [184], [189], [192], [201], [203], [359], [462], [465], [468], [472], [475], [478], [482], [484], [487], [490], [493], [498], [518], [520], [526], [1844], [1847], [1850], [1854], [1858], [2285], [2288], [2291], [2295], [2298], [2302], [2305], [2308], [2311], [2316], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3720], [3722], [3725], [3728], [3731], [3739], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:04:43,544 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:43,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:43,607 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:44,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:44,063 INFO L272 AbstractInterpreter]: Visited 108 different actions 427 times. Merged at 43 different actions 294 times. Widened at 14 different actions 39 times. Performed 1973 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1973 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 23 fixpoints after 14 different actions. Largest state had 393 variables. [2019-10-03 03:04:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:44,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:44,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:44,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:04:44,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:44,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:44,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:04:44,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:44,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:44,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:45,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:45,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:45,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:45,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:45,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:45,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:45,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-10-03 03:04:45,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:45,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:04:45,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:04:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-10-03 03:04:45,765 INFO L87 Difference]: Start difference. First operand 87785 states and 101747 transitions. Second operand 18 states. [2019-10-03 03:04:46,048 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:04:46,196 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:04:46,328 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:04:47,472 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-10-03 03:04:49,151 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-10-03 03:04:50,133 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:04:50,522 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:04:50,927 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:04:51,867 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-03 03:04:52,126 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-10-03 03:04:52,582 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-03 03:04:53,190 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:04:53,342 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:04:53,740 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:04:54,436 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:04:54,885 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:04:55,450 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:04:56,243 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:04:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:56,461 INFO L93 Difference]: Finished difference Result 146105 states and 166772 transitions. [2019-10-03 03:04:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-03 03:04:56,461 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2019-10-03 03:04:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:56,622 INFO L225 Difference]: With dead ends: 146105 [2019-10-03 03:04:56,622 INFO L226 Difference]: Without dead ends: 146105 [2019-10-03 03:04:56,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 205 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1134, Invalid=3558, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 03:04:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146105 states. [2019-10-03 03:04:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146105 to 98698. [2019-10-03 03:04:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98698 states. [2019-10-03 03:04:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98698 states to 98698 states and 114267 transitions. [2019-10-03 03:04:58,055 INFO L78 Accepts]: Start accepts. Automaton has 98698 states and 114267 transitions. Word has length 115 [2019-10-03 03:04:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:58,055 INFO L475 AbstractCegarLoop]: Abstraction has 98698 states and 114267 transitions. [2019-10-03 03:04:58,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:04:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 98698 states and 114267 transitions. [2019-10-03 03:04:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:04:58,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:58,060 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:04:58,060 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1977970217, now seen corresponding path program 1 times [2019-10-03 03:04:58,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:58,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:58,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:58,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:58,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:58,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:58,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:04:58,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:58,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:04:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:04:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:04:58,678 INFO L87 Difference]: Start difference. First operand 98698 states and 114267 transitions. Second operand 19 states. [2019-10-03 03:05:00,739 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-03 03:05:00,897 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-03 03:05:01,061 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-03 03:05:01,314 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-03 03:05:01,649 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-03 03:05:02,680 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-10-03 03:05:03,027 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-03 03:05:03,240 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-03 03:05:03,531 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-03 03:05:03,703 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-03 03:05:03,969 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-03 03:05:04,911 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-03 03:05:05,835 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-03 03:05:06,134 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-03 03:05:06,447 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-03 03:05:06,639 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-03 03:05:06,791 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-03 03:05:06,965 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-03 03:05:07,478 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-10-03 03:05:07,775 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-03 03:05:07,957 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-10-03 03:05:08,241 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-03 03:05:09,067 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-10-03 03:05:09,580 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-10-03 03:05:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:09,710 INFO L93 Difference]: Finished difference Result 350378 states and 404349 transitions. [2019-10-03 03:05:09,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-03 03:05:09,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2019-10-03 03:05:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:10,178 INFO L225 Difference]: With dead ends: 350378 [2019-10-03 03:05:10,179 INFO L226 Difference]: Without dead ends: 350378 [2019-10-03 03:05:10,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2729 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1349, Invalid=6841, Unknown=0, NotChecked=0, Total=8190 [2019-10-03 03:05:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350378 states. [2019-10-03 03:05:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350378 to 114948. [2019-10-03 03:05:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114948 states. [2019-10-03 03:05:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114948 states to 114948 states and 132924 transitions. [2019-10-03 03:05:12,959 INFO L78 Accepts]: Start accepts. Automaton has 114948 states and 132924 transitions. Word has length 116 [2019-10-03 03:05:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:12,959 INFO L475 AbstractCegarLoop]: Abstraction has 114948 states and 132924 transitions. [2019-10-03 03:05:12,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:05:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 114948 states and 132924 transitions. [2019-10-03 03:05:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:05:12,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:12,965 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:12,965 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1021041834, now seen corresponding path program 1 times [2019-10-03 03:05:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:12,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:12,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:12,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:05:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:05:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:05:13,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:05:13,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:05:13,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:05:13,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:05:13,053 INFO L87 Difference]: Start difference. First operand 114948 states and 132924 transitions. Second operand 4 states. [2019-10-03 03:05:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:05:13,762 INFO L93 Difference]: Finished difference Result 132676 states and 152962 transitions. [2019-10-03 03:05:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:05:13,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-03 03:05:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:05:13,882 INFO L225 Difference]: With dead ends: 132676 [2019-10-03 03:05:13,882 INFO L226 Difference]: Without dead ends: 132676 [2019-10-03 03:05:13,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:05:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132676 states. [2019-10-03 03:05:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132676 to 101636. [2019-10-03 03:05:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101636 states. [2019-10-03 03:05:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101636 states to 101636 states and 117585 transitions. [2019-10-03 03:05:14,854 INFO L78 Accepts]: Start accepts. Automaton has 101636 states and 117585 transitions. Word has length 116 [2019-10-03 03:05:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:05:14,854 INFO L475 AbstractCegarLoop]: Abstraction has 101636 states and 117585 transitions. [2019-10-03 03:05:14,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:05:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 101636 states and 117585 transitions. [2019-10-03 03:05:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:05:14,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:05:14,859 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:05:14,860 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:05:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1376102527, now seen corresponding path program 1 times [2019-10-03 03:05:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:05:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:14,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:05:14,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:05:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:15,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:15,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:05:15,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-10-03 03:05:15,224 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [121], [166], [169], [170], [172], [175], [178], [181], [184], [187], [201], [203], [253], [259], [288], [291], [294], [297], [302], [305], [308], [339], [341], [689], [692], [695], [699], [702], [730], [732], [735], [738], [741], [749], [753], [3328], [3331], [3352], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:05:15,227 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:05:15,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:05:15,281 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:05:15,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:05:15,717 INFO L272 AbstractInterpreter]: Visited 109 different actions 455 times. Merged at 41 different actions 317 times. Widened at 16 different actions 59 times. Performed 2007 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2007 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 10 different actions. Largest state had 393 variables. [2019-10-03 03:05:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:05:15,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:05:15,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:05:15,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:05:16,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:05:16,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:05:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:05:16,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:05:16,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:05:17,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:17,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:17,512 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:05:18,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:18,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:05:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:05:18,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:05:18,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 36 [2019-10-03 03:05:18,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:05:18,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-03 03:05:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-03 03:05:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 03:05:18,987 INFO L87 Difference]: Start difference. First operand 101636 states and 117585 transitions. Second operand 25 states. [2019-10-03 03:05:19,171 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-03 03:05:20,912 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-03 03:05:21,557 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-10-03 03:05:23,154 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-10-03 03:05:23,529 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-10-03 03:05:24,008 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-10-03 03:05:24,198 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-03 03:05:25,193 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-10-03 03:05:25,561 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-03 03:05:26,809 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-10-03 03:05:27,050 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-10-03 03:05:27,778 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:05:27,989 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:05:28,174 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:05:28,431 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:05:28,931 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-10-03 03:05:29,378 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-10-03 03:05:29,573 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-10-03 03:05:30,838 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-10-03 03:05:31,389 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-10-03 03:05:31,546 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-10-03 03:05:31,904 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:05:32,139 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-10-03 03:05:32,304 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:05:32,870 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:05:33,063 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-03 03:05:33,541 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-03 03:05:33,725 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-10-03 03:05:33,927 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:05:34,345 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-10-03 03:05:34,521 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-10-03 03:05:35,515 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:05:35,753 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-10-03 03:05:36,932 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-03 03:05:37,122 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:05:37,524 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-10-03 03:05:39,063 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-10-03 03:05:39,349 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2019-10-03 03:05:40,100 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-03 03:05:40,436 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-10-03 03:05:41,400 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-10-03 03:05:41,640 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:05:41,934 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-10-03 03:05:42,150 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:05:43,135 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-10-03 03:05:44,068 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-10-03 03:05:44,298 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-03 03:05:44,540 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:05:44,911 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:05:45,193 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-10-03 03:05:45,458 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-10-03 03:05:46,042 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-03 03:05:46,261 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-03 03:05:46,528 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-10-03 03:05:46,796 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-10-03 03:05:47,103 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2019-10-03 03:05:47,316 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:05:47,867 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-03 03:05:48,129 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-10-03 03:05:48,434 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2019-10-03 03:05:48,936 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-10-03 03:05:49,236 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-03 03:05:49,455 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-03 03:05:49,710 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-03 03:05:49,923 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:05:50,492 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-03 03:05:50,963 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-03 03:05:51,252 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-03 03:05:51,431 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-03 03:05:51,676 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-10-03 03:05:52,262 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-10-03 03:05:52,516 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:05:52,772 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-10-03 03:05:54,607 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:05:54,807 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-10-03 03:05:55,394 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-10-03 03:05:55,704 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-03 03:05:55,949 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-03 03:05:56,150 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-10-03 03:05:57,302 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-03 03:05:57,696 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-03 03:05:58,033 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:05:58,229 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:05:58,452 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-10-03 03:05:59,653 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-03 03:06:01,303 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:06:01,481 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:06:01,704 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-10-03 03:06:01,902 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-03 03:06:02,958 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-10-03 03:06:03,158 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-03 03:06:03,489 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-10-03 03:06:03,745 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-10-03 03:06:03,981 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-03 03:06:04,190 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:06:04,376 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-03 03:06:05,231 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-03 03:06:05,835 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-10-03 03:06:06,025 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-03 03:06:06,409 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-10-03 03:06:06,628 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:06:07,089 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-03 03:06:07,320 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:06:07,534 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:06:08,081 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-10-03 03:06:08,327 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-10-03 03:06:08,555 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-10-03 03:06:08,751 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-03 03:06:09,136 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:06:09,335 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:06:09,951 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2019-10-03 03:06:10,197 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-10-03 03:06:10,612 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:06:10,828 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:06:11,044 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:06:11,232 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:06:12,211 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-03 03:06:12,563 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:06:12,764 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-03 03:06:13,309 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:06:13,498 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-03 03:06:13,704 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:06:13,893 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-10-03 03:06:14,079 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-03 03:06:14,579 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-03 03:06:14,794 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:06:14,997 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-03 03:06:15,213 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:06:15,431 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-10-03 03:06:15,613 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-03 03:06:16,312 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-10-03 03:06:16,553 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:06:16,774 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-03 03:06:16,980 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-03 03:06:19,205 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-03 03:06:19,899 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-03 03:06:20,131 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-10-03 03:06:20,937 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-03 03:06:21,163 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-10-03 03:06:21,442 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-10-03 03:06:21,640 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-03 03:06:21,849 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:06:22,060 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-10-03 03:06:22,959 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:06:23,689 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-10-03 03:06:23,935 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-10-03 03:06:24,147 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-10-03 03:06:24,536 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:06:24,761 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:06:24,946 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-10-03 03:06:25,132 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-10-03 03:06:25,997 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-10-03 03:06:26,296 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-10-03 03:06:26,589 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-10-03 03:06:26,831 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:06:27,325 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-10-03 03:06:27,534 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-10-03 03:06:27,741 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-10-03 03:06:27,965 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-03 03:06:28,742 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-10-03 03:06:29,089 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-10-03 03:06:29,339 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-10-03 03:06:29,917 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-03 03:06:30,419 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-10-03 03:06:30,605 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-10-03 03:06:30,809 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-10-03 03:06:31,169 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:06:31,355 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:06:31,532 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-10-03 03:06:31,752 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:06:31,939 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-10-03 03:06:32,126 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-10-03 03:06:32,433 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-10-03 03:06:32,784 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-10-03 03:06:33,334 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:06:33,528 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:06:33,734 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-10-03 03:06:33,952 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-10-03 03:06:34,267 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-10-03 03:06:34,866 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-03 03:06:35,274 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:06:35,484 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-03 03:06:35,942 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-03 03:06:36,325 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-10-03 03:06:36,729 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-03 03:06:36,931 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-10-03 03:06:37,165 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:06:37,422 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:06:37,634 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-03 03:06:38,486 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-10-03 03:06:38,748 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-03 03:06:38,957 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-10-03 03:06:39,150 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-03 03:06:39,332 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-03 03:06:39,663 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:06:39,906 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-03 03:06:40,254 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-03 03:06:40,470 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-03 03:06:41,986 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:06:43,245 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:06:44,494 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-03 03:06:44,761 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-10-03 03:06:45,046 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-10-03 03:06:45,589 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-10-03 03:06:45,787 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:06:46,124 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-10-03 03:06:46,309 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-03 03:06:46,577 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-10-03 03:06:46,797 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:06:47,406 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2019-10-03 03:06:47,656 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:06:47,888 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:06:48,444 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-10-03 03:06:48,662 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:06:48,991 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-10-03 03:06:49,338 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:06:49,567 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:06:49,864 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-10-03 03:06:50,204 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-10-03 03:06:50,723 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-03 03:06:50,974 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-10-03 03:06:51,429 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-10-03 03:06:51,691 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2019-10-03 03:06:51,929 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:06:52,271 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-03 03:06:52,831 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-10-03 03:06:53,237 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2019-10-03 03:06:53,554 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-10-03 03:06:53,852 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-10-03 03:06:54,119 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-10-03 03:06:54,367 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:06:55,262 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2019-10-03 03:06:55,574 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:06:56,293 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-10-03 03:06:56,536 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2019-10-03 03:06:56,776 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-03 03:06:56,986 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-03 03:06:57,246 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-03 03:06:57,489 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-03 03:06:58,058 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-10-03 03:06:58,339 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-10-03 03:06:58,806 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:06:59,019 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:06:59,245 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:06:59,450 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:06:59,884 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:07:00,300 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-10-03 03:07:00,538 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-10-03 03:07:00,758 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:07:00,999 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-03 03:07:01,223 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-10-03 03:07:01,810 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:07:02,022 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:07:02,218 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-10-03 03:07:02,426 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-03 03:07:02,623 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-03 03:07:03,597 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-03 03:07:03,806 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-03 03:07:04,069 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-10-03 03:07:04,317 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-03 03:07:04,564 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-03 03:07:04,789 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:07:05,906 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-03 03:07:06,168 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-10-03 03:07:06,430 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-10-03 03:07:06,666 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:07:06,908 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:07:07,145 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-03 03:07:07,391 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-03 03:07:07,638 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-03 03:07:07,886 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-03 03:07:08,100 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-03 03:07:08,758 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-03 03:07:09,154 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-10-03 03:07:09,643 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-03 03:07:09,898 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-03 03:07:10,181 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2019-10-03 03:07:10,444 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-03 03:07:10,632 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-03 03:07:10,943 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-03 03:07:11,199 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:07:11,437 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:07:11,654 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-03 03:07:12,219 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-10-03 03:07:12,500 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-03 03:07:12,970 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-03 03:07:13,965 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-10-03 03:07:14,405 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-03 03:07:14,721 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-03 03:07:15,005 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-10-03 03:07:15,262 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-10-03 03:07:15,609 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-10-03 03:07:15,893 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-03 03:07:16,565 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-10-03 03:07:16,930 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:07:17,241 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-10-03 03:07:17,482 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-10-03 03:07:17,745 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-03 03:07:18,869 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-10-03 03:07:19,368 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:07:20,069 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:07:21,859 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-03 03:07:22,355 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-10-03 03:07:22,603 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-03 03:07:23,016 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-03 03:07:24,174 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-10-03 03:07:25,992 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-10-03 03:07:26,870 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-10-03 03:07:28,193 WARN L191 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-10-03 03:07:29,693 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-10-03 03:07:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:33,919 INFO L93 Difference]: Finished difference Result 515324 states and 585232 transitions. [2019-10-03 03:07:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 654 states. [2019-10-03 03:07:33,919 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2019-10-03 03:07:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:34,578 INFO L225 Difference]: With dead ends: 515324 [2019-10-03 03:07:34,579 INFO L226 Difference]: Without dead ends: 515286 [2019-10-03 03:07:34,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 196 SyntacticMatches, 15 SemanticMatches, 684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220037 ImplicationChecksByTransitivity, 109.7s TimeCoverageRelationStatistics Valid=47148, Invalid=422762, Unknown=0, NotChecked=0, Total=469910 [2019-10-03 03:07:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515286 states. [2019-10-03 03:07:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515286 to 185142. [2019-10-03 03:07:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185142 states. [2019-10-03 03:07:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185142 states to 185142 states and 212400 transitions. [2019-10-03 03:07:42,063 INFO L78 Accepts]: Start accepts. Automaton has 185142 states and 212400 transitions. Word has length 116 [2019-10-03 03:07:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:42,063 INFO L475 AbstractCegarLoop]: Abstraction has 185142 states and 212400 transitions. [2019-10-03 03:07:42,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-03 03:07:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 185142 states and 212400 transitions. [2019-10-03 03:07:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 03:07:42,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:42,068 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:42,069 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1717006596, now seen corresponding path program 1 times [2019-10-03 03:07:42,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:42,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:42,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:42,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:42,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 03:07:42,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:42,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:07:42,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:42,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:07:42,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:07:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:07:42,287 INFO L87 Difference]: Start difference. First operand 185142 states and 212400 transitions. Second operand 10 states. [2019-10-03 03:07:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:07:46,383 INFO L93 Difference]: Finished difference Result 482622 states and 554937 transitions. [2019-10-03 03:07:46,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 03:07:46,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-10-03 03:07:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:07:47,014 INFO L225 Difference]: With dead ends: 482622 [2019-10-03 03:07:47,014 INFO L226 Difference]: Without dead ends: 482622 [2019-10-03 03:07:47,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:07:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482622 states. [2019-10-03 03:07:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482622 to 185142. [2019-10-03 03:07:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185142 states. [2019-10-03 03:07:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185142 states to 185142 states and 212399 transitions. [2019-10-03 03:07:55,566 INFO L78 Accepts]: Start accepts. Automaton has 185142 states and 212399 transitions. Word has length 116 [2019-10-03 03:07:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:07:55,566 INFO L475 AbstractCegarLoop]: Abstraction has 185142 states and 212399 transitions. [2019-10-03 03:07:55,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:07:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 185142 states and 212399 transitions. [2019-10-03 03:07:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 03:07:55,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:07:55,573 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:07:55,573 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:07:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:07:55,574 INFO L82 PathProgramCache]: Analyzing trace with hash -799831579, now seen corresponding path program 1 times [2019-10-03 03:07:55,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:07:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:07:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:07:55,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:07:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:07:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:07:55,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:07:55,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:07:55,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:07:55,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:07:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:07:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:07:55,842 INFO L87 Difference]: Start difference. First operand 185142 states and 212399 transitions. Second operand 12 states. [2019-10-03 03:07:59,742 WARN L191 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-10-03 03:08:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:01,851 INFO L93 Difference]: Finished difference Result 504887 states and 580230 transitions. [2019-10-03 03:08:01,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-03 03:08:01,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2019-10-03 03:08:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:02,383 INFO L225 Difference]: With dead ends: 504887 [2019-10-03 03:08:02,383 INFO L226 Difference]: Without dead ends: 504887 [2019-10-03 03:08:02,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=866, Invalid=3166, Unknown=0, NotChecked=0, Total=4032 [2019-10-03 03:08:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504887 states. [2019-10-03 03:08:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504887 to 240495. [2019-10-03 03:08:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240495 states. [2019-10-03 03:08:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240495 states to 240495 states and 275782 transitions. [2019-10-03 03:08:08,258 INFO L78 Accepts]: Start accepts. Automaton has 240495 states and 275782 transitions. Word has length 117 [2019-10-03 03:08:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:08,258 INFO L475 AbstractCegarLoop]: Abstraction has 240495 states and 275782 transitions. [2019-10-03 03:08:08,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:08:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 240495 states and 275782 transitions. [2019-10-03 03:08:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 03:08:08,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:08,265 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:08,265 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1099226592, now seen corresponding path program 1 times [2019-10-03 03:08:08,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:08,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:08,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:08:08,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:08,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:08,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:08,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:08,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:08,331 INFO L87 Difference]: Start difference. First operand 240495 states and 275782 transitions. Second operand 4 states. [2019-10-03 03:08:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:11,087 INFO L93 Difference]: Finished difference Result 361391 states and 414743 transitions. [2019-10-03 03:08:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:11,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-03 03:08:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:11,552 INFO L225 Difference]: With dead ends: 361391 [2019-10-03 03:08:11,553 INFO L226 Difference]: Without dead ends: 361391 [2019-10-03 03:08:11,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361391 states. [2019-10-03 03:08:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361391 to 239643. [2019-10-03 03:08:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239643 states. [2019-10-03 03:08:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239643 states to 239643 states and 274759 transitions. [2019-10-03 03:08:22,081 INFO L78 Accepts]: Start accepts. Automaton has 239643 states and 274759 transitions. Word has length 118 [2019-10-03 03:08:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:22,081 INFO L475 AbstractCegarLoop]: Abstraction has 239643 states and 274759 transitions. [2019-10-03 03:08:22,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 239643 states and 274759 transitions. [2019-10-03 03:08:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 03:08:22,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:22,089 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:22,089 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1622547263, now seen corresponding path program 1 times [2019-10-03 03:08:22,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:22,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:22,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 03:08:22,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:22,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:08:22,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:22,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:08:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:08:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:08:22,237 INFO L87 Difference]: Start difference. First operand 239643 states and 274759 transitions. Second operand 9 states. [2019-10-03 03:08:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:24,683 INFO L93 Difference]: Finished difference Result 347867 states and 399244 transitions. [2019-10-03 03:08:24,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 03:08:24,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-10-03 03:08:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:26,150 INFO L225 Difference]: With dead ends: 347867 [2019-10-03 03:08:26,150 INFO L226 Difference]: Without dead ends: 347867 [2019-10-03 03:08:26,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:08:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347867 states. [2019-10-03 03:08:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347867 to 184386. [2019-10-03 03:08:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184386 states. [2019-10-03 03:08:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184386 states to 184386 states and 211492 transitions. [2019-10-03 03:08:29,294 INFO L78 Accepts]: Start accepts. Automaton has 184386 states and 211492 transitions. Word has length 118 [2019-10-03 03:08:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:29,294 INFO L475 AbstractCegarLoop]: Abstraction has 184386 states and 211492 transitions. [2019-10-03 03:08:29,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:08:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 184386 states and 211492 transitions. [2019-10-03 03:08:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 03:08:29,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:29,300 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:08:29,300 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 420279899, now seen corresponding path program 1 times [2019-10-03 03:08:29,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:29,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:29,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:30,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:30,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:30,644 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-10-03 03:08:30,644 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [121], [166], [169], [170], [172], [175], [178], [181], [184], [187], [201], [203], [253], [259], [288], [291], [294], [297], [300], [346], [352], [1626], [1629], [1632], [1635], [1640], [1643], [1646], [1649], [1653], [1656], [1684], [1686], [1689], [1692], [1695], [1703], [1707], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3675], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:08:30,648 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:30,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:30,719 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:31,089 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:08:31,089 INFO L272 AbstractInterpreter]: Visited 112 different actions 489 times. Merged at 41 different actions 347 times. Widened at 16 different actions 59 times. Performed 2151 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2151 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 13 different actions. Largest state had 393 variables. [2019-10-03 03:08:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:31,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:08:31,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:31,090 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:08:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:31,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:08:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:31,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-03 03:08:31,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:08:31,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:32,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:08:32,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:08:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 03:08:34,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:08:34,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 31 [2019-10-03 03:08:34,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:08:34,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-03 03:08:34,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-03 03:08:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-10-03 03:08:34,860 INFO L87 Difference]: Start difference. First operand 184386 states and 211492 transitions. Second operand 25 states. [2019-10-03 03:08:35,219 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-10-03 03:08:35,560 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-10-03 03:08:36,865 WARN L191 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-10-03 03:08:37,390 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-03 03:08:37,642 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-03 03:08:38,692 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-03 03:08:38,963 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-10-03 03:08:39,946 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-10-03 03:08:40,969 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-10-03 03:08:41,164 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:08:41,825 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-10-03 03:08:42,465 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-10-03 03:08:43,205 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-10-03 03:08:43,902 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2019-10-03 03:08:44,691 WARN L191 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2019-10-03 03:08:45,609 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-03 03:08:46,386 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-03 03:08:46,841 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-03 03:08:47,339 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:08:47,679 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-10-03 03:08:48,402 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-03 03:08:48,847 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-10-03 03:08:49,505 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-03 03:08:50,507 WARN L191 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-10-03 03:08:50,947 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-03 03:08:51,459 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-03 03:08:51,866 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-10-03 03:08:52,245 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-10-03 03:08:52,635 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-03 03:08:53,005 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-10-03 03:08:53,964 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:08:54,521 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-10-03 03:08:55,095 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-10-03 03:08:55,552 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-03 03:08:55,918 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:08:56,773 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-03 03:08:57,506 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-10-03 03:08:57,838 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:08:58,426 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-10-03 03:08:58,893 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-10-03 03:08:59,307 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-03 03:08:59,760 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:09:00,537 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-10-03 03:09:01,454 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-10-03 03:09:02,123 WARN L191 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-10-03 03:09:02,613 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2019-10-03 03:09:04,533 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-10-03 03:09:04,954 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-10-03 03:09:05,971 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-10-03 03:09:06,492 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:09:06,697 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-10-03 03:09:08,214 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-10-03 03:09:08,807 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-10-03 03:09:09,323 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-10-03 03:09:09,757 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-10-03 03:09:10,293 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-10-03 03:09:12,840 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-10-03 03:09:13,398 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-03 03:09:14,042 WARN L191 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-10-03 03:09:14,591 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-10-03 03:09:15,132 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-10-03 03:09:15,389 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-03 03:09:16,777 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-10-03 03:09:17,217 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-10-03 03:09:17,788 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2019-10-03 03:09:18,392 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-10-03 03:09:18,939 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-10-03 03:09:19,552 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-10-03 03:09:19,978 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-10-03 03:09:20,908 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-10-03 03:09:21,814 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-10-03 03:09:22,836 WARN L191 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:09:23,194 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-10-03 03:09:24,650 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-10-03 03:09:25,121 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-10-03 03:09:25,582 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-10-03 03:09:25,975 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-10-03 03:09:26,359 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-03 03:09:27,120 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-10-03 03:09:27,462 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-10-03 03:09:27,809 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-03 03:09:28,106 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-03 03:09:28,561 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-10-03 03:09:28,937 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-10-03 03:09:29,299 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-10-03 03:09:29,660 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-10-03 03:09:30,095 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-03 03:09:30,522 WARN L191 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-10-03 03:09:30,843 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-03 03:09:31,172 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-10-03 03:09:31,421 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-10-03 03:09:32,081 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:09:32,534 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-10-03 03:09:33,083 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-03 03:09:33,781 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-03 03:09:34,205 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-03 03:09:34,478 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-10-03 03:09:34,829 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-03 03:09:35,239 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-03 03:09:35,607 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-03 03:09:37,876 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-03 03:09:38,136 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:09:38,434 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-03 03:09:38,784 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-03 03:09:39,071 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-10-03 03:09:39,505 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-03 03:09:39,758 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-03 03:09:40,275 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-03 03:09:40,533 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-03 03:09:40,880 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-10-03 03:09:41,274 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-03 03:09:41,973 WARN L191 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-10-03 03:09:42,575 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-03 03:09:43,149 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-10-03 03:09:43,552 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2019-10-03 03:09:43,985 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-10-03 03:09:44,380 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-10-03 03:09:44,843 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:09:45,257 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2019-10-03 03:09:45,739 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-03 03:09:46,043 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-10-03 03:09:46,494 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-10-03 03:09:46,781 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-03 03:09:47,029 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:09:47,470 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-10-03 03:09:47,858 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-03 03:09:48,249 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-03 03:09:48,583 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-03 03:09:49,021 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-10-03 03:09:49,336 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-03 03:09:49,612 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:09:49,931 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-03 03:09:50,450 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-10-03 03:09:50,914 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-03 03:09:51,417 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-10-03 03:09:51,725 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-03 03:09:52,188 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-10-03 03:09:52,604 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-03 03:09:53,023 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-03 03:09:53,431 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-03 03:09:54,065 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 103 [2019-10-03 03:09:54,409 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-03 03:09:54,811 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-03 03:09:55,196 WARN L191 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-03 03:09:55,625 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-03 03:09:56,144 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-10-03 03:09:56,580 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-10-03 03:09:57,059 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-10-03 03:09:58,184 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-10-03 03:09:58,682 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-03 03:09:59,370 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-10-03 03:09:59,814 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-10-03 03:10:00,253 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-03 03:10:00,682 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-10-03 03:10:01,177 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-10-03 03:10:01,787 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-10-03 03:10:02,219 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-10-03 03:10:02,717 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:10:03,256 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2019-10-03 03:10:03,787 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2019-10-03 03:10:04,362 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-10-03 03:10:04,889 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-10-03 03:10:05,431 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-10-03 03:10:05,966 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-10-03 03:10:06,561 WARN L191 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-10-03 03:10:06,957 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-03 03:10:07,878 WARN L191 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 115 [2019-10-03 03:10:08,258 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-03 03:10:08,631 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-10-03 03:10:09,430 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-10-03 03:10:11,268 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-10-03 03:10:12,120 WARN L191 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 101 [2019-10-03 03:10:12,823 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:10:13,225 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-10-03 03:10:13,641 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-10-03 03:10:14,166 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2019-10-03 03:10:14,640 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-10-03 03:10:17,076 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-10-03 03:10:18,067 WARN L191 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2019-10-03 03:10:18,605 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2019-10-03 03:10:19,268 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-10-03 03:10:21,086 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-10-03 03:10:21,764 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-10-03 03:10:22,252 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-10-03 03:10:22,714 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-10-03 03:10:23,556 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-10-03 03:10:24,019 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-10-03 03:10:24,325 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-10-03 03:10:24,606 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-03 03:10:25,145 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:10:25,509 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:10:25,977 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-03 03:10:26,334 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-10-03 03:10:26,695 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-10-03 03:10:27,087 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-10-03 03:10:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:28,403 INFO L93 Difference]: Finished difference Result 587869 states and 671127 transitions. [2019-10-03 03:10:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-10-03 03:10:28,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 119 [2019-10-03 03:10:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:29,126 INFO L225 Difference]: With dead ends: 587869 [2019-10-03 03:10:29,127 INFO L226 Difference]: Without dead ends: 587869 [2019-10-03 03:10:29,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 207 SyntacticMatches, 17 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20773 ImplicationChecksByTransitivity, 95.5s TimeCoverageRelationStatistics Valid=8088, Invalid=44582, Unknown=0, NotChecked=0, Total=52670 [2019-10-03 03:10:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587869 states. [2019-10-03 03:10:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587869 to 183165. [2019-10-03 03:10:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183165 states. [2019-10-03 03:10:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183165 states to 183165 states and 210113 transitions. [2019-10-03 03:10:38,863 INFO L78 Accepts]: Start accepts. Automaton has 183165 states and 210113 transitions. Word has length 119 [2019-10-03 03:10:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:38,863 INFO L475 AbstractCegarLoop]: Abstraction has 183165 states and 210113 transitions. [2019-10-03 03:10:38,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-03 03:10:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 183165 states and 210113 transitions. [2019-10-03 03:10:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 03:10:38,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:38,867 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:38,867 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:38,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1530202173, now seen corresponding path program 1 times [2019-10-03 03:10:38,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:38,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-03 03:10:39,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:10:39,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:10:39,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:39,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:10:39,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:10:39,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:10:39,029 INFO L87 Difference]: Start difference. First operand 183165 states and 210113 transitions. Second operand 9 states. [2019-10-03 03:10:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:10:40,959 INFO L93 Difference]: Finished difference Result 255857 states and 293167 transitions. [2019-10-03 03:10:40,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:10:40,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-10-03 03:10:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:10:41,235 INFO L225 Difference]: With dead ends: 255857 [2019-10-03 03:10:41,236 INFO L226 Difference]: Without dead ends: 255857 [2019-10-03 03:10:41,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:10:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255857 states. [2019-10-03 03:10:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255857 to 183165. [2019-10-03 03:10:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183165 states. [2019-10-03 03:10:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183165 states to 183165 states and 210112 transitions. [2019-10-03 03:10:47,892 INFO L78 Accepts]: Start accepts. Automaton has 183165 states and 210112 transitions. Word has length 119 [2019-10-03 03:10:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:10:47,892 INFO L475 AbstractCegarLoop]: Abstraction has 183165 states and 210112 transitions. [2019-10-03 03:10:47,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:10:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 183165 states and 210112 transitions. [2019-10-03 03:10:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 03:10:47,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:10:47,897 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:10:47,897 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:10:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2062858735, now seen corresponding path program 1 times [2019-10-03 03:10:47,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:10:47,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:47,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:10:47,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:10:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:48,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:10:48,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:10:48,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-10-03 03:10:48,626 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [121], [166], [169], [170], [172], [175], [178], [199], [201], [203], [253], [259], [288], [291], [294], [297], [302], [305], [308], [311], [314], [317], [335], [341], [689], [692], [695], [699], [702], [730], [732], [735], [738], [741], [749], [753], [3328], [3331], [3334], [3337], [3340], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:10:48,628 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:10:48,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:10:48,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:10:49,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:10:49,044 INFO L272 AbstractInterpreter]: Visited 112 different actions 518 times. Merged at 41 different actions 375 times. Widened at 16 different actions 82 times. Performed 2189 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2189 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 12 different actions. Largest state had 393 variables. [2019-10-03 03:10:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:10:49,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:10:49,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:10:49,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 03:10:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:10:49,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:10:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:10:49,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-03 03:10:49,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:10:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:49,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:50,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:10:50,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:10:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:10:50,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:10:50,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 40 [2019-10-03 03:10:50,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:10:50,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-03 03:10:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-03 03:10:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2019-10-03 03:10:50,796 INFO L87 Difference]: Start difference. First operand 183165 states and 210112 transitions. Second operand 31 states. [2019-10-03 03:10:51,033 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-10-03 03:10:52,014 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-03 03:10:53,432 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-10-03 03:10:54,408 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-03 03:10:55,813 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-03 03:10:56,173 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-03 03:10:56,371 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-03 03:10:56,708 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-03 03:10:57,258 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-03 03:10:57,515 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-10-03 03:10:57,726 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-10-03 03:10:58,086 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-03 03:10:58,549 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:10:58,802 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-10-03 03:10:59,193 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-10-03 03:11:00,716 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-10-03 03:11:01,248 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-03 03:11:01,809 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-10-03 03:11:02,289 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-10-03 03:11:02,930 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-03 03:11:03,893 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-10-03 03:11:04,570 WARN L191 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 87 [2019-10-03 03:11:05,429 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-10-03 03:11:06,103 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-03 03:11:06,636 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-03 03:11:07,044 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-10-03 03:11:07,463 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-03 03:11:07,839 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-10-03 03:11:08,453 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-10-03 03:11:08,941 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-10-03 03:11:09,188 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-03 03:11:09,850 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-10-03 03:11:10,315 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-10-03 03:11:10,758 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-03 03:11:11,035 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-03 03:11:11,239 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-10-03 03:11:11,557 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-10-03 03:11:12,528 WARN L191 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-10-03 03:11:12,823 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-10-03 03:11:13,130 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-10-03 03:11:13,480 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-10-03 03:11:13,809 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-03 03:11:14,991 WARN L191 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-03 03:11:15,294 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-03 03:11:16,328 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-10-03 03:11:16,738 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2019-10-03 03:11:17,071 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-10-03 03:11:17,403 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-10-03 03:11:17,927 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-10-03 03:11:18,216 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-10-03 03:11:18,501 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-10-03 03:11:18,957 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 65 [2019-10-03 03:11:21,328 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-10-03 03:11:21,704 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 83 [2019-10-03 03:11:21,974 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-10-03 03:11:22,355 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 85 [2019-10-03 03:11:22,610 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-10-03 03:11:22,831 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-03 03:11:23,113 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-10-03 03:11:23,292 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-10-03 03:11:23,713 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 89 [2019-10-03 03:11:24,111 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 91 [2019-10-03 03:11:24,347 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-03 03:11:24,554 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-10-03 03:11:24,855 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-10-03 03:11:25,190 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 77 [2019-10-03 03:11:25,396 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-10-03 03:11:25,735 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-10-03 03:11:25,958 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-10-03 03:11:26,286 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-10-03 03:11:26,518 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-10-03 03:11:27,246 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2019-10-03 03:11:29,711 WARN L191 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-10-03 03:11:30,092 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2019-10-03 03:11:30,477 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 80 [2019-10-03 03:11:30,727 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-10-03 03:11:31,150 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2019-10-03 03:11:31,406 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-10-03 03:11:31,636 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-10-03 03:11:31,856 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-10-03 03:11:32,145 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-10-03 03:11:32,747 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 86 [2019-10-03 03:11:33,215 WARN L191 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 95 [2019-10-03 03:11:33,520 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-10-03 03:11:34,155 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-10-03 03:11:34,328 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-10-03 03:11:34,532 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-03 03:11:34,837 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-10-03 03:11:35,078 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-03 03:11:35,311 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-10-03 03:11:35,532 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2019-10-03 03:11:36,949 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-10-03 03:11:38,145 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 39 [2019-10-03 03:11:38,397 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-10-03 03:11:38,599 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-10-03 03:11:39,002 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-03 03:11:39,238 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-10-03 03:11:39,512 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-10-03 03:11:40,125 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-10-03 03:11:40,490 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-10-03 03:11:41,109 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-10-03 03:11:41,334 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-03 03:11:41,663 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-10-03 03:11:41,875 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-10-03 03:11:42,071 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-03 03:11:43,148 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-10-03 03:11:43,486 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-10-03 03:11:43,786 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-10-03 03:11:44,119 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-10-03 03:11:44,313 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-03 03:11:44,607 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-10-03 03:11:44,852 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-10-03 03:11:45,081 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-03 03:11:45,292 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-10-03 03:11:45,540 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-10-03 03:11:45,931 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-10-03 03:11:46,814 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-10-03 03:11:47,134 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-10-03 03:11:47,721 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-10-03 03:11:48,102 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-10-03 03:11:48,381 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-03 03:11:48,957 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-10-03 03:11:49,327 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 75 [2019-10-03 03:11:49,661 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2019-10-03 03:11:49,889 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-10-03 03:11:50,101 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 35 [2019-10-03 03:11:50,568 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-10-03 03:11:50,938 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2019-10-03 03:11:51,400 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-10-03 03:11:51,615 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-03 03:11:54,087 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-10-03 03:11:54,372 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-10-03 03:11:54,557 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-03 03:11:54,980 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-10-03 03:11:55,504 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-10-03 03:11:55,838 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-10-03 03:11:56,185 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-03 03:11:56,558 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-10-03 03:11:56,895 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-10-03 03:11:57,244 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2019-10-03 03:11:57,528 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2019-10-03 03:11:57,774 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-10-03 03:11:57,977 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-03 03:11:58,199 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2019-10-03 03:11:58,584 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-10-03 03:11:58,888 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-10-03 03:11:59,110 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-10-03 03:11:59,362 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-10-03 03:11:59,639 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-10-03 03:11:59,888 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-10-03 03:12:00,182 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-10-03 03:12:00,442 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-10-03 03:12:00,698 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-10-03 03:12:01,063 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:12:01,286 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-10-03 03:12:01,518 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-10-03 03:12:01,827 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-10-03 03:12:02,206 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-03 03:12:02,443 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-10-03 03:12:02,737 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-10-03 03:12:02,959 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-10-03 03:12:03,363 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-10-03 03:12:03,789 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-10-03 03:12:04,112 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-10-03 03:12:04,432 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-10-03 03:12:04,614 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2019-10-03 03:12:04,948 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-10-03 03:12:05,297 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-03 03:12:05,594 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-10-03 03:12:05,862 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-10-03 03:12:06,111 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-10-03 03:12:06,426 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-10-03 03:12:06,676 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-10-03 03:12:06,949 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-10-03 03:12:07,222 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-10-03 03:12:07,467 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-10-03 03:12:07,691 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-10-03 03:12:07,866 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-10-03 03:12:08,055 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-03 03:12:08,413 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-10-03 03:12:09,081 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-10-03 03:12:09,412 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-10-03 03:12:09,738 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-10-03 03:12:10,040 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 66 [2019-10-03 03:12:10,589 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-10-03 03:12:10,784 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-10-03 03:12:10,990 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-10-03 03:12:11,203 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-10-03 03:12:11,391 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-10-03 03:12:11,653 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-10-03 03:12:11,897 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-10-03 03:12:12,174 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-03 03:12:12,425 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-10-03 03:12:12,757 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-10-03 03:12:13,069 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-03 03:12:13,383 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-10-03 03:12:13,699 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-10-03 03:12:13,956 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-03 03:12:14,225 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-03 03:12:14,641 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-10-03 03:12:14,888 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-10-03 03:12:15,089 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-03 03:12:15,276 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-03 03:12:15,520 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-03 03:12:15,888 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2019-10-03 03:12:16,118 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-03 03:12:16,524 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-10-03 03:12:16,759 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-03 03:12:17,019 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-03 03:12:17,283 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-10-03 03:12:17,548 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-03 03:12:17,806 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-03 03:12:18,038 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-10-03 03:12:18,345 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-10-03 03:12:18,570 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-03 03:12:18,891 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-10-03 03:12:19,175 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-03 03:12:19,611 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-10-03 03:12:19,888 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-10-03 03:12:20,147 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-03 03:12:20,355 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-03 03:12:20,792 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-10-03 03:12:21,082 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-10-03 03:12:21,312 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-03 03:12:21,530 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-10-03 03:12:21,783 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-10-03 03:12:22,163 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2019-10-03 03:12:22,546 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-10-03 03:12:22,965 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-10-03 03:12:23,270 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-10-03 03:12:23,646 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-10-03 03:12:23,998 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2019-10-03 03:12:24,272 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-03 03:12:24,575 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-10-03 03:12:24,997 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2019-10-03 03:12:25,655 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-10-03 03:12:26,100 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2019-10-03 03:12:26,366 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:12:26,659 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-10-03 03:12:26,885 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-03 03:12:27,122 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-03 03:12:27,475 WARN L191 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2019-10-03 03:12:27,696 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-10-03 03:12:27,968 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-03 03:12:28,321 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-10-03 03:12:28,627 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-10-03 03:12:28,993 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-10-03 03:12:29,430 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 [2019-10-03 03:12:29,795 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 85 [2019-10-03 03:12:30,181 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2019-10-03 03:12:30,452 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-10-03 03:12:30,892 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-10-03 03:12:31,108 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-03 03:12:31,494 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-10-03 03:12:31,873 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2019-10-03 03:12:32,197 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-10-03 03:12:32,585 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-03 03:12:32,814 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-10-03 03:12:33,110 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-10-03 03:12:33,650 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2019-10-03 03:12:34,060 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-10-03 03:12:34,263 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-10-03 03:12:36,654 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-10-03 03:12:36,861 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-10-03 03:12:37,088 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-10-03 03:12:37,302 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-03 03:12:37,574 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:12:38,015 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-10-03 03:12:38,647 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-10-03 03:12:38,955 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-10-03 03:12:39,467 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-10-03 03:12:40,203 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-10-03 03:12:40,612 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-10-03 03:12:40,817 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-03 03:12:41,361 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-03 03:12:41,989 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-03 03:12:42,639 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-10-03 03:12:42,845 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-10-03 03:12:43,111 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-10-03 03:12:43,346 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-10-03 03:12:43,637 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-10-03 03:12:44,321 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-10-03 03:12:44,736 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-10-03 03:12:45,005 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-10-03 03:12:45,234 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-10-03 03:12:45,451 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-03 03:12:45,935 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-10-03 03:12:46,191 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-10-03 03:12:46,431 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-10-03 03:12:46,904 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-10-03 03:12:47,118 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-03 03:12:47,393 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-10-03 03:12:47,811 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-10-03 03:12:48,252 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-10-03 03:12:48,555 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-10-03 03:12:48,875 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-10-03 03:12:49,213 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-10-03 03:12:49,550 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 80 [2019-10-03 03:12:49,894 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-10-03 03:12:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:12:50,068 INFO L93 Difference]: Finished difference Result 328881 states and 375320 transitions. [2019-10-03 03:12:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 376 states. [2019-10-03 03:12:50,069 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 119 [2019-10-03 03:12:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:12:50,410 INFO L225 Difference]: With dead ends: 328881 [2019-10-03 03:12:50,410 INFO L226 Difference]: Without dead ends: 328881 [2019-10-03 03:12:50,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69325 ImplicationChecksByTransitivity, 99.0s TimeCoverageRelationStatistics Valid=16820, Invalid=153336, Unknown=0, NotChecked=0, Total=170156 [2019-10-03 03:12:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328881 states. [2019-10-03 03:12:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328881 to 197160. [2019-10-03 03:12:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197160 states. [2019-10-03 03:12:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197160 states to 197160 states and 226234 transitions. [2019-10-03 03:12:53,533 INFO L78 Accepts]: Start accepts. Automaton has 197160 states and 226234 transitions. Word has length 119 [2019-10-03 03:12:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:12:53,533 INFO L475 AbstractCegarLoop]: Abstraction has 197160 states and 226234 transitions. [2019-10-03 03:12:53,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-03 03:12:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 197160 states and 226234 transitions. [2019-10-03 03:12:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 03:12:53,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:12:53,537 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:12:53,538 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:12:53,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1505768099, now seen corresponding path program 1 times [2019-10-03 03:12:53,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:12:53,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:53,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:12:53,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:12:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:12:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:12:54,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:12:54,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:12:54,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-10-03 03:12:54,232 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [74], [77], [80], [83], [87], [90], [93], [96], [99], [102], [106], [109], [112], [115], [118], [121], [166], [169], [170], [172], [175], [178], [199], [201], [203], [253], [259], [288], [291], [294], [297], [300], [346], [352], [1626], [1629], [1632], [1635], [1638], [1714], [1720], [2054], [2057], [2060], [2064], [2067], [2071], [2074], [2077], [2080], [2085], [3328], [3331], [3334], [3337], [3342], [3345], [3354], [3356], [3358], [3361], [3364], [3367], [3375], [3377], [3651], [3654], [3657], [3660], [3665], [3668], [3677], [3679], [3681], [3684], [3687], [3697], [3699], [3701], [3704], [3707], [3710], [3718], [3720], [4555], [4556], [4560], [4561], [4562] [2019-10-03 03:12:54,235 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:12:54,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:12:54,290 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:12:54,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:12:54,631 INFO L272 AbstractInterpreter]: Visited 113 different actions 473 times. Merged at 42 different actions 332 times. Widened at 15 different actions 61 times. Performed 2140 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2140 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 10 different actions. Largest state had 394 variables. [2019-10-03 03:12:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:12:54,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:12:54,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:12:54,632 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-10-03 03:12:54,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:12:54,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:12:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:12:55,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 2086 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-03 03:12:55,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:12:55,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:55,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:55,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:56,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:56,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:12:56,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:12:57,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:57,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:57,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:57,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:57,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:58,021 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-03 03:12:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-03 03:12:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:12:58,442 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-03 03:13:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:13:02,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:13:02,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 15] total 46 [2019-10-03 03:13:02,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:13:02,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-03 03:13:02,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-03 03:13:02,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1912, Unknown=0, NotChecked=0, Total=2070 [2019-10-03 03:13:02,180 INFO L87 Difference]: Start difference. First operand 197160 states and 226234 transitions. Second operand 34 states. [2019-10-03 03:13:02,539 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-10-03 03:13:04,315 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-10-03 03:13:04,653 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-03 03:13:05,007 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-03 03:13:05,542 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-10-03 03:13:06,566 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52