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.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:51:07,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:51:07,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:51:07,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:51:07,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:51:07,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:51:07,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:51:07,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:51:07,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:51:07,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:51:07,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:51:07,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:51:07,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:51:07,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:51:07,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:51:07,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:51:07,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:51:07,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:51:07,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:51:07,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:51:07,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:51:07,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:51:07,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:51:07,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:51:07,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:51:07,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:51:07,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:51:07,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:51:07,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:51:07,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:51:07,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:51:07,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:51:07,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:51:07,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:51:07,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:51:07,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:51:07,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:51:07,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:51:07,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:51:07,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:51:07,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:51:07,503 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:51:07,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:51:07,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:51:07,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:51:07,519 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:51:07,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:51:07,520 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:51:07,520 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:51:07,520 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:51:07,521 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:51:07,521 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:51:07,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:51:07,522 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:51:07,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:51:07,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:51:07,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:51:07,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:51:07,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:51:07,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:51:07,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:51:07,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:51:07,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:51:07,524 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:51:07,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:51:07,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:51:07,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:51:07,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:51:07,525 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:51:07,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:51:07,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:51:07,525 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:51:07,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:51:07,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:51:07,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:51:07,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:51:07,572 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:51:07,572 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.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:51:07,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c0e8c69/16b70d94107d4775b03cf364bb28cf4d/FLAG55cfe0a2e [2019-09-10 08:51:08,207 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:51:08,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:51:08,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c0e8c69/16b70d94107d4775b03cf364bb28cf4d/FLAG55cfe0a2e [2019-09-10 08:51:08,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c0e8c69/16b70d94107d4775b03cf364bb28cf4d [2019-09-10 08:51:08,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:51:08,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:51:08,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:51:08,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:51:08,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:51:08,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:51:08" (1/1) ... [2019-09-10 08:51:08,634 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:51:08, skipping insertion in model container [2019-09-10 08:51:08,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:51:08" (1/1) ... [2019-09-10 08:51:08,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:51:08,744 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:51:09,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:51:09,545 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:51:09,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:51:09,861 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:51:09,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09 WrapperNode [2019-09-10 08:51:09,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:51:09,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:51:09,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:51:09,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:51:09,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (1/1) ... [2019-09-10 08:51:09,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (1/1) ... [2019-09-10 08:51:09,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (1/1) ... [2019-09-10 08:51:09,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (1/1) ... [2019-09-10 08:51:09,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (1/1) ... [2019-09-10 08:51:10,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (1/1) ... [2019-09-10 08:51:10,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (1/1) ... [2019-09-10 08:51:10,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:51:10,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:51:10,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:51:10,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:51:10,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (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:51:10,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:51:10,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:51:10,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:51:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:51:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:51:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:51:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:51:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:51:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:51:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:51:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:51:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:51:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:51:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:51:10,127 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:51:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:51:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:51:10,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:51:10,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:51:12,417 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:51:12,418 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:51:12,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:51:12 BoogieIcfgContainer [2019-09-10 08:51:12,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:51:12,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:51:12,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:51:12,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:51:12,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:51:08" (1/3) ... [2019-09-10 08:51:12,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235d0abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:51:12, skipping insertion in model container [2019-09-10 08:51:12,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:51:09" (2/3) ... [2019-09-10 08:51:12,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235d0abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:51:12, skipping insertion in model container [2019-09-10 08:51:12,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:51:12" (3/3) ... [2019-09-10 08:51:12,427 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:51:12,437 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:51:12,447 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:51:12,464 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:51:12,493 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:51:12,493 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:51:12,493 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:51:12,494 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:51:12,494 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:51:12,494 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:51:12,494 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:51:12,494 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:51:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states. [2019-09-10 08:51:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 08:51:12,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:12,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:12,561 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 927124790, now seen corresponding path program 1 times [2019-09-10 08:51:12,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:12,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:12,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:13,901 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:51:13,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:13,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:13,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:13,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:13,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:13,928 INFO L87 Difference]: Start difference. First operand 641 states. Second operand 4 states. [2019-09-10 08:51:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:14,204 INFO L93 Difference]: Finished difference Result 1251 states and 2210 transitions. [2019-09-10 08:51:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:51:14,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-10 08:51:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:14,230 INFO L225 Difference]: With dead ends: 1251 [2019-09-10 08:51:14,230 INFO L226 Difference]: Without dead ends: 1243 [2019-09-10 08:51:14,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:51:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-10 08:51:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1241. [2019-09-10 08:51:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-09-10 08:51:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1945 transitions. [2019-09-10 08:51:14,365 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1945 transitions. Word has length 250 [2019-09-10 08:51:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:14,368 INFO L475 AbstractCegarLoop]: Abstraction has 1241 states and 1945 transitions. [2019-09-10 08:51:14,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1945 transitions. [2019-09-10 08:51:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 08:51:14,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:14,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,375 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1671693487, now seen corresponding path program 1 times [2019-09-10 08:51:14,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:14,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:14,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:14,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:14,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:14,520 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:51:14,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:14,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:14,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:14,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:14,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:14,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:14,524 INFO L87 Difference]: Start difference. First operand 1241 states and 1945 transitions. Second operand 3 states. [2019-09-10 08:51:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:14,573 INFO L93 Difference]: Finished difference Result 2462 states and 3855 transitions. [2019-09-10 08:51:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:14,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-10 08:51:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:14,586 INFO L225 Difference]: With dead ends: 2462 [2019-09-10 08:51:14,587 INFO L226 Difference]: Without dead ends: 2462 [2019-09-10 08:51:14,588 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:51:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-09-10 08:51:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 1254. [2019-09-10 08:51:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-09-10 08:51:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1964 transitions. [2019-09-10 08:51:14,638 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1964 transitions. Word has length 252 [2019-09-10 08:51:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:14,639 INFO L475 AbstractCegarLoop]: Abstraction has 1254 states and 1964 transitions. [2019-09-10 08:51:14,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1964 transitions. [2019-09-10 08:51:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 08:51:14,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:14,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,646 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:14,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:14,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1734716020, now seen corresponding path program 1 times [2019-09-10 08:51:14,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:14,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:14,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:14,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:14,977 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:51:14,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:14,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:14,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:14,980 INFO L87 Difference]: Start difference. First operand 1254 states and 1964 transitions. Second operand 3 states. [2019-09-10 08:51:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:15,065 INFO L93 Difference]: Finished difference Result 2451 states and 3820 transitions. [2019-09-10 08:51:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:15,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-10 08:51:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:15,078 INFO L225 Difference]: With dead ends: 2451 [2019-09-10 08:51:15,078 INFO L226 Difference]: Without dead ends: 2451 [2019-09-10 08:51:15,079 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:51:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2019-09-10 08:51:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2019-09-10 08:51:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2449 states. [2019-09-10 08:51:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3819 transitions. [2019-09-10 08:51:15,139 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3819 transitions. Word has length 252 [2019-09-10 08:51:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:15,140 INFO L475 AbstractCegarLoop]: Abstraction has 2449 states and 3819 transitions. [2019-09-10 08:51:15,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3819 transitions. [2019-09-10 08:51:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 08:51:15,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:15,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:15,148 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash -479626916, now seen corresponding path program 1 times [2019-09-10 08:51:15,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:15,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:15,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:15,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:15,331 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:51:15,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:15,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:15,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:15,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:15,334 INFO L87 Difference]: Start difference. First operand 2449 states and 3819 transitions. Second operand 3 states. [2019-09-10 08:51:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:15,414 INFO L93 Difference]: Finished difference Result 4845 states and 7543 transitions. [2019-09-10 08:51:15,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:15,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 08:51:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:15,447 INFO L225 Difference]: With dead ends: 4845 [2019-09-10 08:51:15,447 INFO L226 Difference]: Without dead ends: 4845 [2019-09-10 08:51:15,448 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:51:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2019-09-10 08:51:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 2467. [2019-09-10 08:51:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-09-10 08:51:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3840 transitions. [2019-09-10 08:51:15,561 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3840 transitions. Word has length 253 [2019-09-10 08:51:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:15,561 INFO L475 AbstractCegarLoop]: Abstraction has 2467 states and 3840 transitions. [2019-09-10 08:51:15,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3840 transitions. [2019-09-10 08:51:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:51:15,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:15,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:15,571 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1925243986, now seen corresponding path program 1 times [2019-09-10 08:51:15,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:15,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:15,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:15,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:15,771 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:51:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:15,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:15,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:15,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:15,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:15,774 INFO L87 Difference]: Start difference. First operand 2467 states and 3840 transitions. Second operand 3 states. [2019-09-10 08:51:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:15,888 INFO L93 Difference]: Finished difference Result 3315 states and 5189 transitions. [2019-09-10 08:51:15,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:15,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-10 08:51:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:15,910 INFO L225 Difference]: With dead ends: 3315 [2019-09-10 08:51:15,911 INFO L226 Difference]: Without dead ends: 3315 [2019-09-10 08:51:15,911 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:51:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2019-09-10 08:51:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2955. [2019-09-10 08:51:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2019-09-10 08:51:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 4646 transitions. [2019-09-10 08:51:15,995 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 4646 transitions. Word has length 254 [2019-09-10 08:51:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:15,996 INFO L475 AbstractCegarLoop]: Abstraction has 2955 states and 4646 transitions. [2019-09-10 08:51:15,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 4646 transitions. [2019-09-10 08:51:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:51:16,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:16,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,006 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2048251047, now seen corresponding path program 1 times [2019-09-10 08:51:16,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:16,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:16,317 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:51:16,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:16,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:16,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:16,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:16,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:16,319 INFO L87 Difference]: Start difference. First operand 2955 states and 4646 transitions. Second operand 3 states. [2019-09-10 08:51:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:16,424 INFO L93 Difference]: Finished difference Result 5696 states and 8893 transitions. [2019-09-10 08:51:16,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:16,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-10 08:51:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:16,459 INFO L225 Difference]: With dead ends: 5696 [2019-09-10 08:51:16,459 INFO L226 Difference]: Without dead ends: 5696 [2019-09-10 08:51:16,460 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:51:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5696 states. [2019-09-10 08:51:16,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5696 to 5694. [2019-09-10 08:51:16,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5694 states. [2019-09-10 08:51:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 8892 transitions. [2019-09-10 08:51:16,652 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 8892 transitions. Word has length 254 [2019-09-10 08:51:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:16,653 INFO L475 AbstractCegarLoop]: Abstraction has 5694 states and 8892 transitions. [2019-09-10 08:51:16,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 8892 transitions. [2019-09-10 08:51:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:51:16,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:16,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,669 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1535732676, now seen corresponding path program 1 times [2019-09-10 08:51:16,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:16,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:17,134 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:51:17,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:17,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:17,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:17,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:17,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:17,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:17,137 INFO L87 Difference]: Start difference. First operand 5694 states and 8892 transitions. Second operand 4 states. [2019-09-10 08:51:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:17,251 INFO L93 Difference]: Finished difference Result 10404 states and 16160 transitions. [2019-09-10 08:51:17,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:17,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-10 08:51:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:17,291 INFO L225 Difference]: With dead ends: 10404 [2019-09-10 08:51:17,291 INFO L226 Difference]: Without dead ends: 10404 [2019-09-10 08:51:17,292 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:51:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10404 states. [2019-09-10 08:51:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10404 to 5929. [2019-09-10 08:51:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5929 states. [2019-09-10 08:51:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 9280 transitions. [2019-09-10 08:51:17,524 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 9280 transitions. Word has length 254 [2019-09-10 08:51:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:17,525 INFO L475 AbstractCegarLoop]: Abstraction has 5929 states and 9280 transitions. [2019-09-10 08:51:17,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 9280 transitions. [2019-09-10 08:51:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 08:51:17,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:17,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:17,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash 602759059, now seen corresponding path program 1 times [2019-09-10 08:51:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:17,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:17,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:17,733 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:51:17,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:17,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:17,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:17,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:17,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:17,736 INFO L87 Difference]: Start difference. First operand 5929 states and 9280 transitions. Second operand 3 states. [2019-09-10 08:51:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:17,852 INFO L93 Difference]: Finished difference Result 8239 states and 13001 transitions. [2019-09-10 08:51:17,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:17,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 08:51:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:17,878 INFO L225 Difference]: With dead ends: 8239 [2019-09-10 08:51:17,878 INFO L226 Difference]: Without dead ends: 8239 [2019-09-10 08:51:17,879 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:51:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8239 states. [2019-09-10 08:51:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8239 to 7653. [2019-09-10 08:51:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7653 states. [2019-09-10 08:51:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 12112 transitions. [2019-09-10 08:51:18,166 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 12112 transitions. Word has length 256 [2019-09-10 08:51:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:18,167 INFO L475 AbstractCegarLoop]: Abstraction has 7653 states and 12112 transitions. [2019-09-10 08:51:18,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 12112 transitions. [2019-09-10 08:51:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 08:51:18,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:18,187 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:18,187 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash -774787013, now seen corresponding path program 1 times [2019-09-10 08:51:18,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:18,399 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:51:18,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:18,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:18,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:18,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:18,402 INFO L87 Difference]: Start difference. First operand 7653 states and 12112 transitions. Second operand 3 states. [2019-09-10 08:51:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:18,529 INFO L93 Difference]: Finished difference Result 14539 states and 22868 transitions. [2019-09-10 08:51:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:18,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 08:51:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:18,568 INFO L225 Difference]: With dead ends: 14539 [2019-09-10 08:51:18,568 INFO L226 Difference]: Without dead ends: 14539 [2019-09-10 08:51:18,570 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:51:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14539 states. [2019-09-10 08:51:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14539 to 7757. [2019-09-10 08:51:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7757 states. [2019-09-10 08:51:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7757 states to 7757 states and 12255 transitions. [2019-09-10 08:51:18,831 INFO L78 Accepts]: Start accepts. Automaton has 7757 states and 12255 transitions. Word has length 256 [2019-09-10 08:51:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:18,831 INFO L475 AbstractCegarLoop]: Abstraction has 7757 states and 12255 transitions. [2019-09-10 08:51:18,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7757 states and 12255 transitions. [2019-09-10 08:51:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 08:51:18,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:18,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:18,845 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash -638003002, now seen corresponding path program 1 times [2019-09-10 08:51:18,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:18,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:18,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:19,410 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:51:19,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:19,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:19,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:19,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:19,412 INFO L87 Difference]: Start difference. First operand 7757 states and 12255 transitions. Second operand 4 states. [2019-09-10 08:51:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:19,604 INFO L93 Difference]: Finished difference Result 14982 states and 23514 transitions. [2019-09-10 08:51:19,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:19,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-09-10 08:51:19,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:19,645 INFO L225 Difference]: With dead ends: 14982 [2019-09-10 08:51:19,646 INFO L226 Difference]: Without dead ends: 14982 [2019-09-10 08:51:19,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:51:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14982 states. [2019-09-10 08:51:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14982 to 14980. [2019-09-10 08:51:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14980 states. [2019-09-10 08:51:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14980 states to 14980 states and 23513 transitions. [2019-09-10 08:51:19,932 INFO L78 Accepts]: Start accepts. Automaton has 14980 states and 23513 transitions. Word has length 257 [2019-09-10 08:51:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:19,933 INFO L475 AbstractCegarLoop]: Abstraction has 14980 states and 23513 transitions. [2019-09-10 08:51:19,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 14980 states and 23513 transitions. [2019-09-10 08:51:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 08:51:19,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:19,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:19,953 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1476557971, now seen corresponding path program 1 times [2019-09-10 08:51:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:19,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:19,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:20,277 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:51:20,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:20,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:20,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:20,280 INFO L87 Difference]: Start difference. First operand 14980 states and 23513 transitions. Second operand 3 states. [2019-09-10 08:51:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:20,441 INFO L93 Difference]: Finished difference Result 28845 states and 44935 transitions. [2019-09-10 08:51:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:20,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-10 08:51:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:20,513 INFO L225 Difference]: With dead ends: 28845 [2019-09-10 08:51:20,513 INFO L226 Difference]: Without dead ends: 28845 [2019-09-10 08:51:20,515 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:51:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28845 states. [2019-09-10 08:51:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28845 to 28843. [2019-09-10 08:51:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28843 states. [2019-09-10 08:51:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28843 states to 28843 states and 44934 transitions. [2019-09-10 08:51:21,033 INFO L78 Accepts]: Start accepts. Automaton has 28843 states and 44934 transitions. Word has length 259 [2019-09-10 08:51:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:21,034 INFO L475 AbstractCegarLoop]: Abstraction has 28843 states and 44934 transitions. [2019-09-10 08:51:21,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 28843 states and 44934 transitions. [2019-09-10 08:51:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 08:51:21,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:21,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:21,070 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:21,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:21,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1551866172, now seen corresponding path program 1 times [2019-09-10 08:51:21,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:21,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:21,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:21,213 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:51:21,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:21,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:21,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:21,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:21,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:21,216 INFO L87 Difference]: Start difference. First operand 28843 states and 44934 transitions. Second operand 3 states. [2019-09-10 08:51:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:21,506 INFO L93 Difference]: Finished difference Result 55467 states and 85976 transitions. [2019-09-10 08:51:21,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:21,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-10 08:51:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:21,634 INFO L225 Difference]: With dead ends: 55467 [2019-09-10 08:51:21,634 INFO L226 Difference]: Without dead ends: 55467 [2019-09-10 08:51:21,635 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:51:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55467 states. [2019-09-10 08:51:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55467 to 29329. [2019-09-10 08:51:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29329 states. [2019-09-10 08:51:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29329 states to 29329 states and 45487 transitions. [2019-09-10 08:51:22,291 INFO L78 Accepts]: Start accepts. Automaton has 29329 states and 45487 transitions. Word has length 259 [2019-09-10 08:51:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:22,292 INFO L475 AbstractCegarLoop]: Abstraction has 29329 states and 45487 transitions. [2019-09-10 08:51:22,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29329 states and 45487 transitions. [2019-09-10 08:51:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:51:22,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:22,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:22,332 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash -981358940, now seen corresponding path program 1 times [2019-09-10 08:51:22,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:22,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:22,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:22,535 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:51:22,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:22,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:22,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:22,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:22,538 INFO L87 Difference]: Start difference. First operand 29329 states and 45487 transitions. Second operand 3 states. [2019-09-10 08:51:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:22,757 INFO L93 Difference]: Finished difference Result 43603 states and 68528 transitions. [2019-09-10 08:51:22,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:22,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 08:51:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:23,623 INFO L225 Difference]: With dead ends: 43603 [2019-09-10 08:51:23,623 INFO L226 Difference]: Without dead ends: 43603 [2019-09-10 08:51:23,624 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:51:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43603 states. [2019-09-10 08:51:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43603 to 41153. [2019-09-10 08:51:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41153 states. [2019-09-10 08:51:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41153 states to 41153 states and 64671 transitions. [2019-09-10 08:51:24,172 INFO L78 Accepts]: Start accepts. Automaton has 41153 states and 64671 transitions. Word has length 260 [2019-09-10 08:51:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:24,173 INFO L475 AbstractCegarLoop]: Abstraction has 41153 states and 64671 transitions. [2019-09-10 08:51:24,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 41153 states and 64671 transitions. [2019-09-10 08:51:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:51:24,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:24,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:24,217 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1027308604, now seen corresponding path program 1 times [2019-09-10 08:51:24,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:24,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:24,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:24,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:24,456 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:51:24,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:24,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:24,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:24,460 INFO L87 Difference]: Start difference. First operand 41153 states and 64671 transitions. Second operand 3 states. [2019-09-10 08:51:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:24,970 INFO L93 Difference]: Finished difference Result 80592 states and 125990 transitions. [2019-09-10 08:51:24,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:24,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 08:51:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:25,082 INFO L225 Difference]: With dead ends: 80592 [2019-09-10 08:51:25,082 INFO L226 Difference]: Without dead ends: 80592 [2019-09-10 08:51:25,082 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:51:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80592 states. [2019-09-10 08:51:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80592 to 80590. [2019-09-10 08:51:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80590 states. [2019-09-10 08:51:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80590 states to 80590 states and 125989 transitions. [2019-09-10 08:51:28,028 INFO L78 Accepts]: Start accepts. Automaton has 80590 states and 125989 transitions. Word has length 260 [2019-09-10 08:51:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:28,029 INFO L475 AbstractCegarLoop]: Abstraction has 80590 states and 125989 transitions. [2019-09-10 08:51:28,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 80590 states and 125989 transitions. [2019-09-10 08:51:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:51:28,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:28,055 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:28,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash 363775905, now seen corresponding path program 1 times [2019-09-10 08:51:28,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:28,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:28,353 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:51:28,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:28,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:28,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:28,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:28,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:28,355 INFO L87 Difference]: Start difference. First operand 80590 states and 125989 transitions. Second operand 4 states. [2019-09-10 08:51:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:28,567 INFO L93 Difference]: Finished difference Result 77042 states and 120137 transitions. [2019-09-10 08:51:28,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:28,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2019-09-10 08:51:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:28,719 INFO L225 Difference]: With dead ends: 77042 [2019-09-10 08:51:28,719 INFO L226 Difference]: Without dead ends: 70734 [2019-09-10 08:51:28,723 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:51:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70734 states. [2019-09-10 08:51:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70734 to 70582. [2019-09-10 08:51:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70582 states. [2019-09-10 08:51:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70582 states to 70582 states and 110311 transitions. [2019-09-10 08:51:29,697 INFO L78 Accepts]: Start accepts. Automaton has 70582 states and 110311 transitions. Word has length 260 [2019-09-10 08:51:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:29,697 INFO L475 AbstractCegarLoop]: Abstraction has 70582 states and 110311 transitions. [2019-09-10 08:51:29,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 70582 states and 110311 transitions. [2019-09-10 08:51:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:51:29,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,725 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1448354597, now seen corresponding path program 1 times [2019-09-10 08:51:29,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:29,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:29,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:30,058 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:51:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:30,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:30,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:30,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:30,060 INFO L87 Difference]: Start difference. First operand 70582 states and 110311 transitions. Second operand 4 states. [2019-09-10 08:51:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:30,377 INFO L93 Difference]: Finished difference Result 117611 states and 183189 transitions. [2019-09-10 08:51:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:30,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-10 08:51:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:30,519 INFO L225 Difference]: With dead ends: 117611 [2019-09-10 08:51:30,519 INFO L226 Difference]: Without dead ends: 117611 [2019-09-10 08:51:30,519 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:51:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117611 states. [2019-09-10 08:51:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117611 to 68793. [2019-09-10 08:51:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68793 states. [2019-09-10 08:51:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68793 states to 68793 states and 107473 transitions. [2019-09-10 08:51:31,801 INFO L78 Accepts]: Start accepts. Automaton has 68793 states and 107473 transitions. Word has length 261 [2019-09-10 08:51:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:31,802 INFO L475 AbstractCegarLoop]: Abstraction has 68793 states and 107473 transitions. [2019-09-10 08:51:31,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 68793 states and 107473 transitions. [2019-09-10 08:51:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 08:51:31,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:31,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,830 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -706426212, now seen corresponding path program 1 times [2019-09-10 08:51:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:31,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:31,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:31,969 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:51:31,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:31,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:31,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:31,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:31,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:31,971 INFO L87 Difference]: Start difference. First operand 68793 states and 107473 transitions. Second operand 3 states. [2019-09-10 08:51:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:32,415 INFO L93 Difference]: Finished difference Result 110914 states and 174691 transitions. [2019-09-10 08:51:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:32,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-10 08:51:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:32,576 INFO L225 Difference]: With dead ends: 110914 [2019-09-10 08:51:32,576 INFO L226 Difference]: Without dead ends: 110914 [2019-09-10 08:51:32,576 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:51:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110914 states. [2019-09-10 08:51:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110914 to 104450. [2019-09-10 08:51:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104450 states. [2019-09-10 08:51:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104450 states to 104450 states and 165276 transitions. [2019-09-10 08:51:35,313 INFO L78 Accepts]: Start accepts. Automaton has 104450 states and 165276 transitions. Word has length 263 [2019-09-10 08:51:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:35,313 INFO L475 AbstractCegarLoop]: Abstraction has 104450 states and 165276 transitions. [2019-09-10 08:51:35,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 104450 states and 165276 transitions. [2019-09-10 08:51:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 08:51:35,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:35,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:35,339 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:35,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1843984235, now seen corresponding path program 1 times [2019-09-10 08:51:35,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:35,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:35,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:35,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:35,453 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:51:35,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:35,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:35,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:35,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:35,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:35,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:35,455 INFO L87 Difference]: Start difference. First operand 104450 states and 165276 transitions. Second operand 3 states. [2019-09-10 08:51:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:36,397 INFO L93 Difference]: Finished difference Result 184731 states and 291820 transitions. [2019-09-10 08:51:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:36,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-10 08:51:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:36,609 INFO L225 Difference]: With dead ends: 184731 [2019-09-10 08:51:36,609 INFO L226 Difference]: Without dead ends: 184731 [2019-09-10 08:51:36,610 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:51:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184731 states. [2019-09-10 08:51:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184731 to 104931. [2019-09-10 08:51:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104931 states. [2019-09-10 08:51:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104931 states to 104931 states and 165874 transitions. [2019-09-10 08:51:40,418 INFO L78 Accepts]: Start accepts. Automaton has 104931 states and 165874 transitions. Word has length 264 [2019-09-10 08:51:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:40,419 INFO L475 AbstractCegarLoop]: Abstraction has 104931 states and 165874 transitions. [2019-09-10 08:51:40,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 104931 states and 165874 transitions. [2019-09-10 08:51:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 08:51:40,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:40,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:40,442 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash 443412495, now seen corresponding path program 1 times [2019-09-10 08:51:40,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:40,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:40,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:40,574 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:51:40,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:40,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:40,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:40,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:40,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:40,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:40,576 INFO L87 Difference]: Start difference. First operand 104931 states and 165874 transitions. Second operand 3 states. [2019-09-10 08:51:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:41,742 INFO L93 Difference]: Finished difference Result 197212 states and 311398 transitions. [2019-09-10 08:51:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:41,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-10 08:51:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:42,064 INFO L225 Difference]: With dead ends: 197212 [2019-09-10 08:51:42,064 INFO L226 Difference]: Without dead ends: 197212 [2019-09-10 08:51:42,064 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:51:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197212 states. [2019-09-10 08:51:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197212 to 197210. [2019-09-10 08:51:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197210 states. [2019-09-10 08:51:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197210 states to 197210 states and 311397 transitions. [2019-09-10 08:51:49,604 INFO L78 Accepts]: Start accepts. Automaton has 197210 states and 311397 transitions. Word has length 264 [2019-09-10 08:51:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:49,605 INFO L475 AbstractCegarLoop]: Abstraction has 197210 states and 311397 transitions. [2019-09-10 08:51:49,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 197210 states and 311397 transitions. [2019-09-10 08:51:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 08:51:49,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:49,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:49,632 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:49,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:49,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2128014934, now seen corresponding path program 1 times [2019-09-10 08:51:49,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:49,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:49,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:49,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:49,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:50,098 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:51:50,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:50,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:50,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:50,100 INFO L87 Difference]: Start difference. First operand 197210 states and 311397 transitions. Second operand 4 states. [2019-09-10 08:51:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:51,053 INFO L93 Difference]: Finished difference Result 361205 states and 567000 transitions. [2019-09-10 08:51:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:51,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-09-10 08:51:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:51,508 INFO L225 Difference]: With dead ends: 361205 [2019-09-10 08:51:51,508 INFO L226 Difference]: Without dead ends: 361205 [2019-09-10 08:51:51,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:51:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361205 states. [2019-09-10 08:51:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361205 to 361203. [2019-09-10 08:51:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361203 states. [2019-09-10 08:51:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361203 states to 361203 states and 566999 transitions. [2019-09-10 08:51:59,411 INFO L78 Accepts]: Start accepts. Automaton has 361203 states and 566999 transitions. Word has length 264 [2019-09-10 08:51:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:59,412 INFO L475 AbstractCegarLoop]: Abstraction has 361203 states and 566999 transitions. [2019-09-10 08:51:59,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 361203 states and 566999 transitions. [2019-09-10 08:51:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-10 08:51:59,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:59,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:59,479 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1484801400, now seen corresponding path program 1 times [2019-09-10 08:51:59,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:59,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:59,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:59,731 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:51:59,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:59,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:59,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:59,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:59,733 INFO L87 Difference]: Start difference. First operand 361203 states and 566999 transitions. Second operand 3 states. [2019-09-10 08:52:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:06,030 INFO L93 Difference]: Finished difference Result 707294 states and 1104020 transitions. [2019-09-10 08:52:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:06,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-09-10 08:52:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:07,087 INFO L225 Difference]: With dead ends: 707294 [2019-09-10 08:52:07,087 INFO L226 Difference]: Without dead ends: 707294 [2019-09-10 08:52:07,088 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:52:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707294 states. [2019-09-10 08:52:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707294 to 706988. [2019-09-10 08:52:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706988 states. [2019-09-10 08:52:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706988 states to 706988 states and 1103639 transitions. [2019-09-10 08:52:26,161 INFO L78 Accepts]: Start accepts. Automaton has 706988 states and 1103639 transitions. Word has length 266 [2019-09-10 08:52:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:26,161 INFO L475 AbstractCegarLoop]: Abstraction has 706988 states and 1103639 transitions. [2019-09-10 08:52:26,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 706988 states and 1103639 transitions. [2019-09-10 08:52:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 08:52:35,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:35,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:35,368 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1322469474, now seen corresponding path program 1 times [2019-09-10 08:52:35,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:35,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:35,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:35,635 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:52:35,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:35,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:35,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:35,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:35,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:35,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:35,637 INFO L87 Difference]: Start difference. First operand 706988 states and 1103639 transitions. Second operand 4 states. [2019-09-10 08:52:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:39,444 INFO L93 Difference]: Finished difference Result 1198130 states and 1867200 transitions. [2019-09-10 08:52:39,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:39,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-09-10 08:52:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:50,605 INFO L225 Difference]: With dead ends: 1198130 [2019-09-10 08:52:50,606 INFO L226 Difference]: Without dead ends: 1196612 [2019-09-10 08:52:50,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:52:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196612 states. [2019-09-10 08:53:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196612 to 695350. [2019-09-10 08:53:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695350 states. [2019-09-10 08:53:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695350 states to 695350 states and 1085037 transitions. [2019-09-10 08:53:15,557 INFO L78 Accepts]: Start accepts. Automaton has 695350 states and 1085037 transitions. Word has length 267 [2019-09-10 08:53:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:15,557 INFO L475 AbstractCegarLoop]: Abstraction has 695350 states and 1085037 transitions. [2019-09-10 08:53:15,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 695350 states and 1085037 transitions. [2019-09-10 08:53:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 08:53:15,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:15,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:15,685 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:15,686 INFO L82 PathProgramCache]: Analyzing trace with hash 390277077, now seen corresponding path program 1 times [2019-09-10 08:53:15,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:15,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:15,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:15,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:15,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:15,903 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:53:15,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:15,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:15,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:15,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:15,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:15,905 INFO L87 Difference]: Start difference. First operand 695350 states and 1085037 transitions. Second operand 3 states. [2019-09-10 08:53:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:31,080 INFO L93 Difference]: Finished difference Result 1332453 states and 2066691 transitions. [2019-09-10 08:53:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:31,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-09-10 08:53:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:33,284 INFO L225 Difference]: With dead ends: 1332453 [2019-09-10 08:53:33,284 INFO L226 Difference]: Without dead ends: 1332453 [2019-09-10 08:53:33,284 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:53:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332453 states. [2019-09-10 08:54:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332453 to 1332451. [2019-09-10 08:54:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332451 states. [2019-09-10 08:54:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332451 states to 1332451 states and 2066690 transitions. [2019-09-10 08:54:26,129 INFO L78 Accepts]: Start accepts. Automaton has 1332451 states and 2066690 transitions. Word has length 268 [2019-09-10 08:54:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:26,129 INFO L475 AbstractCegarLoop]: Abstraction has 1332451 states and 2066690 transitions. [2019-09-10 08:54:26,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1332451 states and 2066690 transitions. [2019-09-10 08:54:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-10 08:54:26,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:26,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:26,347 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:26,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1911713980, now seen corresponding path program 1 times [2019-09-10 08:54:26,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:26,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:29,265 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:54:29,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:29,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:29,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:29,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:29,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:29,269 INFO L87 Difference]: Start difference. First operand 1332451 states and 2066690 transitions. Second operand 4 states. [2019-09-10 08:54:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:34,181 INFO L93 Difference]: Finished difference Result 1206293 states and 1865185 transitions. [2019-09-10 08:54:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:34,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2019-09-10 08:54:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:36,415 INFO L225 Difference]: With dead ends: 1206293 [2019-09-10 08:54:36,416 INFO L226 Difference]: Without dead ends: 1176971 [2019-09-10 08:54:36,416 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:54:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176971 states. [2019-09-10 08:55:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176971 to 1174519. [2019-09-10 08:55:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174519 states.