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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:39:01,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:39:01,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:39:01,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:39:01,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:39:01,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:39:01,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:39:01,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:39:01,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:39:01,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:39:01,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:39:01,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:39:01,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:39:01,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:39:01,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:39:01,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:39:01,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:39:01,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:39:01,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:39:01,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:39:01,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:39:01,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:39:01,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:39:01,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:39:01,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:39:01,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:39:01,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:39:01,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:39:01,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:39:01,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:39:01,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:39:01,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:39:01,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:39:01,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:39:01,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:39:01,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:39:01,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:39:01,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:39:01,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:39:01,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:39:01,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:39:01,510 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:39:01,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:39:01,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:39:01,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:39:01,539 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:39:01,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:39:01,540 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:39:01,540 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:39:01,540 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:39:01,540 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:39:01,540 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:39:01,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:39:01,541 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:39:01,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:39:01,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:39:01,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:39:01,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:39:01,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:39:01,543 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:39:01,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:39:01,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:39:01,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:39:01,543 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:39:01,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:39:01,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:39:01,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:39:01,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:39:01,544 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:39:01,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:39:01,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:39:01,545 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:39:01,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:39:01,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:39:01,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:39:01,590 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:39:01,590 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:39:01,591 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:39:01,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ebf5d02/c5711e60ee644474bdb8446cc27f9a8c/FLAG8ad9a08ae [2019-09-10 08:39:02,133 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:39:02,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:39:02,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ebf5d02/c5711e60ee644474bdb8446cc27f9a8c/FLAG8ad9a08ae [2019-09-10 08:39:02,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ebf5d02/c5711e60ee644474bdb8446cc27f9a8c [2019-09-10 08:39:02,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:39:02,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:39:02,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:39:02,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:39:02,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:39:02,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:39:02" (1/1) ... [2019-09-10 08:39:02,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67837e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:02, skipping insertion in model container [2019-09-10 08:39:02,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:39:02" (1/1) ... [2019-09-10 08:39:02,518 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:39:02,571 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:39:02,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:39:02,977 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:39:03,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:39:03,112 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:39:03,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03 WrapperNode [2019-09-10 08:39:03,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:39:03,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:39:03,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:39:03,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:39:03,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (1/1) ... [2019-09-10 08:39:03,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (1/1) ... [2019-09-10 08:39:03,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (1/1) ... [2019-09-10 08:39:03,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (1/1) ... [2019-09-10 08:39:03,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (1/1) ... [2019-09-10 08:39:03,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (1/1) ... [2019-09-10 08:39:03,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (1/1) ... [2019-09-10 08:39:03,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:39:03,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:39:03,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:39:03,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:39:03,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (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:39:03,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:39:03,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:39:03,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:39:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:39:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:39:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:39:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:39:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:39:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:39:03,234 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:39:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:39:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:39:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:39:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:39:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:39:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:39:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:39:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:39:04,024 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:39:04,024 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:39:04,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:39:04 BoogieIcfgContainer [2019-09-10 08:39:04,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:39:04,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:39:04,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:39:04,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:39:04,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:39:02" (1/3) ... [2019-09-10 08:39:04,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd90894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:39:04, skipping insertion in model container [2019-09-10 08:39:04,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:03" (2/3) ... [2019-09-10 08:39:04,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd90894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:39:04, skipping insertion in model container [2019-09-10 08:39:04,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:39:04" (3/3) ... [2019-09-10 08:39:04,034 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:39:04,044 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:39:04,053 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:39:04,070 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:39:04,106 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:39:04,106 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:39:04,106 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:39:04,106 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:39:04,106 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:39:04,107 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:39:04,107 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:39:04,107 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:39:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-10 08:39:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:39:04,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:04,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:04,148 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-10 08:39:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:04,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:04,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:04,654 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:39:04,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:04,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:04,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:04,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:04,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:04,681 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-10 08:39:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:04,796 INFO L93 Difference]: Finished difference Result 237 states and 393 transitions. [2019-09-10 08:39:04,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:04,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:39:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:04,815 INFO L225 Difference]: With dead ends: 237 [2019-09-10 08:39:04,815 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 08:39:04,817 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:39:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 08:39:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-10 08:39:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 08:39:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2019-09-10 08:39:04,877 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2019-09-10 08:39:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:04,878 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2019-09-10 08:39:04,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2019-09-10 08:39:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:39:04,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:04,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:04,882 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-10 08:39:04,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:04,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:04,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:04,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:05,053 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:39:05,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:05,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:05,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:05,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:05,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:05,056 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 3 states. [2019-09-10 08:39:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:05,092 INFO L93 Difference]: Finished difference Result 377 states and 597 transitions. [2019-09-10 08:39:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:05,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:39:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:05,097 INFO L225 Difference]: With dead ends: 377 [2019-09-10 08:39:05,097 INFO L226 Difference]: Without dead ends: 377 [2019-09-10 08:39:05,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:39:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-10 08:39:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-10 08:39:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-10 08:39:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 596 transitions. [2019-09-10 08:39:05,125 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 596 transitions. Word has length 68 [2019-09-10 08:39:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:05,126 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 596 transitions. [2019-09-10 08:39:05,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 596 transitions. [2019-09-10 08:39:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:39:05,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:05,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:05,134 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-10 08:39:05,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:05,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:05,312 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:39:05,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:05,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:05,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:05,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:05,315 INFO L87 Difference]: Start difference. First operand 375 states and 596 transitions. Second operand 3 states. [2019-09-10 08:39:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:05,347 INFO L93 Difference]: Finished difference Result 657 states and 1053 transitions. [2019-09-10 08:39:05,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:05,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:39:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:05,352 INFO L225 Difference]: With dead ends: 657 [2019-09-10 08:39:05,353 INFO L226 Difference]: Without dead ends: 657 [2019-09-10 08:39:05,353 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:39:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-10 08:39:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-09-10 08:39:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-10 08:39:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2019-09-10 08:39:05,381 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 70 [2019-09-10 08:39:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:05,381 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2019-09-10 08:39:05,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2019-09-10 08:39:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 08:39:05,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:05,385 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] [2019-09-10 08:39:05,385 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-10 08:39:05,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:05,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:05,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:05,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:05,567 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:39:05,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:05,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:05,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:05,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:05,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:05,571 INFO L87 Difference]: Start difference. First operand 655 states and 1052 transitions. Second operand 5 states. [2019-09-10 08:39:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:05,732 INFO L93 Difference]: Finished difference Result 1899 states and 3098 transitions. [2019-09-10 08:39:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:39:05,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 08:39:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:05,763 INFO L225 Difference]: With dead ends: 1899 [2019-09-10 08:39:05,764 INFO L226 Difference]: Without dead ends: 1899 [2019-09-10 08:39:05,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:39:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-09-10 08:39:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1419. [2019-09-10 08:39:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-09-10 08:39:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2316 transitions. [2019-09-10 08:39:05,806 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2316 transitions. Word has length 72 [2019-09-10 08:39:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:05,806 INFO L475 AbstractCegarLoop]: Abstraction has 1419 states and 2316 transitions. [2019-09-10 08:39:05,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2316 transitions. [2019-09-10 08:39:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 08:39:05,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:05,811 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:05,811 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:05,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-10 08:39:05,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:05,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:05,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:05,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:05,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:05,914 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:39:05,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:05,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:39:05,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:05,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:39:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:39:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:05,917 INFO L87 Difference]: Start difference. First operand 1419 states and 2316 transitions. Second operand 4 states. [2019-09-10 08:39:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:05,993 INFO L93 Difference]: Finished difference Result 1984 states and 3242 transitions. [2019-09-10 08:39:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:39:05,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 08:39:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:06,004 INFO L225 Difference]: With dead ends: 1984 [2019-09-10 08:39:06,004 INFO L226 Difference]: Without dead ends: 1984 [2019-09-10 08:39:06,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2019-09-10 08:39:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1973. [2019-09-10 08:39:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-09-10 08:39:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3226 transitions. [2019-09-10 08:39:06,052 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 3226 transitions. Word has length 73 [2019-09-10 08:39:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:06,052 INFO L475 AbstractCegarLoop]: Abstraction has 1973 states and 3226 transitions. [2019-09-10 08:39:06,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:39:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 3226 transitions. [2019-09-10 08:39:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:39:06,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:06,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:06,055 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -408158820, now seen corresponding path program 1 times [2019-09-10 08:39:06,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:06,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:06,116 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:39:06,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:06,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:06,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:06,118 INFO L87 Difference]: Start difference. First operand 1973 states and 3226 transitions. Second operand 3 states. [2019-09-10 08:39:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:06,156 INFO L93 Difference]: Finished difference Result 3019 states and 4946 transitions. [2019-09-10 08:39:06,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:06,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:39:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:06,171 INFO L225 Difference]: With dead ends: 3019 [2019-09-10 08:39:06,171 INFO L226 Difference]: Without dead ends: 3019 [2019-09-10 08:39:06,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2019-09-10 08:39:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2019-09-10 08:39:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2019-09-10 08:39:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4945 transitions. [2019-09-10 08:39:06,239 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4945 transitions. Word has length 74 [2019-09-10 08:39:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:06,240 INFO L475 AbstractCegarLoop]: Abstraction has 3017 states and 4945 transitions. [2019-09-10 08:39:06,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4945 transitions. [2019-09-10 08:39:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:39:06,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:06,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:06,242 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-10 08:39:06,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:06,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:06,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:06,305 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:39:06,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:06,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:06,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:06,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:06,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:06,307 INFO L87 Difference]: Start difference. First operand 3017 states and 4945 transitions. Second operand 3 states. [2019-09-10 08:39:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:06,381 INFO L93 Difference]: Finished difference Result 4227 states and 6910 transitions. [2019-09-10 08:39:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:06,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:39:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:06,401 INFO L225 Difference]: With dead ends: 4227 [2019-09-10 08:39:06,401 INFO L226 Difference]: Without dead ends: 4227 [2019-09-10 08:39:06,402 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:39:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2019-09-10 08:39:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4225. [2019-09-10 08:39:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4225 states. [2019-09-10 08:39:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 6909 transitions. [2019-09-10 08:39:06,503 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 6909 transitions. Word has length 74 [2019-09-10 08:39:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:06,504 INFO L475 AbstractCegarLoop]: Abstraction has 4225 states and 6909 transitions. [2019-09-10 08:39:06,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 6909 transitions. [2019-09-10 08:39:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:39:06,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:06,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:06,506 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-10 08:39:06,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:06,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:06,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:06,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:06,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:06,652 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:39:06,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:06,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:39:06,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:06,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:39:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:39:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:39:06,654 INFO L87 Difference]: Start difference. First operand 4225 states and 6909 transitions. Second operand 7 states. [2019-09-10 08:39:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:06,921 INFO L93 Difference]: Finished difference Result 11312 states and 18259 transitions. [2019-09-10 08:39:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:39:06,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 08:39:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:07,002 INFO L225 Difference]: With dead ends: 11312 [2019-09-10 08:39:07,002 INFO L226 Difference]: Without dead ends: 11312 [2019-09-10 08:39:07,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:39:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2019-09-10 08:39:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 11249. [2019-09-10 08:39:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11249 states. [2019-09-10 08:39:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11249 states to 11249 states and 18159 transitions. [2019-09-10 08:39:07,268 INFO L78 Accepts]: Start accepts. Automaton has 11249 states and 18159 transitions. Word has length 74 [2019-09-10 08:39:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:07,268 INFO L475 AbstractCegarLoop]: Abstraction has 11249 states and 18159 transitions. [2019-09-10 08:39:07,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:39:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11249 states and 18159 transitions. [2019-09-10 08:39:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:39:07,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:07,276 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:07,277 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-10 08:39:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:07,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:07,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:07,342 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:39:07,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:07,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:07,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:07,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:07,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:07,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:07,343 INFO L87 Difference]: Start difference. First operand 11249 states and 18159 transitions. Second operand 3 states. [2019-09-10 08:39:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:07,423 INFO L93 Difference]: Finished difference Result 14840 states and 23809 transitions. [2019-09-10 08:39:07,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:07,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:39:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:07,456 INFO L225 Difference]: With dead ends: 14840 [2019-09-10 08:39:07,457 INFO L226 Difference]: Without dead ends: 14840 [2019-09-10 08:39:07,458 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:39:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14840 states. [2019-09-10 08:39:07,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14840 to 14838. [2019-09-10 08:39:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14838 states. [2019-09-10 08:39:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14838 states to 14838 states and 23808 transitions. [2019-09-10 08:39:08,301 INFO L78 Accepts]: Start accepts. Automaton has 14838 states and 23808 transitions. Word has length 74 [2019-09-10 08:39:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:08,302 INFO L475 AbstractCegarLoop]: Abstraction has 14838 states and 23808 transitions. [2019-09-10 08:39:08,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 14838 states and 23808 transitions. [2019-09-10 08:39:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:39:08,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:08,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:08,303 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:08,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-10 08:39:08,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:08,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:08,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:08,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:08,415 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:39:08,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:39:08,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:08,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:39:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:39:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:08,418 INFO L87 Difference]: Start difference. First operand 14838 states and 23808 transitions. Second operand 4 states. [2019-09-10 08:39:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:08,574 INFO L93 Difference]: Finished difference Result 33592 states and 53865 transitions. [2019-09-10 08:39:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:39:08,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 08:39:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:08,654 INFO L225 Difference]: With dead ends: 33592 [2019-09-10 08:39:08,655 INFO L226 Difference]: Without dead ends: 33592 [2019-09-10 08:39:08,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33592 states. [2019-09-10 08:39:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33592 to 23281. [2019-09-10 08:39:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23281 states. [2019-09-10 08:39:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23281 states to 23281 states and 37225 transitions. [2019-09-10 08:39:09,204 INFO L78 Accepts]: Start accepts. Automaton has 23281 states and 37225 transitions. Word has length 75 [2019-09-10 08:39:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:09,204 INFO L475 AbstractCegarLoop]: Abstraction has 23281 states and 37225 transitions. [2019-09-10 08:39:09,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:39:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 23281 states and 37225 transitions. [2019-09-10 08:39:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:39:09,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:09,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:09,206 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-10 08:39:09,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:09,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:09,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:09,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:09,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:09,349 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:39:09,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:09,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:09,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:09,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:09,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:09,351 INFO L87 Difference]: Start difference. First operand 23281 states and 37225 transitions. Second operand 5 states. [2019-09-10 08:39:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:09,529 INFO L93 Difference]: Finished difference Result 36004 states and 57441 transitions. [2019-09-10 08:39:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:39:09,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:39:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:09,605 INFO L225 Difference]: With dead ends: 36004 [2019-09-10 08:39:09,605 INFO L226 Difference]: Without dead ends: 36004 [2019-09-10 08:39:09,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36004 states. [2019-09-10 08:39:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36004 to 34012. [2019-09-10 08:39:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34012 states. [2019-09-10 08:39:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34012 states to 34012 states and 54194 transitions. [2019-09-10 08:39:10,305 INFO L78 Accepts]: Start accepts. Automaton has 34012 states and 54194 transitions. Word has length 77 [2019-09-10 08:39:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:10,305 INFO L475 AbstractCegarLoop]: Abstraction has 34012 states and 54194 transitions. [2019-09-10 08:39:10,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34012 states and 54194 transitions. [2019-09-10 08:39:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:39:10,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:10,306 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] [2019-09-10 08:39:10,307 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:10,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-10 08:39:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:10,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:10,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:10,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:10,483 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:39:10,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:10,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:10,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:10,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:10,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:10,485 INFO L87 Difference]: Start difference. First operand 34012 states and 54194 transitions. Second operand 5 states. [2019-09-10 08:39:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:11,606 INFO L93 Difference]: Finished difference Result 75208 states and 119787 transitions. [2019-09-10 08:39:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:39:11,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:39:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:11,781 INFO L225 Difference]: With dead ends: 75208 [2019-09-10 08:39:11,781 INFO L226 Difference]: Without dead ends: 75208 [2019-09-10 08:39:11,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75208 states. [2019-09-10 08:39:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75208 to 46912. [2019-09-10 08:39:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46912 states. [2019-09-10 08:39:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46912 states to 46912 states and 74479 transitions. [2019-09-10 08:39:12,724 INFO L78 Accepts]: Start accepts. Automaton has 46912 states and 74479 transitions. Word has length 80 [2019-09-10 08:39:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:12,724 INFO L475 AbstractCegarLoop]: Abstraction has 46912 states and 74479 transitions. [2019-09-10 08:39:12,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 46912 states and 74479 transitions. [2019-09-10 08:39:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:39:12,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:12,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:12,726 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-10 08:39:12,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:12,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:12,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:12,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:12,814 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:39:12,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:12,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:12,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:12,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:12,816 INFO L87 Difference]: Start difference. First operand 46912 states and 74479 transitions. Second operand 5 states. [2019-09-10 08:39:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:13,120 INFO L93 Difference]: Finished difference Result 80809 states and 127018 transitions. [2019-09-10 08:39:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:39:13,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:39:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:13,403 INFO L225 Difference]: With dead ends: 80809 [2019-09-10 08:39:13,404 INFO L226 Difference]: Without dead ends: 80809 [2019-09-10 08:39:13,404 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:39:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80809 states. [2019-09-10 08:39:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80809 to 48000. [2019-09-10 08:39:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48000 states. [2019-09-10 08:39:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48000 states to 48000 states and 75558 transitions. [2019-09-10 08:39:14,516 INFO L78 Accepts]: Start accepts. Automaton has 48000 states and 75558 transitions. Word has length 81 [2019-09-10 08:39:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:14,516 INFO L475 AbstractCegarLoop]: Abstraction has 48000 states and 75558 transitions. [2019-09-10 08:39:14,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 48000 states and 75558 transitions. [2019-09-10 08:39:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:39:14,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:14,522 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:14,523 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1517678893, now seen corresponding path program 1 times [2019-09-10 08:39:14,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:14,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:14,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:39:14,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:14,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:14,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:14,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:14,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:14,615 INFO L87 Difference]: Start difference. First operand 48000 states and 75558 transitions. Second operand 3 states. [2019-09-10 08:39:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:15,748 INFO L93 Difference]: Finished difference Result 83358 states and 131416 transitions. [2019-09-10 08:39:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:15,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 08:39:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:15,873 INFO L225 Difference]: With dead ends: 83358 [2019-09-10 08:39:15,874 INFO L226 Difference]: Without dead ends: 83358 [2019-09-10 08:39:15,875 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:39:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83358 states. [2019-09-10 08:39:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83358 to 83281. [2019-09-10 08:39:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83281 states. [2019-09-10 08:39:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83281 states to 83281 states and 131340 transitions. [2019-09-10 08:39:16,749 INFO L78 Accepts]: Start accepts. Automaton has 83281 states and 131340 transitions. Word has length 105 [2019-09-10 08:39:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:16,750 INFO L475 AbstractCegarLoop]: Abstraction has 83281 states and 131340 transitions. [2019-09-10 08:39:16,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 83281 states and 131340 transitions. [2019-09-10 08:39:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:39:16,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:16,753 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:16,754 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:16,754 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-10 08:39:16,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:16,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:16,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:16,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:39:16,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:16,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:16,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:16,862 INFO L87 Difference]: Start difference. First operand 83281 states and 131340 transitions. Second operand 5 states. [2019-09-10 08:39:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:17,280 INFO L93 Difference]: Finished difference Result 97867 states and 154173 transitions. [2019-09-10 08:39:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:39:17,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 08:39:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:17,447 INFO L225 Difference]: With dead ends: 97867 [2019-09-10 08:39:17,447 INFO L226 Difference]: Without dead ends: 97867 [2019-09-10 08:39:17,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97867 states. [2019-09-10 08:39:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97867 to 97169. [2019-09-10 08:39:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97169 states. [2019-09-10 08:39:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97169 states to 97169 states and 153176 transitions. [2019-09-10 08:39:20,108 INFO L78 Accepts]: Start accepts. Automaton has 97169 states and 153176 transitions. Word has length 105 [2019-09-10 08:39:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:20,109 INFO L475 AbstractCegarLoop]: Abstraction has 97169 states and 153176 transitions. [2019-09-10 08:39:20,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 97169 states and 153176 transitions. [2019-09-10 08:39:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:39:20,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:20,112 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:20,112 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-10 08:39:20,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:20,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:20,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:39:20,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:39:20,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:39:20,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 08:39:20,213 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [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], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [605], [606], [610], [611], [612] [2019-09-10 08:39:20,265 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:39:20,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:39:20,454 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:39:20,782 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:39:20,785 INFO L272 AbstractInterpreter]: Visited 87 different actions 278 times. Merged at 35 different actions 176 times. Widened at 16 different actions 17 times. Performed 979 root evaluator evaluations with a maximum evaluation depth of 5. Performed 979 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:39:20,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:20,790 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:39:21,535 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.06% of their original sizes. [2019-09-10 08:39:21,535 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:39:26,069 INFO L420 sIntCurrentIteration]: We unified 104 AI predicates to 104 [2019-09-10 08:39:26,069 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:39:26,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:39:26,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [5] total 66 [2019-09-10 08:39:26,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:26,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 08:39:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 08:39:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=3408, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 08:39:26,073 INFO L87 Difference]: Start difference. First operand 97169 states and 153176 transitions. Second operand 63 states. [2019-09-10 08:40:28,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:29,000 INFO L93 Difference]: Finished difference Result 347439 states and 538308 transitions. [2019-09-10 08:40:29,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-10 08:40:29,000 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 105 [2019-09-10 08:40:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:29,941 INFO L225 Difference]: With dead ends: 347439 [2019-09-10 08:40:29,942 INFO L226 Difference]: Without dead ends: 347439 [2019-09-10 08:40:29,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10180 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3607, Invalid=24115, Unknown=0, NotChecked=0, Total=27722 [2019-09-10 08:40:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347439 states. [2019-09-10 08:40:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347439 to 135980. [2019-09-10 08:40:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135980 states. [2019-09-10 08:40:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135980 states to 135980 states and 213153 transitions. [2019-09-10 08:40:33,527 INFO L78 Accepts]: Start accepts. Automaton has 135980 states and 213153 transitions. Word has length 105 [2019-09-10 08:40:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:33,527 INFO L475 AbstractCegarLoop]: Abstraction has 135980 states and 213153 transitions. [2019-09-10 08:40:33,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 08:40:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 135980 states and 213153 transitions. [2019-09-10 08:40:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:40:33,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:33,534 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:33,534 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -383639073, now seen corresponding path program 1 times [2019-09-10 08:40:33,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:33,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:33,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:33,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:40:33,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:33,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:33,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:33,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:33,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:33,593 INFO L87 Difference]: Start difference. First operand 135980 states and 213153 transitions. Second operand 3 states. [2019-09-10 08:40:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:34,523 INFO L93 Difference]: Finished difference Result 271946 states and 426284 transitions. [2019-09-10 08:40:34,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:34,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:40:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:35,127 INFO L225 Difference]: With dead ends: 271946 [2019-09-10 08:40:35,127 INFO L226 Difference]: Without dead ends: 271946 [2019-09-10 08:40:35,128 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:40:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271946 states. [2019-09-10 08:40:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271946 to 135983. [2019-09-10 08:40:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135983 states. [2019-09-10 08:40:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135983 states to 135983 states and 213157 transitions. [2019-09-10 08:40:41,284 INFO L78 Accepts]: Start accepts. Automaton has 135983 states and 213157 transitions. Word has length 106 [2019-09-10 08:40:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:41,284 INFO L475 AbstractCegarLoop]: Abstraction has 135983 states and 213157 transitions. [2019-09-10 08:40:41,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 135983 states and 213157 transitions. [2019-09-10 08:40:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:40:41,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:41,289 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:41,289 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:41,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash -900487682, now seen corresponding path program 1 times [2019-09-10 08:40:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:41,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:41,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:40:41,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:41,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:41,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:41,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:41,335 INFO L87 Difference]: Start difference. First operand 135983 states and 213157 transitions. Second operand 3 states. [2019-09-10 08:40:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:41,928 INFO L93 Difference]: Finished difference Result 271932 states and 426258 transitions. [2019-09-10 08:40:41,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:41,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:40:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:42,305 INFO L225 Difference]: With dead ends: 271932 [2019-09-10 08:40:42,306 INFO L226 Difference]: Without dead ends: 271932 [2019-09-10 08:40:42,306 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:40:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271932 states. [2019-09-10 08:40:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271932 to 135985. [2019-09-10 08:40:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135985 states. [2019-09-10 08:40:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135985 states to 135985 states and 213159 transitions. [2019-09-10 08:40:45,161 INFO L78 Accepts]: Start accepts. Automaton has 135985 states and 213159 transitions. Word has length 106 [2019-09-10 08:40:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:45,161 INFO L475 AbstractCegarLoop]: Abstraction has 135985 states and 213159 transitions. [2019-09-10 08:40:45,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 135985 states and 213159 transitions. [2019-09-10 08:40:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:40:45,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:45,168 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:45,168 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1443629572, now seen corresponding path program 1 times [2019-09-10 08:40:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:45,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:45,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:45,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:45,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:45,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:45,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:45,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:45,238 INFO L87 Difference]: Start difference. First operand 135985 states and 213159 transitions. Second operand 3 states. [2019-09-10 08:40:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:45,825 INFO L93 Difference]: Finished difference Result 263774 states and 410008 transitions. [2019-09-10 08:40:45,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:40:45,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:40:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:46,197 INFO L225 Difference]: With dead ends: 263774 [2019-09-10 08:40:46,197 INFO L226 Difference]: Without dead ends: 263774 [2019-09-10 08:40:46,197 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:40:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263774 states. [2019-09-10 08:40:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263774 to 263772. [2019-09-10 08:40:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263772 states. [2019-09-10 08:40:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263772 states to 263772 states and 410007 transitions. [2019-09-10 08:40:50,824 INFO L78 Accepts]: Start accepts. Automaton has 263772 states and 410007 transitions. Word has length 106 [2019-09-10 08:40:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:50,825 INFO L475 AbstractCegarLoop]: Abstraction has 263772 states and 410007 transitions. [2019-09-10 08:40:50,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 263772 states and 410007 transitions. [2019-09-10 08:40:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:40:50,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:50,834 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:50,834 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 74847844, now seen corresponding path program 1 times [2019-09-10 08:40:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:50,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:40:50,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:50,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:40:50,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:50,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:40:50,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:40:50,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:40:50,923 INFO L87 Difference]: Start difference. First operand 263772 states and 410007 transitions. Second operand 4 states. [2019-09-10 08:40:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:51,947 INFO L93 Difference]: Finished difference Result 264670 states and 409391 transitions. [2019-09-10 08:40:51,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:40:51,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 08:40:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:52,426 INFO L225 Difference]: With dead ends: 264670 [2019-09-10 08:40:52,426 INFO L226 Difference]: Without dead ends: 264670 [2019-09-10 08:40:52,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:40:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264670 states. [2019-09-10 08:40:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264670 to 183465. [2019-09-10 08:40:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183465 states. [2019-09-10 08:40:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183465 states to 183465 states and 282880 transitions. [2019-09-10 08:40:59,918 INFO L78 Accepts]: Start accepts. Automaton has 183465 states and 282880 transitions. Word has length 106 [2019-09-10 08:40:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:59,918 INFO L475 AbstractCegarLoop]: Abstraction has 183465 states and 282880 transitions. [2019-09-10 08:40:59,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:40:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 183465 states and 282880 transitions. [2019-09-10 08:40:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:40:59,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:59,927 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:59,927 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:59,927 INFO L82 PathProgramCache]: Analyzing trace with hash 54840582, now seen corresponding path program 1 times [2019-09-10 08:40:59,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:59,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:59,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:59,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:59,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:40:59,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:59,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:40:59,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:40:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:40:59,994 INFO L87 Difference]: Start difference. First operand 183465 states and 282880 transitions. Second operand 3 states. [2019-09-10 08:41:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:01,736 INFO L93 Difference]: Finished difference Result 356157 states and 544155 transitions. [2019-09-10 08:41:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:01,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:41:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:02,300 INFO L225 Difference]: With dead ends: 356157 [2019-09-10 08:41:02,300 INFO L226 Difference]: Without dead ends: 356157 [2019-09-10 08:41:02,301 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:41:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356157 states. [2019-09-10 08:41:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356157 to 356155. [2019-09-10 08:41:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356155 states. [2019-09-10 08:41:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356155 states to 356155 states and 544154 transitions. [2019-09-10 08:41:11,394 INFO L78 Accepts]: Start accepts. Automaton has 356155 states and 544154 transitions. Word has length 106 [2019-09-10 08:41:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:11,394 INFO L475 AbstractCegarLoop]: Abstraction has 356155 states and 544154 transitions. [2019-09-10 08:41:11,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 356155 states and 544154 transitions. [2019-09-10 08:41:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:41:11,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:11,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:11,403 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash 62486747, now seen corresponding path program 1 times [2019-09-10 08:41:11,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:11,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:11,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:11,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:11,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:41:11,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:11,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:11,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:11,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:11,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:11,456 INFO L87 Difference]: Start difference. First operand 356155 states and 544154 transitions. Second operand 3 states. [2019-09-10 08:41:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:19,326 INFO L93 Difference]: Finished difference Result 712245 states and 1088197 transitions. [2019-09-10 08:41:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:19,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:41:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:20,519 INFO L225 Difference]: With dead ends: 712245 [2019-09-10 08:41:20,519 INFO L226 Difference]: Without dead ends: 712245 [2019-09-10 08:41:20,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712245 states. [2019-09-10 08:41:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712245 to 356164. [2019-09-10 08:41:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356164 states. [2019-09-10 08:41:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356164 states to 356164 states and 544166 transitions. [2019-09-10 08:41:31,651 INFO L78 Accepts]: Start accepts. Automaton has 356164 states and 544166 transitions. Word has length 106 [2019-09-10 08:41:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:31,651 INFO L475 AbstractCegarLoop]: Abstraction has 356164 states and 544166 transitions. [2019-09-10 08:41:31,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 356164 states and 544166 transitions. [2019-09-10 08:41:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:41:31,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:31,661 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:31,661 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash -472030852, now seen corresponding path program 1 times [2019-09-10 08:41:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:31,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:31,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:41:31,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:31,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:31,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:31,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:31,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:31,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:31,703 INFO L87 Difference]: Start difference. First operand 356164 states and 544166 transitions. Second operand 3 states. [2019-09-10 08:41:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:34,531 INFO L93 Difference]: Finished difference Result 712249 states and 1088201 transitions. [2019-09-10 08:41:34,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:34,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:41:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:35,643 INFO L225 Difference]: With dead ends: 712249 [2019-09-10 08:41:35,643 INFO L226 Difference]: Without dead ends: 712249 [2019-09-10 08:41:35,643 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:41:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712249 states. [2019-09-10 08:41:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712249 to 356168. [2019-09-10 08:41:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356168 states. [2019-09-10 08:41:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356168 states to 356168 states and 544170 transitions. [2019-09-10 08:41:48,767 INFO L78 Accepts]: Start accepts. Automaton has 356168 states and 544170 transitions. Word has length 106 [2019-09-10 08:41:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:48,768 INFO L475 AbstractCegarLoop]: Abstraction has 356168 states and 544170 transitions. [2019-09-10 08:41:48,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 356168 states and 544170 transitions. [2019-09-10 08:41:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:41:48,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:48,777 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:48,777 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash 746984925, now seen corresponding path program 1 times [2019-09-10 08:41:48,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:48,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:48,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:48,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:48,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:41:48,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:48,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:48,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:48,826 INFO L87 Difference]: Start difference. First operand 356168 states and 544170 transitions. Second operand 3 states. [2019-09-10 08:41:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:55,773 INFO L93 Difference]: Finished difference Result 712300 states and 1088281 transitions. [2019-09-10 08:41:55,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:55,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:41:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:56,719 INFO L225 Difference]: With dead ends: 712300 [2019-09-10 08:41:56,720 INFO L226 Difference]: Without dead ends: 712300 [2019-09-10 08:41:56,720 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:41:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712300 states. [2019-09-10 08:42:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712300 to 356174. [2019-09-10 08:42:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356174 states. [2019-09-10 08:42:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356174 states to 356174 states and 544178 transitions. [2019-09-10 08:42:04,135 INFO L78 Accepts]: Start accepts. Automaton has 356174 states and 544178 transitions. Word has length 106 [2019-09-10 08:42:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:04,136 INFO L475 AbstractCegarLoop]: Abstraction has 356174 states and 544178 transitions. [2019-09-10 08:42:04,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 356174 states and 544178 transitions. [2019-09-10 08:42:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:42:04,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:04,145 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:04,145 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1426692480, now seen corresponding path program 1 times [2019-09-10 08:42:04,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:04,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:04,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:42:04,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:04,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:04,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:04,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:04,183 INFO L87 Difference]: Start difference. First operand 356174 states and 544178 transitions. Second operand 3 states. [2019-09-10 08:42:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:12,009 INFO L93 Difference]: Finished difference Result 712330 states and 1088328 transitions. [2019-09-10 08:42:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:12,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:42:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:13,062 INFO L225 Difference]: With dead ends: 712330 [2019-09-10 08:42:13,063 INFO L226 Difference]: Without dead ends: 712330 [2019-09-10 08:42:13,063 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:42:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712330 states. [2019-09-10 08:42:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712330 to 356176. [2019-09-10 08:42:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356176 states. [2019-09-10 08:42:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356176 states to 356176 states and 544180 transitions. [2019-09-10 08:42:19,747 INFO L78 Accepts]: Start accepts. Automaton has 356176 states and 544180 transitions. Word has length 106 [2019-09-10 08:42:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:19,747 INFO L475 AbstractCegarLoop]: Abstraction has 356176 states and 544180 transitions. [2019-09-10 08:42:19,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 356176 states and 544180 transitions. [2019-09-10 08:42:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:42:19,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:19,756 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:19,756 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2136006622, now seen corresponding path program 1 times [2019-09-10 08:42:19,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:19,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:19,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:19,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:19,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:19,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:42:19,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:42:19,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:42:19,832 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [10], [13], [15], [18], [20], [23], [25], [28], [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], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [578], [581], [587], [605], [606], [610], [611], [612] [2019-09-10 08:42:19,836 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:42:19,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:42:19,859 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:42:20,035 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:42:20,036 INFO L272 AbstractInterpreter]: Visited 89 different actions 285 times. Merged at 35 different actions 181 times. Widened at 16 different actions 19 times. Performed 990 root evaluator evaluations with a maximum evaluation depth of 5. Performed 990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:42:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:20,036 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:42:20,226 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.25% of their original sizes. [2019-09-10 08:42:20,226 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:42:26,168 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:42:26,168 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:42:26,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:42:26,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 08:42:26,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:26,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 08:42:26,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 08:42:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3302, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:42:26,171 INFO L87 Difference]: Start difference. First operand 356176 states and 544180 transitions. Second operand 62 states. [2019-09-10 08:44:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:08,729 INFO L93 Difference]: Finished difference Result 1089842 states and 1643970 transitions. [2019-09-10 08:44:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 08:44:08,730 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2019-09-10 08:44:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:10,606 INFO L225 Difference]: With dead ends: 1089842 [2019-09-10 08:44:10,606 INFO L226 Difference]: Without dead ends: 1089842 [2019-09-10 08:44:10,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10527 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=3872, Invalid=24520, Unknown=0, NotChecked=0, Total=28392 [2019-09-10 08:44:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089842 states. [2019-09-10 08:44:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089842 to 356623. [2019-09-10 08:44:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356623 states. [2019-09-10 08:44:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356623 states to 356623 states and 544804 transitions. [2019-09-10 08:44:23,449 INFO L78 Accepts]: Start accepts. Automaton has 356623 states and 544804 transitions. Word has length 107 [2019-09-10 08:44:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:23,449 INFO L475 AbstractCegarLoop]: Abstraction has 356623 states and 544804 transitions. [2019-09-10 08:44:23,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 08:44:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 356623 states and 544804 transitions. [2019-09-10 08:44:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:44:23,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:23,459 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:23,459 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash 535566749, now seen corresponding path program 1 times [2019-09-10 08:44:23,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:23,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:23,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 08:44:25,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:25,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:25,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:25,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:25,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:25,430 INFO L87 Difference]: Start difference. First operand 356623 states and 544804 transitions. Second operand 4 states. [2019-09-10 08:44:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:26,300 INFO L93 Difference]: Finished difference Result 356713 states and 544910 transitions. [2019-09-10 08:44:26,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:26,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 08:44:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:26,891 INFO L225 Difference]: With dead ends: 356713 [2019-09-10 08:44:26,891 INFO L226 Difference]: Without dead ends: 356623 [2019-09-10 08:44:26,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356623 states. [2019-09-10 08:44:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356623 to 356614. [2019-09-10 08:44:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356614 states. [2019-09-10 08:44:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356614 states to 356614 states and 544784 transitions. [2019-09-10 08:44:37,335 INFO L78 Accepts]: Start accepts. Automaton has 356614 states and 544784 transitions. Word has length 107 [2019-09-10 08:44:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:37,335 INFO L475 AbstractCegarLoop]: Abstraction has 356614 states and 544784 transitions. [2019-09-10 08:44:37,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 356614 states and 544784 transitions. [2019-09-10 08:44:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:44:37,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:37,346 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:37,346 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1363669356, now seen corresponding path program 1 times [2019-09-10 08:44:37,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:37,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:37,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:37,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:37,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:44:37,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:44:37,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:44:37,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:44:37,428 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [15], [18], [20], [23], [25], [28], [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], [127], [155], [183], [186], [201], [204], [207], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [282], [290], [294], [296], [299], [330], [340], [350], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [565], [568], [574], [605], [606], [610], [611], [612] [2019-09-10 08:44:37,431 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:44:37,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:44:37,452 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:44:37,537 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:44:37,537 INFO L272 AbstractInterpreter]: Visited 89 different actions 285 times. Merged at 35 different actions 181 times. Widened at 16 different actions 19 times. Performed 932 root evaluator evaluations with a maximum evaluation depth of 5. Performed 932 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 174 variables. [2019-09-10 08:44:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:37,538 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:44:37,694 INFO L227 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 85.25% of their original sizes. [2019-09-10 08:44:37,694 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:44:43,004 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:44:43,005 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:44:43,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:44:43,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [5] total 65 [2019-09-10 08:44:43,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:43,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 08:44:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 08:44:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3302, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:44:43,007 INFO L87 Difference]: Start difference. First operand 356614 states and 544784 transitions. Second operand 62 states. [2019-09-10 08:46:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:11,785 INFO L93 Difference]: Finished difference Result 1090499 states and 1644826 transitions. [2019-09-10 08:46:11,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-10 08:46:11,786 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2019-09-10 08:46:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:14,591 INFO L225 Difference]: With dead ends: 1090499 [2019-09-10 08:46:14,591 INFO L226 Difference]: Without dead ends: 1090499 [2019-09-10 08:46:14,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10527 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=3872, Invalid=24520, Unknown=0, NotChecked=0, Total=28392 [2019-09-10 08:46:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090499 states. [2019-09-10 08:46:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090499 to 356732. [2019-09-10 08:46:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356732 states. [2019-09-10 08:46:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356732 states to 356732 states and 544941 transitions. [2019-09-10 08:46:31,731 INFO L78 Accepts]: Start accepts. Automaton has 356732 states and 544941 transitions. Word has length 107 [2019-09-10 08:46:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:31,731 INFO L475 AbstractCegarLoop]: Abstraction has 356732 states and 544941 transitions. [2019-09-10 08:46:31,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 08:46:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 356732 states and 544941 transitions. [2019-09-10 08:46:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:46:31,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:31,740 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:31,740 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1932488230, now seen corresponding path program 1 times [2019-09-10 08:46:31,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:31,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:46:31,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:31,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:31,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:31,795 INFO L87 Difference]: Start difference. First operand 356732 states and 544941 transitions. Second operand 3 states. [2019-09-10 08:46:34,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:34,229 INFO L93 Difference]: Finished difference Result 490496 states and 750248 transitions. [2019-09-10 08:46:34,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:34,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:46:34,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:35,177 INFO L225 Difference]: With dead ends: 490496 [2019-09-10 08:46:35,177 INFO L226 Difference]: Without dead ends: 490496 [2019-09-10 08:46:35,178 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:46:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490496 states. [2019-09-10 08:46:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490496 to 475576. [2019-09-10 08:46:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475576 states. [2019-09-10 08:46:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475576 states to 475576 states and 723469 transitions. [2019-09-10 08:46:47,740 INFO L78 Accepts]: Start accepts. Automaton has 475576 states and 723469 transitions. Word has length 107 [2019-09-10 08:46:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:47,740 INFO L475 AbstractCegarLoop]: Abstraction has 475576 states and 723469 transitions. [2019-09-10 08:46:47,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 475576 states and 723469 transitions. [2019-09-10 08:46:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:46:47,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:47,747 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:47,747 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1829841130, now seen corresponding path program 1 times [2019-09-10 08:46:47,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:47,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:46:47,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:47,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:47,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:47,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:47,799 INFO L87 Difference]: Start difference. First operand 475576 states and 723469 transitions. Second operand 3 states. [2019-09-10 08:46:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:55,661 INFO L93 Difference]: Finished difference Result 654468 states and 996685 transitions. [2019-09-10 08:46:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:55,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:46:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:56,885 INFO L225 Difference]: With dead ends: 654468 [2019-09-10 08:46:56,885 INFO L226 Difference]: Without dead ends: 654468 [2019-09-10 08:46:56,886 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:46:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654468 states. [2019-09-10 08:47:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654468 to 634144. [2019-09-10 08:47:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634144 states. [2019-09-10 08:47:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634144 states to 634144 states and 959962 transitions. [2019-09-10 08:47:06,623 INFO L78 Accepts]: Start accepts. Automaton has 634144 states and 959962 transitions. Word has length 107 [2019-09-10 08:47:06,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:06,623 INFO L475 AbstractCegarLoop]: Abstraction has 634144 states and 959962 transitions. [2019-09-10 08:47:06,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 634144 states and 959962 transitions. [2019-09-10 08:47:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:47:06,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:06,629 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] [2019-09-10 08:47:06,629 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:06,629 INFO L82 PathProgramCache]: Analyzing trace with hash -559216658, now seen corresponding path program 1 times [2019-09-10 08:47:06,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:06,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:06,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:06,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:06,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:47:06,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:06,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:06,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:06,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:06,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:06,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:06,684 INFO L87 Difference]: Start difference. First operand 634144 states and 959962 transitions. Second operand 3 states. [2019-09-10 08:47:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:18,469 INFO L93 Difference]: Finished difference Result 1228697 states and 1845584 transitions. [2019-09-10 08:47:18,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:18,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:47:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:20,256 INFO L225 Difference]: With dead ends: 1228697 [2019-09-10 08:47:20,256 INFO L226 Difference]: Without dead ends: 1228697 [2019-09-10 08:47:20,256 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:47:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228697 states. [2019-09-10 08:47:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228697 to 1146404. [2019-09-10 08:47:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146404 states. [2019-09-10 08:47:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146404 states to 1146404 states and 1725101 transitions. [2019-09-10 08:47:57,776 INFO L78 Accepts]: Start accepts. Automaton has 1146404 states and 1725101 transitions. Word has length 107 [2019-09-10 08:47:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:57,776 INFO L475 AbstractCegarLoop]: Abstraction has 1146404 states and 1725101 transitions. [2019-09-10 08:47:57,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1146404 states and 1725101 transitions. [2019-09-10 08:47:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:47:57,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:57,784 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] [2019-09-10 08:47:57,784 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash 961978104, now seen corresponding path program 1 times [2019-09-10 08:47:57,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:57,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:57,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:57,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:57,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:47:59,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:59,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:59,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:59,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:59,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:59,946 INFO L87 Difference]: Start difference. First operand 1146404 states and 1725101 transitions. Second operand 3 states. [2019-09-10 08:48:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:20,776 INFO L93 Difference]: Finished difference Result 2214196 states and 3297317 transitions. [2019-09-10 08:48:20,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:48:20,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:48:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:25,723 INFO L225 Difference]: With dead ends: 2214196 [2019-09-10 08:48:25,723 INFO L226 Difference]: Without dead ends: 2214196 [2019-09-10 08:48:25,723 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:48:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214196 states.