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.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:32:00,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:32:00,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:32:00,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:32:00,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:32:00,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:32:00,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:32:00,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:32:00,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:32:00,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:32:00,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:32:00,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:32:00,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:32:00,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:32:00,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:32:00,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:32:00,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:32:00,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:32:00,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:32:00,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:32:00,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:32:00,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:32:00,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:32:00,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:32:00,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:32:00,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:32:00,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:32:00,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:32:00,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:32:00,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:32:00,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:32:00,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:32:00,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:32:00,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:32:00,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:32:00,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:32:00,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:32:00,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:32:00,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:32:00,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:32:00,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:32:00,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:32:00,630 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:32:00,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:32:00,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:32:00,633 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:32:00,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:32:00,634 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:32:00,634 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:32:00,634 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:32:00,634 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:32:00,634 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:32:00,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:32:00,636 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:32:00,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:32:00,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:32:00,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:32:00,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:32:00,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:32:00,637 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:32:00,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:32:00,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:32:00,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:32:00,638 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:32:00,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:32:00,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:32:00,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:32:00,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:32:00,639 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:32:00,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:32:00,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:32:00,640 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:32:00,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:32:00,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:32:00,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:32:00,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:32:00,696 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:32:00,697 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2019-09-10 08:32:00,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36338e298/0514e70f198143659028406e6e1a6431/FLAG431d8f772 [2019-09-10 08:32:01,315 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:32:01,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2019-09-10 08:32:01,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36338e298/0514e70f198143659028406e6e1a6431/FLAG431d8f772 [2019-09-10 08:32:01,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36338e298/0514e70f198143659028406e6e1a6431 [2019-09-10 08:32:01,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:32:01,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:32:01,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:01,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:32:01,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:32:01,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:01" (1/1) ... [2019-09-10 08:32:01,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10822750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:01, skipping insertion in model container [2019-09-10 08:32:01,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:01" (1/1) ... [2019-09-10 08:32:01,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:32:01,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:32:02,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:02,109 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:32:02,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:02,264 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:32:02,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02 WrapperNode [2019-09-10 08:32:02,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:02,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:32:02,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:32:02,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:32:02,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... [2019-09-10 08:32:02,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... [2019-09-10 08:32:02,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... [2019-09-10 08:32:02,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... [2019-09-10 08:32:02,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... [2019-09-10 08:32:02,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... [2019-09-10 08:32:02,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... [2019-09-10 08:32:02,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:32:02,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:32:02,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:32:02,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:32:02,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:32:02,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:32:02,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:32:02,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:32:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:32:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:32:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:32:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:32:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:32:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:32:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:32:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:32:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:32:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:32:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:32:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:32:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:32:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:32:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 08:32:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:32:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:32:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:32:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:32:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:32:03,445 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:32:03,446 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:32:03,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:03 BoogieIcfgContainer [2019-09-10 08:32:03,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:32:03,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:32:03,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:32:03,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:32:03,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:32:01" (1/3) ... [2019-09-10 08:32:03,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536e409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:03, skipping insertion in model container [2019-09-10 08:32:03,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:02" (2/3) ... [2019-09-10 08:32:03,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5536e409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:03, skipping insertion in model container [2019-09-10 08:32:03,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:03" (3/3) ... [2019-09-10 08:32:03,457 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+cfa-reducer.c [2019-09-10 08:32:03,467 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:32:03,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:32:03,493 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:32:03,518 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:32:03,518 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:32:03,518 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:32:03,518 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:32:03,518 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:32:03,519 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:32:03,519 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:32:03,519 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:32:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-09-10 08:32:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:32:03,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:03,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:03,560 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:03,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1007404612, now seen corresponding path program 1 times [2019-09-10 08:32:03,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:03,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:03,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:03,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:04,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-09-10 08:32:04,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:04,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:04,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:04,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:04,183 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2019-09-10 08:32:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:04,296 INFO L93 Difference]: Finished difference Result 248 states and 410 transitions. [2019-09-10 08:32:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:04,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 08:32:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:04,323 INFO L225 Difference]: With dead ends: 248 [2019-09-10 08:32:04,323 INFO L226 Difference]: Without dead ends: 240 [2019-09-10 08:32:04,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-10 08:32:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2019-09-10 08:32:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-10 08:32:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 339 transitions. [2019-09-10 08:32:04,435 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 339 transitions. Word has length 105 [2019-09-10 08:32:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:04,436 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 339 transitions. [2019-09-10 08:32:04,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 339 transitions. [2019-09-10 08:32:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:32:04,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:04,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:04,441 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1646548338, now seen corresponding path program 1 times [2019-09-10 08:32:04,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:04,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:04,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:04,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:04,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:04,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:04,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:04,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:04,740 INFO L87 Difference]: Start difference. First operand 238 states and 339 transitions. Second operand 3 states. [2019-09-10 08:32:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:04,785 INFO L93 Difference]: Finished difference Result 392 states and 582 transitions. [2019-09-10 08:32:04,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:04,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:32:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:04,792 INFO L225 Difference]: With dead ends: 392 [2019-09-10 08:32:04,792 INFO L226 Difference]: Without dead ends: 392 [2019-09-10 08:32:04,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-10 08:32:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2019-09-10 08:32:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-10 08:32:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 581 transitions. [2019-09-10 08:32:04,818 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 581 transitions. Word has length 106 [2019-09-10 08:32:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:04,818 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 581 transitions. [2019-09-10 08:32:04,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 581 transitions. [2019-09-10 08:32:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:32:04,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:04,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:04,821 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash -728502827, now seen corresponding path program 1 times [2019-09-10 08:32:04,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:04,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:04,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:04,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:04,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:04,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:04,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:05,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,003 INFO L87 Difference]: Start difference. First operand 390 states and 581 transitions. Second operand 3 states. [2019-09-10 08:32:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:05,047 INFO L93 Difference]: Finished difference Result 680 states and 1038 transitions. [2019-09-10 08:32:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:05,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:32:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:05,060 INFO L225 Difference]: With dead ends: 680 [2019-09-10 08:32:05,061 INFO L226 Difference]: Without dead ends: 680 [2019-09-10 08:32:05,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-10 08:32:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 678. [2019-09-10 08:32:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-10 08:32:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1037 transitions. [2019-09-10 08:32:05,123 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1037 transitions. Word has length 107 [2019-09-10 08:32:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:05,124 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 1037 transitions. [2019-09-10 08:32:05,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1037 transitions. [2019-09-10 08:32:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:32:05,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:05,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:05,127 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1065402348, now seen corresponding path program 1 times [2019-09-10 08:32:05,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:05,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:05,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:05,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:05,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:05,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:05,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:05,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,265 INFO L87 Difference]: Start difference. First operand 678 states and 1037 transitions. Second operand 3 states. [2019-09-10 08:32:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:05,298 INFO L93 Difference]: Finished difference Result 1224 states and 1894 transitions. [2019-09-10 08:32:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:05,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 08:32:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:05,310 INFO L225 Difference]: With dead ends: 1224 [2019-09-10 08:32:05,311 INFO L226 Difference]: Without dead ends: 1224 [2019-09-10 08:32:05,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-10 08:32:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1222. [2019-09-10 08:32:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-09-10 08:32:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1893 transitions. [2019-09-10 08:32:05,344 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1893 transitions. Word has length 108 [2019-09-10 08:32:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:05,347 INFO L475 AbstractCegarLoop]: Abstraction has 1222 states and 1893 transitions. [2019-09-10 08:32:05,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1893 transitions. [2019-09-10 08:32:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:32:05,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:05,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:05,357 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:05,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1123656391, now seen corresponding path program 1 times [2019-09-10 08:32:05,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:05,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:05,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:05,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:05,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:05,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,471 INFO L87 Difference]: Start difference. First operand 1222 states and 1893 transitions. Second operand 3 states. [2019-09-10 08:32:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:05,506 INFO L93 Difference]: Finished difference Result 2248 states and 3494 transitions. [2019-09-10 08:32:05,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:05,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:32:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:05,520 INFO L225 Difference]: With dead ends: 2248 [2019-09-10 08:32:05,520 INFO L226 Difference]: Without dead ends: 2248 [2019-09-10 08:32:05,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-09-10 08:32:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2019-09-10 08:32:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-09-10 08:32:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3493 transitions. [2019-09-10 08:32:05,577 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3493 transitions. Word has length 109 [2019-09-10 08:32:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:05,577 INFO L475 AbstractCegarLoop]: Abstraction has 2246 states and 3493 transitions. [2019-09-10 08:32:05,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3493 transitions. [2019-09-10 08:32:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:32:05,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:05,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:05,580 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash 392577038, now seen corresponding path program 1 times [2019-09-10 08:32:05,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:05,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:05,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:05,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:05,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,772 INFO L87 Difference]: Start difference. First operand 2246 states and 3493 transitions. Second operand 3 states. [2019-09-10 08:32:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:05,824 INFO L93 Difference]: Finished difference Result 4168 states and 6470 transitions. [2019-09-10 08:32:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:05,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 08:32:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:05,850 INFO L225 Difference]: With dead ends: 4168 [2019-09-10 08:32:05,850 INFO L226 Difference]: Without dead ends: 4168 [2019-09-10 08:32:05,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2019-09-10 08:32:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4166. [2019-09-10 08:32:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2019-09-10 08:32:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 6469 transitions. [2019-09-10 08:32:05,977 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 6469 transitions. Word has length 110 [2019-09-10 08:32:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:05,981 INFO L475 AbstractCegarLoop]: Abstraction has 4166 states and 6469 transitions. [2019-09-10 08:32:05,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 6469 transitions. [2019-09-10 08:32:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:32:05,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:05,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:05,987 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:05,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1201015413, now seen corresponding path program 1 times [2019-09-10 08:32:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:05,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:05,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:05,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:06,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:06,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:06,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:06,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:06,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:06,090 INFO L87 Difference]: Start difference. First operand 4166 states and 6469 transitions. Second operand 3 states. [2019-09-10 08:32:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:06,166 INFO L93 Difference]: Finished difference Result 7752 states and 11974 transitions. [2019-09-10 08:32:06,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:06,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:32:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:06,212 INFO L225 Difference]: With dead ends: 7752 [2019-09-10 08:32:06,212 INFO L226 Difference]: Without dead ends: 7752 [2019-09-10 08:32:06,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2019-09-10 08:32:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7750. [2019-09-10 08:32:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7750 states. [2019-09-10 08:32:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7750 states to 7750 states and 11973 transitions. [2019-09-10 08:32:06,460 INFO L78 Accepts]: Start accepts. Automaton has 7750 states and 11973 transitions. Word has length 111 [2019-09-10 08:32:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:06,460 INFO L475 AbstractCegarLoop]: Abstraction has 7750 states and 11973 transitions. [2019-09-10 08:32:06,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 7750 states and 11973 transitions. [2019-09-10 08:32:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:32:06,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:06,462 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:06,462 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash 359653627, now seen corresponding path program 1 times [2019-09-10 08:32:06,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:06,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:06,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:06,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:06,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:06,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:06,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:06,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:06,572 INFO L87 Difference]: Start difference. First operand 7750 states and 11973 transitions. Second operand 3 states. [2019-09-10 08:32:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:06,699 INFO L93 Difference]: Finished difference Result 14408 states and 22086 transitions. [2019-09-10 08:32:06,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:06,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 08:32:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:06,805 INFO L225 Difference]: With dead ends: 14408 [2019-09-10 08:32:06,806 INFO L226 Difference]: Without dead ends: 14408 [2019-09-10 08:32:06,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14408 states. [2019-09-10 08:32:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14408 to 14406. [2019-09-10 08:32:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14406 states. [2019-09-10 08:32:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14406 states to 14406 states and 22085 transitions. [2019-09-10 08:32:07,292 INFO L78 Accepts]: Start accepts. Automaton has 14406 states and 22085 transitions. Word has length 112 [2019-09-10 08:32:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:07,293 INFO L475 AbstractCegarLoop]: Abstraction has 14406 states and 22085 transitions. [2019-09-10 08:32:07,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14406 states and 22085 transitions. [2019-09-10 08:32:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:07,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:07,296 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:07,296 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2063482190, now seen corresponding path program 1 times [2019-09-10 08:32:07,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:07,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:07,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:07,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:07,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:07,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:07,650 INFO L87 Difference]: Start difference. First operand 14406 states and 22085 transitions. Second operand 5 states. [2019-09-10 08:32:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:08,133 INFO L93 Difference]: Finished difference Result 28744 states and 43974 transitions. [2019-09-10 08:32:08,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:08,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:08,220 INFO L225 Difference]: With dead ends: 28744 [2019-09-10 08:32:08,220 INFO L226 Difference]: Without dead ends: 28744 [2019-09-10 08:32:08,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28744 states. [2019-09-10 08:32:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28744 to 28742. [2019-09-10 08:32:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-10 08:32:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43973 transitions. [2019-09-10 08:32:09,312 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43973 transitions. Word has length 113 [2019-09-10 08:32:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:09,313 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43973 transitions. [2019-09-10 08:32:09,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43973 transitions. [2019-09-10 08:32:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:09,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:09,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:09,315 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1959738441, now seen corresponding path program 1 times [2019-09-10 08:32:09,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:09,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:09,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:09,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:09,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:09,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:09,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:09,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:09,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:09,469 INFO L87 Difference]: Start difference. First operand 28742 states and 43973 transitions. Second operand 5 states. [2019-09-10 08:32:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:09,716 INFO L93 Difference]: Finished difference Result 28742 states and 43717 transitions. [2019-09-10 08:32:09,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:09,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:09,782 INFO L225 Difference]: With dead ends: 28742 [2019-09-10 08:32:09,782 INFO L226 Difference]: Without dead ends: 28742 [2019-09-10 08:32:09,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-10 08:32:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-10 08:32:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-10 08:32:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43717 transitions. [2019-09-10 08:32:10,396 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43717 transitions. Word has length 113 [2019-09-10 08:32:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:10,397 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43717 transitions. [2019-09-10 08:32:10,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43717 transitions. [2019-09-10 08:32:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:10,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:10,399 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:10,399 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1061360850, now seen corresponding path program 1 times [2019-09-10 08:32:10,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:10,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:10,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:10,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:10,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:10,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:10,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:10,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:10,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:10,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:10,512 INFO L87 Difference]: Start difference. First operand 28742 states and 43717 transitions. Second operand 5 states. [2019-09-10 08:32:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:10,758 INFO L93 Difference]: Finished difference Result 28742 states and 43461 transitions. [2019-09-10 08:32:10,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:10,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:10,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:10,822 INFO L225 Difference]: With dead ends: 28742 [2019-09-10 08:32:10,822 INFO L226 Difference]: Without dead ends: 28742 [2019-09-10 08:32:10,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-10 08:32:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-10 08:32:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-10 08:32:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43461 transitions. [2019-09-10 08:32:11,948 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43461 transitions. Word has length 113 [2019-09-10 08:32:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:11,949 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43461 transitions. [2019-09-10 08:32:11,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43461 transitions. [2019-09-10 08:32:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:11,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:11,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:11,951 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 474037075, now seen corresponding path program 1 times [2019-09-10 08:32:11,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:11,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:11,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:11,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:11,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:12,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:12,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:12,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:12,085 INFO L87 Difference]: Start difference. First operand 28742 states and 43461 transitions. Second operand 5 states. [2019-09-10 08:32:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:12,322 INFO L93 Difference]: Finished difference Result 28742 states and 43205 transitions. [2019-09-10 08:32:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:12,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:12,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:12,378 INFO L225 Difference]: With dead ends: 28742 [2019-09-10 08:32:12,378 INFO L226 Difference]: Without dead ends: 28742 [2019-09-10 08:32:12,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-10 08:32:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-10 08:32:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-10 08:32:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 43205 transitions. [2019-09-10 08:32:12,979 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 43205 transitions. Word has length 113 [2019-09-10 08:32:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:12,979 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 43205 transitions. [2019-09-10 08:32:12,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 43205 transitions. [2019-09-10 08:32:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:12,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:12,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:12,981 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1367993458, now seen corresponding path program 1 times [2019-09-10 08:32:12,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:12,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:12,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:12,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:12,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:13,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:13,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:13,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:13,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:13,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:13,131 INFO L87 Difference]: Start difference. First operand 28742 states and 43205 transitions. Second operand 5 states. [2019-09-10 08:32:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:13,340 INFO L93 Difference]: Finished difference Result 28742 states and 42949 transitions. [2019-09-10 08:32:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:13,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:13,392 INFO L225 Difference]: With dead ends: 28742 [2019-09-10 08:32:13,392 INFO L226 Difference]: Without dead ends: 28742 [2019-09-10 08:32:13,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-10 08:32:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-10 08:32:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-10 08:32:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 42949 transitions. [2019-09-10 08:32:14,042 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 42949 transitions. Word has length 113 [2019-09-10 08:32:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:14,043 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 42949 transitions. [2019-09-10 08:32:14,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 42949 transitions. [2019-09-10 08:32:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:14,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:14,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:14,045 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:14,045 INFO L82 PathProgramCache]: Analyzing trace with hash -40608269, now seen corresponding path program 1 times [2019-09-10 08:32:14,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:14,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:14,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:14,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:14,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:14,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:14,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:14,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:14,161 INFO L87 Difference]: Start difference. First operand 28742 states and 42949 transitions. Second operand 5 states. [2019-09-10 08:32:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:14,364 INFO L93 Difference]: Finished difference Result 28742 states and 42693 transitions. [2019-09-10 08:32:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:14,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:14,399 INFO L225 Difference]: With dead ends: 28742 [2019-09-10 08:32:14,399 INFO L226 Difference]: Without dead ends: 28742 [2019-09-10 08:32:14,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28742 states. [2019-09-10 08:32:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28742 to 28742. [2019-09-10 08:32:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28742 states. [2019-09-10 08:32:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28742 states to 28742 states and 42693 transitions. [2019-09-10 08:32:14,766 INFO L78 Accepts]: Start accepts. Automaton has 28742 states and 42693 transitions. Word has length 113 [2019-09-10 08:32:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:14,767 INFO L475 AbstractCegarLoop]: Abstraction has 28742 states and 42693 transitions. [2019-09-10 08:32:14,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 28742 states and 42693 transitions. [2019-09-10 08:32:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:14,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:14,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:14,769 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:14,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1487637864, now seen corresponding path program 1 times [2019-09-10 08:32:14,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:14,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:14,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:14,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:15,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:15,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:15,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:15,033 INFO L87 Difference]: Start difference. First operand 28742 states and 42693 transitions. Second operand 10 states. [2019-09-10 08:32:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:17,219 INFO L93 Difference]: Finished difference Result 401504 states and 590674 transitions. [2019-09-10 08:32:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:17,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 08:32:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:18,569 INFO L225 Difference]: With dead ends: 401504 [2019-09-10 08:32:18,570 INFO L226 Difference]: Without dead ends: 401504 [2019-09-10 08:32:18,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401504 states. [2019-09-10 08:32:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401504 to 86086. [2019-09-10 08:32:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86086 states. [2019-09-10 08:32:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86086 states to 86086 states and 126917 transitions. [2019-09-10 08:32:23,474 INFO L78 Accepts]: Start accepts. Automaton has 86086 states and 126917 transitions. Word has length 113 [2019-09-10 08:32:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:23,474 INFO L475 AbstractCegarLoop]: Abstraction has 86086 states and 126917 transitions. [2019-09-10 08:32:23,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 86086 states and 126917 transitions. [2019-09-10 08:32:23,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:32:23,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:23,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:23,476 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:23,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:23,476 INFO L82 PathProgramCache]: Analyzing trace with hash -269016110, now seen corresponding path program 1 times [2019-09-10 08:32:23,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:23,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:23,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:23,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:23,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:23,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:23,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:23,925 INFO L87 Difference]: Start difference. First operand 86086 states and 126917 transitions. Second operand 10 states. [2019-09-10 08:32:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:24,542 INFO L93 Difference]: Finished difference Result 114764 states and 169032 transitions. [2019-09-10 08:32:24,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:32:24,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-09-10 08:32:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:24,694 INFO L225 Difference]: With dead ends: 114764 [2019-09-10 08:32:24,695 INFO L226 Difference]: Without dead ends: 114764 [2019-09-10 08:32:24,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:32:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114764 states. [2019-09-10 08:32:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114764 to 86086. [2019-09-10 08:32:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86086 states. [2019-09-10 08:32:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86086 states to 86086 states and 126405 transitions. [2019-09-10 08:32:27,389 INFO L78 Accepts]: Start accepts. Automaton has 86086 states and 126405 transitions. Word has length 115 [2019-09-10 08:32:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:27,389 INFO L475 AbstractCegarLoop]: Abstraction has 86086 states and 126405 transitions. [2019-09-10 08:32:27,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 86086 states and 126405 transitions. [2019-09-10 08:32:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:32:27,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:27,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:27,391 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash -289065453, now seen corresponding path program 1 times [2019-09-10 08:32:27,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:27,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:27,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:27,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:27,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:27,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:27,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:27,490 INFO L87 Difference]: Start difference. First operand 86086 states and 126405 transitions. Second operand 3 states. [2019-09-10 08:32:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:27,829 INFO L93 Difference]: Finished difference Result 107082 states and 156168 transitions. [2019-09-10 08:32:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:27,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 08:32:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:28,008 INFO L225 Difference]: With dead ends: 107082 [2019-09-10 08:32:28,008 INFO L226 Difference]: Without dead ends: 107082 [2019-09-10 08:32:28,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107082 states. [2019-09-10 08:32:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107082 to 107080. [2019-09-10 08:32:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107080 states. [2019-09-10 08:32:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107080 states to 107080 states and 156167 transitions. [2019-09-10 08:32:29,691 INFO L78 Accepts]: Start accepts. Automaton has 107080 states and 156167 transitions. Word has length 115 [2019-09-10 08:32:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:29,691 INFO L475 AbstractCegarLoop]: Abstraction has 107080 states and 156167 transitions. [2019-09-10 08:32:29,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:29,691 INFO L276 IsEmpty]: Start isEmpty. Operand 107080 states and 156167 transitions. [2019-09-10 08:32:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:32:29,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:29,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:29,692 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash 248525954, now seen corresponding path program 1 times [2019-09-10 08:32:29,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:29,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:29,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:29,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:29,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:29,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:29,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:29,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:29,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:29,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:29,793 INFO L87 Difference]: Start difference. First operand 107080 states and 156167 transitions. Second operand 5 states. [2019-09-10 08:32:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:30,301 INFO L93 Difference]: Finished difference Result 207622 states and 299845 transitions. [2019-09-10 08:32:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:32:30,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-10 08:32:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:30,503 INFO L225 Difference]: With dead ends: 207622 [2019-09-10 08:32:30,503 INFO L226 Difference]: Without dead ends: 207622 [2019-09-10 08:32:30,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:32:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207622 states. [2019-09-10 08:32:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207622 to 110408. [2019-09-10 08:32:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110408 states. [2019-09-10 08:32:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110408 states to 110408 states and 159367 transitions. [2019-09-10 08:32:34,761 INFO L78 Accepts]: Start accepts. Automaton has 110408 states and 159367 transitions. Word has length 116 [2019-09-10 08:32:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:34,762 INFO L475 AbstractCegarLoop]: Abstraction has 110408 states and 159367 transitions. [2019-09-10 08:32:34,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 110408 states and 159367 transitions. [2019-09-10 08:32:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:32:34,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:34,792 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:34,792 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash -144594369, now seen corresponding path program 1 times [2019-09-10 08:32:34,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:34,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:34,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:34,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:34,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:32:34,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:32:34,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:32:34,956 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [190], [193], [201], [203], [206], [209], [214], [216], [219], [227], [229], [232], [240], [242], [245], [253], [255], [258], [266], [268], [271], [279], [281], [284], [292], [294], [297], [304], [306], [309], [310], [312], [321], [324], [328], [337], [339], [342], [345], [347], [362], [364], [367], [370], [372], [387], [389], [392], [395], [397], [412], [414], [417], [420], [422], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [480], [483], [489], [492], [495], [497], [512], [514], [517], [520], [522], [594], [595], [599], [600], [601] [2019-09-10 08:32:35,006 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:32:35,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:32:35,177 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:32:36,683 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:32:36,686 INFO L272 AbstractInterpreter]: Visited 144 different actions 1460 times. Merged at 76 different actions 1139 times. Widened at 32 different actions 207 times. Performed 5369 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5369 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 155 fixpoints after 27 different actions. Largest state had 200 variables. [2019-09-10 08:32:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:36,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:32:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:32:36,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:32:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:36,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:32:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:36,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:32:36,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:32:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:32:37,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:32:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:32:37,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:32:37,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:32:37,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:37,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:32:37,365 INFO L87 Difference]: Start difference. First operand 110408 states and 159367 transitions. Second operand 10 states. [2019-09-10 08:32:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:42,061 INFO L93 Difference]: Finished difference Result 765528 states and 1104591 transitions. [2019-09-10 08:32:42,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:32:42,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:32:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:43,430 INFO L225 Difference]: With dead ends: 765528 [2019-09-10 08:32:43,430 INFO L226 Difference]: Without dead ends: 765528 [2019-09-10 08:32:43,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:32:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765528 states. [2019-09-10 08:32:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765528 to 184136. [2019-09-10 08:32:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184136 states. [2019-09-10 08:32:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184136 states to 184136 states and 264455 transitions. [2019-09-10 08:32:51,036 INFO L78 Accepts]: Start accepts. Automaton has 184136 states and 264455 transitions. Word has length 154 [2019-09-10 08:32:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:51,037 INFO L475 AbstractCegarLoop]: Abstraction has 184136 states and 264455 transitions. [2019-09-10 08:32:51,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 184136 states and 264455 transitions. [2019-09-10 08:32:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:32:51,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:51,091 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:51,092 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1701435269, now seen corresponding path program 1 times [2019-09-10 08:32:51,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:51,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:32:51,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:51,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:51,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:51,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:51,402 INFO L87 Difference]: Start difference. First operand 184136 states and 264455 transitions. Second operand 10 states. [2019-09-10 08:32:52,330 WARN L188 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-09-10 08:32:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:53,733 INFO L93 Difference]: Finished difference Result 580568 states and 834191 transitions. [2019-09-10 08:32:53,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:32:53,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:32:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:54,531 INFO L225 Difference]: With dead ends: 580568 [2019-09-10 08:32:54,531 INFO L226 Difference]: Without dead ends: 580568 [2019-09-10 08:32:54,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:32:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580568 states. [2019-09-10 08:33:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580568 to 257480. [2019-09-10 08:33:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257480 states. [2019-09-10 08:33:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257480 states to 257480 states and 369159 transitions. [2019-09-10 08:33:03,800 INFO L78 Accepts]: Start accepts. Automaton has 257480 states and 369159 transitions. Word has length 154 [2019-09-10 08:33:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:03,801 INFO L475 AbstractCegarLoop]: Abstraction has 257480 states and 369159 transitions. [2019-09-10 08:33:03,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 257480 states and 369159 transitions. [2019-09-10 08:33:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:33:03,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:03,834 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:03,835 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1475196783, now seen corresponding path program 1 times [2019-09-10 08:33:03,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:03,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:03,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:03,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:03,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:33:03,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:33:03,993 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [190], [193], [201], [203], [206], [214], [216], [219], [227], [229], [232], [240], [242], [245], [248], [253], [255], [258], [266], [268], [271], [279], [281], [284], [292], [294], [297], [304], [306], [309], [310], [312], [321], [324], [328], [337], [339], [342], [345], [347], [362], [364], [367], [370], [372], [387], [389], [392], [395], [397], [405], [408], [414], [417], [420], [422], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [487], [489], [492], [495], [497], [512], [514], [517], [520], [522], [594], [595], [599], [600], [601] [2019-09-10 08:33:03,998 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:33:03,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:33:04,067 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:33:05,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:33:05,311 INFO L272 AbstractInterpreter]: Visited 144 different actions 1510 times. Merged at 76 different actions 1182 times. Widened at 34 different actions 208 times. Performed 5565 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5565 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 164 fixpoints after 32 different actions. Largest state had 200 variables. [2019-09-10 08:33:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:05,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:33:05,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:05,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:33:05,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:05,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:33:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:05,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:33:05,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:33:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:33:05,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:33:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:33:05,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:33:05,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:33:05,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:05,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:05,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:05,999 INFO L87 Difference]: Start difference. First operand 257480 states and 369159 transitions. Second operand 10 states. [2019-09-10 08:33:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:08,183 INFO L93 Difference]: Finished difference Result 653912 states and 938895 transitions. [2019-09-10 08:33:08,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:08,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:33:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:09,038 INFO L225 Difference]: With dead ends: 653912 [2019-09-10 08:33:09,038 INFO L226 Difference]: Without dead ends: 653912 [2019-09-10 08:33:09,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653912 states. [2019-09-10 08:33:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653912 to 330824. [2019-09-10 08:33:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330824 states. [2019-09-10 08:33:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330824 states to 330824 states and 473863 transitions. [2019-09-10 08:33:22,290 INFO L78 Accepts]: Start accepts. Automaton has 330824 states and 473863 transitions. Word has length 154 [2019-09-10 08:33:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:22,290 INFO L475 AbstractCegarLoop]: Abstraction has 330824 states and 473863 transitions. [2019-09-10 08:33:22,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 330824 states and 473863 transitions. [2019-09-10 08:33:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:33:22,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:22,319 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:22,319 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash 809686941, now seen corresponding path program 1 times [2019-09-10 08:33:22,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:22,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:22,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:22,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:22,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:22,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:22,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:33:22,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:33:22,449 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [190], [193], [201], [203], [206], [214], [216], [219], [227], [229], [232], [240], [242], [245], [253], [255], [258], [266], [268], [271], [274], [279], [281], [284], [292], [294], [297], [304], [306], [309], [310], [312], [321], [324], [328], [337], [339], [342], [345], [347], [355], [358], [364], [367], [370], [372], [387], [389], [392], [395], [397], [412], [414], [417], [420], [422], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [487], [489], [492], [495], [497], [512], [514], [517], [520], [522], [594], [595], [599], [600], [601] [2019-09-10 08:33:22,456 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:33:22,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:33:22,498 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:33:23,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:33:23,540 INFO L272 AbstractInterpreter]: Visited 144 different actions 1415 times. Merged at 76 different actions 1100 times. Widened at 33 different actions 198 times. Performed 5466 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5466 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 146 fixpoints after 27 different actions. Largest state had 200 variables. [2019-09-10 08:33:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:23,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:33:23,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:23,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:33:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:23,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:33:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:23,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:33:23,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:33:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:33:23,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:33:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:33:24,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:33:24,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:33:24,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:24,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:24,162 INFO L87 Difference]: Start difference. First operand 330824 states and 473863 transitions. Second operand 10 states. [2019-09-10 08:33:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:29,712 INFO L93 Difference]: Finished difference Result 727256 states and 1043599 transitions. [2019-09-10 08:33:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:29,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:33:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:30,570 INFO L225 Difference]: With dead ends: 727256 [2019-09-10 08:33:30,570 INFO L226 Difference]: Without dead ends: 727256 [2019-09-10 08:33:30,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727256 states. [2019-09-10 08:33:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727256 to 404168. [2019-09-10 08:33:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404168 states. [2019-09-10 08:33:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404168 states to 404168 states and 578567 transitions. [2019-09-10 08:33:41,965 INFO L78 Accepts]: Start accepts. Automaton has 404168 states and 578567 transitions. Word has length 154 [2019-09-10 08:33:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:41,965 INFO L475 AbstractCegarLoop]: Abstraction has 404168 states and 578567 transitions. [2019-09-10 08:33:41,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 404168 states and 578567 transitions. [2019-09-10 08:33:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:33:41,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:41,988 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:41,989 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:41,989 INFO L82 PathProgramCache]: Analyzing trace with hash 833432163, now seen corresponding path program 1 times [2019-09-10 08:33:41,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:41,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:33:42,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:42,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:42,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:42,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:42,256 INFO L87 Difference]: Start difference. First operand 404168 states and 578567 transitions. Second operand 10 states. [2019-09-10 08:33:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:45,460 INFO L93 Difference]: Finished difference Result 800600 states and 1148303 transitions. [2019-09-10 08:33:45,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:45,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:33:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:46,456 INFO L225 Difference]: With dead ends: 800600 [2019-09-10 08:33:46,457 INFO L226 Difference]: Without dead ends: 800600 [2019-09-10 08:33:46,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:33:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800600 states. [2019-09-10 08:34:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800600 to 477512. [2019-09-10 08:34:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477512 states. [2019-09-10 08:34:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477512 states to 477512 states and 683271 transitions. [2019-09-10 08:34:01,950 INFO L78 Accepts]: Start accepts. Automaton has 477512 states and 683271 transitions. Word has length 154 [2019-09-10 08:34:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:01,950 INFO L475 AbstractCegarLoop]: Abstraction has 477512 states and 683271 transitions. [2019-09-10 08:34:01,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 477512 states and 683271 transitions. [2019-09-10 08:34:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:34:01,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:01,970 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:01,971 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash 437161047, now seen corresponding path program 1 times [2019-09-10 08:34:01,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:01,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:01,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:01,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:01,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:34:02,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:02,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:34:02,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:02,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:34:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:34:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:34:02,347 INFO L87 Difference]: Start difference. First operand 477512 states and 683271 transitions. Second operand 10 states. [2019-09-10 08:34:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:09,856 INFO L93 Difference]: Finished difference Result 873944 states and 1253007 transitions. [2019-09-10 08:34:09,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:34:09,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:34:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:11,751 INFO L225 Difference]: With dead ends: 873944 [2019-09-10 08:34:11,751 INFO L226 Difference]: Without dead ends: 873944 [2019-09-10 08:34:11,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:34:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873944 states. [2019-09-10 08:34:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873944 to 550856. [2019-09-10 08:34:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550856 states. [2019-09-10 08:34:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550856 states to 550856 states and 787975 transitions. [2019-09-10 08:34:25,162 INFO L78 Accepts]: Start accepts. Automaton has 550856 states and 787975 transitions. Word has length 154 [2019-09-10 08:34:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:25,162 INFO L475 AbstractCegarLoop]: Abstraction has 550856 states and 787975 transitions. [2019-09-10 08:34:25,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 550856 states and 787975 transitions. [2019-09-10 08:34:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:34:25,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:25,191 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:25,191 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1131416651, now seen corresponding path program 1 times [2019-09-10 08:34:25,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:25,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:25,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:25,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:25,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:34:25,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:34:25,335 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [190], [193], [201], [203], [206], [214], [216], [219], [227], [229], [232], [235], [240], [242], [245], [253], [255], [258], [266], [268], [271], [279], [281], [284], [292], [294], [297], [304], [306], [309], [310], [312], [321], [324], [328], [337], [339], [342], [345], [347], [362], [364], [367], [370], [372], [387], [389], [392], [395], [397], [412], [414], [417], [420], [422], [430], [433], [439], [442], [445], [447], [462], [464], [467], [470], [472], [487], [489], [492], [495], [497], [512], [514], [517], [520], [522], [594], [595], [599], [600], [601] [2019-09-10 08:34:25,338 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:34:25,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:34:25,374 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:34:26,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:34:26,480 INFO L272 AbstractInterpreter]: Visited 144 different actions 1483 times. Merged at 76 different actions 1162 times. Widened at 33 different actions 217 times. Performed 5590 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5590 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 162 fixpoints after 32 different actions. Largest state had 200 variables. [2019-09-10 08:34:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:26,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:34:26,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:26,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:34:26,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:26,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:34:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:26,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:34:26,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:34:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:34:26,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:34:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:34:27,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:34:27,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:34:27,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:27,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:34:27,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:34:27,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:34:27,059 INFO L87 Difference]: Start difference. First operand 550856 states and 787975 transitions. Second operand 10 states. [2019-09-10 08:34:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:39,184 INFO L93 Difference]: Finished difference Result 947288 states and 1357711 transitions. [2019-09-10 08:34:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:34:39,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:34:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:40,401 INFO L225 Difference]: With dead ends: 947288 [2019-09-10 08:34:40,401 INFO L226 Difference]: Without dead ends: 947288 [2019-09-10 08:34:40,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:34:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947288 states. [2019-09-10 08:34:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947288 to 624200. [2019-09-10 08:34:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624200 states. [2019-09-10 08:35:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624200 states to 624200 states and 892679 transitions. [2019-09-10 08:35:00,743 INFO L78 Accepts]: Start accepts. Automaton has 624200 states and 892679 transitions. Word has length 154 [2019-09-10 08:35:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:00,743 INFO L475 AbstractCegarLoop]: Abstraction has 624200 states and 892679 transitions. [2019-09-10 08:35:00,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:35:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 624200 states and 892679 transitions. [2019-09-10 08:35:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:35:00,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:00,776 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:00,776 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1294367623, now seen corresponding path program 1 times [2019-09-10 08:35:00,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:00,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:00,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:35:01,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:01,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:35:01,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:01,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:35:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:35:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:35:01,023 INFO L87 Difference]: Start difference. First operand 624200 states and 892679 transitions. Second operand 10 states. [2019-09-10 08:35:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:04,973 INFO L93 Difference]: Finished difference Result 1125464 states and 1619087 transitions. [2019-09-10 08:35:04,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:35:04,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-10 08:35:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:07,811 INFO L225 Difference]: With dead ends: 1125464 [2019-09-10 08:35:07,811 INFO L226 Difference]: Without dead ends: 1125464 [2019-09-10 08:35:07,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:35:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125464 states. [2019-09-10 08:35:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125464 to 653896. [2019-09-10 08:35:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653896 states. [2019-09-10 08:35:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653896 states to 653896 states and 935815 transitions. [2019-09-10 08:35:27,921 INFO L78 Accepts]: Start accepts. Automaton has 653896 states and 935815 transitions. Word has length 154 [2019-09-10 08:35:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:27,922 INFO L475 AbstractCegarLoop]: Abstraction has 653896 states and 935815 transitions. [2019-09-10 08:35:27,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:35:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 653896 states and 935815 transitions. [2019-09-10 08:35:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:35:27,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:27,948 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:27,949 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:27,949 INFO L82 PathProgramCache]: Analyzing trace with hash -153699452, now seen corresponding path program 1 times [2019-09-10 08:35:27,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:27,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:27,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:27,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:27,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:35:28,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:35:28,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:35:28,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 08:35:28,118 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [190], [193], [201], [203], [206], [214], [216], [219], [227], [229], [232], [240], [242], [245], [253], [255], [258], [266], [268], [271], [279], [281], [284], [292], [294], [297], [300], [304], [306], [309], [310], [312], [314], [319], [321], [324], [337], [339], [342], [345], [347], [362], [364], [367], [370], [372], [387], [389], [392], [395], [397], [412], [414], [417], [420], [422], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [487], [489], [492], [495], [497], [512], [514], [517], [520], [522], [594], [595], [599], [600], [601] [2019-09-10 08:35:28,121 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:35:28,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:35:28,170 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:35:29,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:35:29,267 INFO L272 AbstractInterpreter]: Visited 144 different actions 1638 times. Merged at 76 different actions 1275 times. Widened at 36 different actions 229 times. Performed 6155 root evaluator evaluations with a maximum evaluation depth of 10. Performed 6155 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 192 fixpoints after 34 different actions. Largest state had 200 variables. [2019-09-10 08:35:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:29,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:35:29,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:35:29,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:35:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:29,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:35:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:30,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-10 08:35:30,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:35:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:35:30,972 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:35:30,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:31,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:35:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:35:31,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:35:31,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 7 [2019-09-10 08:35:31,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:35:31,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:35:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:35:31,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:31,120 INFO L87 Difference]: Start difference. First operand 653896 states and 935815 transitions. Second operand 5 states. [2019-09-10 08:35:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:42,861 INFO L93 Difference]: Finished difference Result 1161231 states and 1646384 transitions. [2019-09-10 08:35:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:35:42,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-09-10 08:35:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:44,190 INFO L225 Difference]: With dead ends: 1161231 [2019-09-10 08:35:44,190 INFO L226 Difference]: Without dead ends: 1161231 [2019-09-10 08:35:44,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161231 states. [2019-09-10 08:36:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161231 to 1138760. [2019-09-10 08:36:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138760 states. [2019-09-10 08:36:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138760 states to 1138760 states and 1614855 transitions. [2019-09-10 08:36:24,046 INFO L78 Accepts]: Start accepts. Automaton has 1138760 states and 1614855 transitions. Word has length 155 [2019-09-10 08:36:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:24,046 INFO L475 AbstractCegarLoop]: Abstraction has 1138760 states and 1614855 transitions. [2019-09-10 08:36:24,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:36:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1138760 states and 1614855 transitions. [2019-09-10 08:36:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:36:24,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:24,075 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:24,076 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash 544206770, now seen corresponding path program 1 times [2019-09-10 08:36:24,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:24,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:24,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:24,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:24,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:24,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:36:24,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 08:36:24,374 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [190], [193], [201], [203], [206], [209], [214], [216], [219], [222], [227], [229], [232], [240], [242], [245], [253], [255], [258], [266], [268], [271], [279], [281], [284], [292], [294], [297], [304], [306], [309], [310], [312], [321], [324], [328], [337], [339], [342], [345], [347], [362], [364], [367], [370], [372], [387], [389], [392], [395], [397], [412], [414], [417], [420], [422], [437], [439], [442], [445], [447], [455], [458], [464], [467], [470], [472], [480], [483], [489], [492], [495], [497], [512], [514], [517], [520], [522], [594], [595], [599], [600], [601] [2019-09-10 08:36:24,377 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:36:24,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:36:24,431 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:36:25,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:36:25,559 INFO L272 AbstractInterpreter]: Visited 146 different actions 1488 times. Merged at 78 different actions 1167 times. Widened at 33 different actions 215 times. Performed 5672 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 153 fixpoints after 24 different actions. Largest state had 200 variables. [2019-09-10 08:36:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:25,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:36:25,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:25,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:36:25,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:25,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:36:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:25,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:36:25,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:36:25,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:36:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:26,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:36:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:36:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:26,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:36:26,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:36:26,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:36:26,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:36:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:36:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:36:26,722 INFO L87 Difference]: Start difference. First operand 1138760 states and 1614855 transitions. Second operand 17 states. [2019-09-10 08:36:41,791 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:36:42,715 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-10 08:36:44,190 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:36:58,532 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-09-10 08:37:00,584 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 08:37:01,759 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:37:02,147 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:37:02,914 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:37:27,151 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 30