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_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:28:59,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:28:59,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:28:59,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:28:59,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:28:59,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:28:59,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:28:59,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:28:59,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:28:59,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:28:59,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:28:59,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:28:59,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:28:59,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:28:59,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:28:59,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:28:59,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:28:59,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:28:59,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:28:59,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:28:59,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:28:59,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:28:59,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:28:59,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:28:59,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:28:59,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:28:59,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:28:59,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:28:59,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:28:59,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:28:59,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:28:59,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:28:59,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:28:59,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:28:59,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:28:59,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:28:59,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:28:59,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:28:59,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:28:59,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:28:59,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:28:59,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:28:59,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:28:59,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:28:59,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:28:59,472 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:28:59,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:28:59,473 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:28:59,473 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:28:59,473 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:28:59,473 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:28:59,474 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:28:59,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:28:59,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:28:59,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:28:59,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:28:59,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:28:59,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:28:59,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:28:59,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:28:59,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:28:59,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:28:59,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:28:59,477 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:28:59,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:28:59,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:28:59,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:28:59,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:28:59,478 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:28:59,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:28:59,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:28:59,479 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:28:59,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:28:59,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:28:59,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:28:59,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:28:59,548 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:28:59,549 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:28:59,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b86cb8dc/4439a16226f64559bf2ab68d7fad8223/FLAG9caf22863 [2019-09-10 06:29:00,345 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:29:00,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:29:00,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b86cb8dc/4439a16226f64559bf2ab68d7fad8223/FLAG9caf22863 [2019-09-10 06:29:00,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b86cb8dc/4439a16226f64559bf2ab68d7fad8223 [2019-09-10 06:29:00,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:29:00,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:29:00,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:00,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:29:00,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:29:00,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:00" (1/1) ... [2019-09-10 06:29:00,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0f14d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:00, skipping insertion in model container [2019-09-10 06:29:00,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:29:00" (1/1) ... [2019-09-10 06:29:00,489 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:29:00,665 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:29:01,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:01,888 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:29:03,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:29:03,113 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:29:03,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03 WrapperNode [2019-09-10 06:29:03,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:29:03,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:29:03,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:29:03,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:29:03,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... [2019-09-10 06:29:03,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... [2019-09-10 06:29:03,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... [2019-09-10 06:29:03,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... [2019-09-10 06:29:03,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... [2019-09-10 06:29:03,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... [2019-09-10 06:29:03,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... [2019-09-10 06:29:03,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:29:03,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:29:03,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:29:03,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:29:03,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:29:03,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:29:03,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:29:03,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:29:03,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:29:03,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:29:03,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:29:03,544 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:29:03,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:29:03,544 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:29:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:29:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:29:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:29:03,545 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:29:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:29:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:29:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:29:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:29:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:29:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:29:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:29:07,518 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:29:07,519 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:29:07,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:29:07 BoogieIcfgContainer [2019-09-10 06:29:07,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:29:07,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:29:07,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:29:07,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:29:07,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:29:00" (1/3) ... [2019-09-10 06:29:07,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acadf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:29:07, skipping insertion in model container [2019-09-10 06:29:07,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:29:03" (2/3) ... [2019-09-10 06:29:07,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acadf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:29:07, skipping insertion in model container [2019-09-10 06:29:07,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:29:07" (3/3) ... [2019-09-10 06:29:07,529 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:29:07,540 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:29:07,550 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:29:07,568 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:29:07,595 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:29:07,595 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:29:07,596 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:29:07,596 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:29:07,596 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:29:07,596 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:29:07,596 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:29:07,596 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:29:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states. [2019-09-10 06:29:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 06:29:07,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:07,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:07,681 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:07,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:07,687 INFO L82 PathProgramCache]: Analyzing trace with hash 910299498, now seen corresponding path program 1 times [2019-09-10 06:29:07,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:07,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:07,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:07,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:08,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:08,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:08,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:08,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:08,617 INFO L87 Difference]: Start difference. First operand 1419 states. Second operand 3 states. [2019-09-10 06:29:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:08,798 INFO L93 Difference]: Finished difference Result 1997 states and 3508 transitions. [2019-09-10 06:29:08,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:08,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-10 06:29:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:08,830 INFO L225 Difference]: With dead ends: 1997 [2019-09-10 06:29:08,830 INFO L226 Difference]: Without dead ends: 1989 [2019-09-10 06:29:08,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-09-10 06:29:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1987. [2019-09-10 06:29:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-09-10 06:29:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 3333 transitions. [2019-09-10 06:29:08,984 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 3333 transitions. Word has length 340 [2019-09-10 06:29:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:08,987 INFO L475 AbstractCegarLoop]: Abstraction has 1987 states and 3333 transitions. [2019-09-10 06:29:08,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 3333 transitions. [2019-09-10 06:29:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-10 06:29:09,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:09,005 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1129027018, now seen corresponding path program 1 times [2019-09-10 06:29:09,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:09,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:09,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:09,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:09,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:09,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:09,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:09,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:09,353 INFO L87 Difference]: Start difference. First operand 1987 states and 3333 transitions. Second operand 3 states. [2019-09-10 06:29:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:09,495 INFO L93 Difference]: Finished difference Result 2981 states and 4949 transitions. [2019-09-10 06:29:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:09,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-09-10 06:29:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:09,522 INFO L225 Difference]: With dead ends: 2981 [2019-09-10 06:29:09,523 INFO L226 Difference]: Without dead ends: 2981 [2019-09-10 06:29:09,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-09-10 06:29:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2979. [2019-09-10 06:29:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2979 states. [2019-09-10 06:29:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4948 transitions. [2019-09-10 06:29:09,642 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4948 transitions. Word has length 342 [2019-09-10 06:29:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:09,645 INFO L475 AbstractCegarLoop]: Abstraction has 2979 states and 4948 transitions. [2019-09-10 06:29:09,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4948 transitions. [2019-09-10 06:29:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-10 06:29:09,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:09,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:09,667 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1293172548, now seen corresponding path program 1 times [2019-09-10 06:29:09,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:09,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:09,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:09,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:10,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:10,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:10,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:10,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:10,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:10,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:10,188 INFO L87 Difference]: Start difference. First operand 2979 states and 4948 transitions. Second operand 3 states. [2019-09-10 06:29:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:10,298 INFO L93 Difference]: Finished difference Result 4652 states and 7655 transitions. [2019-09-10 06:29:10,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:10,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-09-10 06:29:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:10,329 INFO L225 Difference]: With dead ends: 4652 [2019-09-10 06:29:10,329 INFO L226 Difference]: Without dead ends: 4652 [2019-09-10 06:29:10,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2019-09-10 06:29:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4650. [2019-09-10 06:29:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4650 states. [2019-09-10 06:29:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4650 states to 4650 states and 7654 transitions. [2019-09-10 06:29:10,467 INFO L78 Accepts]: Start accepts. Automaton has 4650 states and 7654 transitions. Word has length 344 [2019-09-10 06:29:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:10,467 INFO L475 AbstractCegarLoop]: Abstraction has 4650 states and 7654 transitions. [2019-09-10 06:29:10,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4650 states and 7654 transitions. [2019-09-10 06:29:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-10 06:29:10,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:10,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:10,482 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash 946430954, now seen corresponding path program 1 times [2019-09-10 06:29:10,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:10,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:10,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:10,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:10,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:10,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:10,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:10,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:10,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:10,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:10,780 INFO L87 Difference]: Start difference. First operand 4650 states and 7654 transitions. Second operand 3 states. [2019-09-10 06:29:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:10,904 INFO L93 Difference]: Finished difference Result 7359 states and 12001 transitions. [2019-09-10 06:29:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:10,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-09-10 06:29:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:10,941 INFO L225 Difference]: With dead ends: 7359 [2019-09-10 06:29:10,941 INFO L226 Difference]: Without dead ends: 7359 [2019-09-10 06:29:10,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7359 states. [2019-09-10 06:29:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7359 to 7357. [2019-09-10 06:29:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7357 states. [2019-09-10 06:29:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7357 states to 7357 states and 12000 transitions. [2019-09-10 06:29:11,113 INFO L78 Accepts]: Start accepts. Automaton has 7357 states and 12000 transitions. Word has length 346 [2019-09-10 06:29:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:11,114 INFO L475 AbstractCegarLoop]: Abstraction has 7357 states and 12000 transitions. [2019-09-10 06:29:11,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7357 states and 12000 transitions. [2019-09-10 06:29:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-10 06:29:11,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:11,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:11,132 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:11,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:11,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1572024206, now seen corresponding path program 1 times [2019-09-10 06:29:11,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:11,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:11,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:11,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:11,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:11,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:11,386 INFO L87 Difference]: Start difference. First operand 7357 states and 12000 transitions. Second operand 3 states. [2019-09-10 06:29:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:11,517 INFO L93 Difference]: Finished difference Result 11494 states and 18543 transitions. [2019-09-10 06:29:11,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:11,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-09-10 06:29:11,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:11,568 INFO L225 Difference]: With dead ends: 11494 [2019-09-10 06:29:11,568 INFO L226 Difference]: Without dead ends: 11494 [2019-09-10 06:29:11,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11494 states. [2019-09-10 06:29:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11494 to 11492. [2019-09-10 06:29:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11492 states. [2019-09-10 06:29:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11492 states to 11492 states and 18542 transitions. [2019-09-10 06:29:11,878 INFO L78 Accepts]: Start accepts. Automaton has 11492 states and 18542 transitions. Word has length 348 [2019-09-10 06:29:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:11,879 INFO L475 AbstractCegarLoop]: Abstraction has 11492 states and 18542 transitions. [2019-09-10 06:29:11,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11492 states and 18542 transitions. [2019-09-10 06:29:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-10 06:29:11,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:11,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:11,906 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:11,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:11,907 INFO L82 PathProgramCache]: Analyzing trace with hash -154699139, now seen corresponding path program 1 times [2019-09-10 06:29:11,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:11,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:12,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:12,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:29:12,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:12,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:29:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:29:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:12,324 INFO L87 Difference]: Start difference. First operand 11492 states and 18542 transitions. Second operand 3 states. [2019-09-10 06:29:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:12,470 INFO L93 Difference]: Finished difference Result 16263 states and 26391 transitions. [2019-09-10 06:29:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:29:12,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-09-10 06:29:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:12,511 INFO L225 Difference]: With dead ends: 16263 [2019-09-10 06:29:12,511 INFO L226 Difference]: Without dead ends: 16263 [2019-09-10 06:29:12,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:29:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16263 states. [2019-09-10 06:29:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16263 to 16261. [2019-09-10 06:29:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2019-09-10 06:29:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 26390 transitions. [2019-09-10 06:29:12,909 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 26390 transitions. Word has length 350 [2019-09-10 06:29:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:12,910 INFO L475 AbstractCegarLoop]: Abstraction has 16261 states and 26390 transitions. [2019-09-10 06:29:12,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:29:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 26390 transitions. [2019-09-10 06:29:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-10 06:29:12,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:12,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:12,940 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1237260265, now seen corresponding path program 1 times [2019-09-10 06:29:12,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:12,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:13,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:13,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:29:13,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:13,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:29:13,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:29:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:13,326 INFO L87 Difference]: Start difference. First operand 16261 states and 26390 transitions. Second operand 5 states. [2019-09-10 06:29:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:13,614 INFO L93 Difference]: Finished difference Result 37469 states and 61689 transitions. [2019-09-10 06:29:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:29:13,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 351 [2019-09-10 06:29:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:13,717 INFO L225 Difference]: With dead ends: 37469 [2019-09-10 06:29:13,718 INFO L226 Difference]: Without dead ends: 37469 [2019-09-10 06:29:13,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37469 states. [2019-09-10 06:29:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37469 to 29270. [2019-09-10 06:29:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29270 states. [2019-09-10 06:29:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29270 states to 29270 states and 48014 transitions. [2019-09-10 06:29:15,286 INFO L78 Accepts]: Start accepts. Automaton has 29270 states and 48014 transitions. Word has length 351 [2019-09-10 06:29:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:15,287 INFO L475 AbstractCegarLoop]: Abstraction has 29270 states and 48014 transitions. [2019-09-10 06:29:15,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:29:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 29270 states and 48014 transitions. [2019-09-10 06:29:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-10 06:29:15,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:15,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:15,324 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1483359712, now seen corresponding path program 1 times [2019-09-10 06:29:15,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:15,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:15,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:16,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:16,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:29:16,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:16,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:29:16,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:29:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:16,082 INFO L87 Difference]: Start difference. First operand 29270 states and 48014 transitions. Second operand 7 states. [2019-09-10 06:29:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:16,822 INFO L93 Difference]: Finished difference Result 49518 states and 81891 transitions. [2019-09-10 06:29:16,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:29:16,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 351 [2019-09-10 06:29:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:16,904 INFO L225 Difference]: With dead ends: 49518 [2019-09-10 06:29:16,905 INFO L226 Difference]: Without dead ends: 49518 [2019-09-10 06:29:16,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:29:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49518 states. [2019-09-10 06:29:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49518 to 32674. [2019-09-10 06:29:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32674 states. [2019-09-10 06:29:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32674 states to 32674 states and 53754 transitions. [2019-09-10 06:29:17,529 INFO L78 Accepts]: Start accepts. Automaton has 32674 states and 53754 transitions. Word has length 351 [2019-09-10 06:29:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:17,530 INFO L475 AbstractCegarLoop]: Abstraction has 32674 states and 53754 transitions. [2019-09-10 06:29:17,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 32674 states and 53754 transitions. [2019-09-10 06:29:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-10 06:29:17,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:17,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:17,554 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 844380814, now seen corresponding path program 1 times [2019-09-10 06:29:17,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:17,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:18,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:18,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:29:18,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:18,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:29:18,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:29:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:18,206 INFO L87 Difference]: Start difference. First operand 32674 states and 53754 transitions. Second operand 7 states. [2019-09-10 06:29:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:19,105 INFO L93 Difference]: Finished difference Result 101538 states and 168623 transitions. [2019-09-10 06:29:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:29:19,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-10 06:29:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:19,274 INFO L225 Difference]: With dead ends: 101538 [2019-09-10 06:29:19,274 INFO L226 Difference]: Without dead ends: 101538 [2019-09-10 06:29:19,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:29:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101538 states. [2019-09-10 06:29:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101538 to 43155. [2019-09-10 06:29:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43155 states. [2019-09-10 06:29:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43155 states to 43155 states and 71266 transitions. [2019-09-10 06:29:20,081 INFO L78 Accepts]: Start accepts. Automaton has 43155 states and 71266 transitions. Word has length 352 [2019-09-10 06:29:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:20,082 INFO L475 AbstractCegarLoop]: Abstraction has 43155 states and 71266 transitions. [2019-09-10 06:29:20,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 43155 states and 71266 transitions. [2019-09-10 06:29:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-10 06:29:20,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:20,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:20,103 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash 264007579, now seen corresponding path program 1 times [2019-09-10 06:29:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:20,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:20,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:21,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:21,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:29:21,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:21,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:29:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:29:21,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:21,677 INFO L87 Difference]: Start difference. First operand 43155 states and 71266 transitions. Second operand 7 states. [2019-09-10 06:29:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:22,321 INFO L93 Difference]: Finished difference Result 98001 states and 162749 transitions. [2019-09-10 06:29:22,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:29:22,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-10 06:29:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:22,442 INFO L225 Difference]: With dead ends: 98001 [2019-09-10 06:29:22,442 INFO L226 Difference]: Without dead ends: 98001 [2019-09-10 06:29:22,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:29:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98001 states. [2019-09-10 06:29:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98001 to 46941. [2019-09-10 06:29:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46941 states. [2019-09-10 06:29:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46941 states to 46941 states and 77618 transitions. [2019-09-10 06:29:23,290 INFO L78 Accepts]: Start accepts. Automaton has 46941 states and 77618 transitions. Word has length 352 [2019-09-10 06:29:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:23,291 INFO L475 AbstractCegarLoop]: Abstraction has 46941 states and 77618 transitions. [2019-09-10 06:29:23,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 46941 states and 77618 transitions. [2019-09-10 06:29:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-10 06:29:23,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:23,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:23,310 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:23,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:23,311 INFO L82 PathProgramCache]: Analyzing trace with hash 360693608, now seen corresponding path program 1 times [2019-09-10 06:29:23,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:23,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:23,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:23,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:24,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:24,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:29:24,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:24,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:29:24,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:29:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:24,121 INFO L87 Difference]: Start difference. First operand 46941 states and 77618 transitions. Second operand 7 states. [2019-09-10 06:29:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:24,716 INFO L93 Difference]: Finished difference Result 101503 states and 168625 transitions. [2019-09-10 06:29:24,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:29:24,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-10 06:29:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:24,844 INFO L225 Difference]: With dead ends: 101503 [2019-09-10 06:29:24,844 INFO L226 Difference]: Without dead ends: 101503 [2019-09-10 06:29:24,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:29:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101503 states. [2019-09-10 06:29:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101503 to 50727. [2019-09-10 06:29:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50727 states. [2019-09-10 06:29:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50727 states to 50727 states and 83970 transitions. [2019-09-10 06:29:27,485 INFO L78 Accepts]: Start accepts. Automaton has 50727 states and 83970 transitions. Word has length 352 [2019-09-10 06:29:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:27,486 INFO L475 AbstractCegarLoop]: Abstraction has 50727 states and 83970 transitions. [2019-09-10 06:29:27,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50727 states and 83970 transitions. [2019-09-10 06:29:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-10 06:29:27,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:27,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:27,501 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash -432358780, now seen corresponding path program 1 times [2019-09-10 06:29:27,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:27,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:27,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:27,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:27,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:29:27,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:27,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:29:27,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:29:27,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:27,854 INFO L87 Difference]: Start difference. First operand 50727 states and 83970 transitions. Second operand 5 states. [2019-09-10 06:29:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:28,276 INFO L93 Difference]: Finished difference Result 128371 states and 212877 transitions. [2019-09-10 06:29:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:29:28,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 352 [2019-09-10 06:29:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:28,457 INFO L225 Difference]: With dead ends: 128371 [2019-09-10 06:29:28,458 INFO L226 Difference]: Without dead ends: 128371 [2019-09-10 06:29:28,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128371 states. [2019-09-10 06:29:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128371 to 90884. [2019-09-10 06:29:29,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90884 states. [2019-09-10 06:29:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90884 states to 90884 states and 150366 transitions. [2019-09-10 06:29:30,118 INFO L78 Accepts]: Start accepts. Automaton has 90884 states and 150366 transitions. Word has length 352 [2019-09-10 06:29:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:30,119 INFO L475 AbstractCegarLoop]: Abstraction has 90884 states and 150366 transitions. [2019-09-10 06:29:30,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:29:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 90884 states and 150366 transitions. [2019-09-10 06:29:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-10 06:29:30,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:30,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:30,136 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1028061685, now seen corresponding path program 1 times [2019-09-10 06:29:30,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:30,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:30,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:30,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:29:30,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:30,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:29:30,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:29:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:30,706 INFO L87 Difference]: Start difference. First operand 90884 states and 150366 transitions. Second operand 7 states. [2019-09-10 06:29:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:31,656 INFO L93 Difference]: Finished difference Result 223906 states and 371347 transitions. [2019-09-10 06:29:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:29:31,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 352 [2019-09-10 06:29:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:32,045 INFO L225 Difference]: With dead ends: 223906 [2019-09-10 06:29:32,045 INFO L226 Difference]: Without dead ends: 223906 [2019-09-10 06:29:32,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:29:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223906 states. [2019-09-10 06:29:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223906 to 94456. [2019-09-10 06:29:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94456 states. [2019-09-10 06:29:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94456 states to 94456 states and 156334 transitions. [2019-09-10 06:29:36,021 INFO L78 Accepts]: Start accepts. Automaton has 94456 states and 156334 transitions. Word has length 352 [2019-09-10 06:29:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:36,022 INFO L475 AbstractCegarLoop]: Abstraction has 94456 states and 156334 transitions. [2019-09-10 06:29:36,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 94456 states and 156334 transitions. [2019-09-10 06:29:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-10 06:29:36,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:36,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:36,042 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:36,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:36,042 INFO L82 PathProgramCache]: Analyzing trace with hash -330552794, now seen corresponding path program 1 times [2019-09-10 06:29:36,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:36,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:36,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:36,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:36,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:36,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:36,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:29:36,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:36,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:29:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:29:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:36,535 INFO L87 Difference]: Start difference. First operand 94456 states and 156334 transitions. Second operand 7 states. [2019-09-10 06:29:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:38,506 INFO L93 Difference]: Finished difference Result 298062 states and 494847 transitions. [2019-09-10 06:29:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:29:38,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2019-09-10 06:29:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:38,974 INFO L225 Difference]: With dead ends: 298062 [2019-09-10 06:29:38,974 INFO L226 Difference]: Without dead ends: 298062 [2019-09-10 06:29:38,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:29:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298062 states. [2019-09-10 06:29:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298062 to 296751. [2019-09-10 06:29:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296751 states. [2019-09-10 06:29:45,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296751 states to 296751 states and 492584 transitions. [2019-09-10 06:29:45,144 INFO L78 Accepts]: Start accepts. Automaton has 296751 states and 492584 transitions. Word has length 353 [2019-09-10 06:29:45,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:45,145 INFO L475 AbstractCegarLoop]: Abstraction has 296751 states and 492584 transitions. [2019-09-10 06:29:45,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:29:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 296751 states and 492584 transitions. [2019-09-10 06:29:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-10 06:29:45,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:45,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:45,160 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1245658498, now seen corresponding path program 1 times [2019-09-10 06:29:45,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:45,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:45,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:29:45,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:45,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:29:45,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:45,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:29:45,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:29:45,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:29:45,502 INFO L87 Difference]: Start difference. First operand 296751 states and 492584 transitions. Second operand 5 states. [2019-09-10 06:29:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:53,000 INFO L93 Difference]: Finished difference Result 911326 states and 1507891 transitions. [2019-09-10 06:29:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:29:53,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 353 [2019-09-10 06:29:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:54,498 INFO L225 Difference]: With dead ends: 911326 [2019-09-10 06:29:54,499 INFO L226 Difference]: Without dead ends: 911326 [2019-09-10 06:29:54,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:29:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911326 states. [2019-09-10 06:30:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911326 to 646948. [2019-09-10 06:30:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646948 states. [2019-09-10 06:30:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646948 states to 646948 states and 1069420 transitions. [2019-09-10 06:30:24,578 INFO L78 Accepts]: Start accepts. Automaton has 646948 states and 1069420 transitions. Word has length 353 [2019-09-10 06:30:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:24,579 INFO L475 AbstractCegarLoop]: Abstraction has 646948 states and 1069420 transitions. [2019-09-10 06:30:24,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:30:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 646948 states and 1069420 transitions. [2019-09-10 06:30:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-10 06:30:24,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:24,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:24,596 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1081301039, now seen corresponding path program 1 times [2019-09-10 06:30:24,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:24,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:24,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:24,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:24,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:30:25,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:25,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:30:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:30:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:30:25,546 INFO L87 Difference]: Start difference. First operand 646948 states and 1069420 transitions. Second operand 7 states. [2019-09-10 06:30:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:47,941 INFO L93 Difference]: Finished difference Result 2133574 states and 3514829 transitions. [2019-09-10 06:30:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:30:47,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2019-09-10 06:30:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:52,066 INFO L225 Difference]: With dead ends: 2133574 [2019-09-10 06:30:52,066 INFO L226 Difference]: Without dead ends: 2133574 [2019-09-10 06:30:52,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:30:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133574 states. [2019-09-10 06:31:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133574 to 1622760. [2019-09-10 06:31:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622760 states. [2019-09-10 06:32:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622760 states to 1622760 states and 2677379 transitions. [2019-09-10 06:32:00,569 INFO L78 Accepts]: Start accepts. Automaton has 1622760 states and 2677379 transitions. Word has length 353 [2019-09-10 06:32:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:00,569 INFO L475 AbstractCegarLoop]: Abstraction has 1622760 states and 2677379 transitions. [2019-09-10 06:32:00,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:32:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1622760 states and 2677379 transitions. [2019-09-10 06:32:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-10 06:32:00,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:00,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:32:00,593 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:00,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1692831892, now seen corresponding path program 1 times [2019-09-10 06:32:00,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:00,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:00,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:32:00,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:00,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:00,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:00,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:00,935 INFO L87 Difference]: Start difference. First operand 1622760 states and 2677379 transitions. Second operand 3 states.