java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:50:22,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:50:22,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:50:22,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:50:22,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:50:22,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:50:22,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:50:22,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:50:22,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:50:22,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:50:22,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:50:22,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:50:22,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:50:22,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:50:22,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:50:22,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:50:22,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:50:22,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:50:22,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:50:22,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:50:22,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:50:22,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:50:22,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:50:22,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:50:22,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:50:22,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:50:22,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:50:22,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:50:22,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:50:22,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:50:22,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:50:22,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:50:22,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:50:22,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:50:22,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:50:22,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:50:22,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:50:22,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:50:22,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:50:22,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:50:22,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:50:22,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:50:22,465 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:50:22,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:50:22,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:50:22,466 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:50:22,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:50:22,468 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:50:22,468 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:50:22,468 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:50:22,468 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:50:22,469 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:50:22,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:50:22,472 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:50:22,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:50:22,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:50:22,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:50:22,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:50:22,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:50:22,473 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:50:22,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:50:22,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:50:22,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:50:22,474 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:50:22,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:50:22,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:50:22,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:50:22,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:50:22,475 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:50:22,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:50:22,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:50:22,475 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:50:22,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:50:22,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:50:22,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:50:22,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:50:22,521 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:50:22,522 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:50:22,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00059f123/61841813f401409eb1add4cac53f51e0/FLAG03f06a294 [2019-09-10 08:50:23,236 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:50:23,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:50:23,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00059f123/61841813f401409eb1add4cac53f51e0/FLAG03f06a294 [2019-09-10 08:50:23,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00059f123/61841813f401409eb1add4cac53f51e0 [2019-09-10 08:50:23,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:50:23,451 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:50:23,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:50:23,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:50:23,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:50:23,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:50:23" (1/1) ... [2019-09-10 08:50:23,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3c99dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:23, skipping insertion in model container [2019-09-10 08:50:23,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:50:23" (1/1) ... [2019-09-10 08:50:23,469 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:50:23,575 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:50:24,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:50:24,385 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:50:24,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:50:24,837 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:50:24,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24 WrapperNode [2019-09-10 08:50:24,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:50:24,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:50:24,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:50:24,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:50:24,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... [2019-09-10 08:50:24,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... [2019-09-10 08:50:24,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... [2019-09-10 08:50:24,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... [2019-09-10 08:50:24,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... [2019-09-10 08:50:24,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... [2019-09-10 08:50:24,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... [2019-09-10 08:50:24,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:50:24,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:50:24,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:50:24,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:50:24,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:50:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:50:25,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:50:25,062 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:50:25,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:50:25,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:50:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:50:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:50:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:50:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:50:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:50:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:50:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:50:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:50:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:50:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:50:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:50:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:50:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:50:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:50:27,534 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:50:27,534 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:50:27,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:50:27 BoogieIcfgContainer [2019-09-10 08:50:27,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:50:27,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:50:27,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:50:27,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:50:27,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:50:23" (1/3) ... [2019-09-10 08:50:27,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae9c15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:50:27, skipping insertion in model container [2019-09-10 08:50:27,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:50:24" (2/3) ... [2019-09-10 08:50:27,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae9c15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:50:27, skipping insertion in model container [2019-09-10 08:50:27,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:50:27" (3/3) ... [2019-09-10 08:50:27,544 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 08:50:27,554 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:50:27,562 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 08:50:27,579 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 08:50:27,606 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:50:27,607 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:50:27,607 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:50:27,607 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:50:27,607 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:50:27,607 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:50:27,607 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:50:27,608 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:50:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states. [2019-09-10 08:50:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 08:50:27,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:27,677 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] [2019-09-10 08:50:27,679 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1175145062, now seen corresponding path program 1 times [2019-09-10 08:50:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:27,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:29,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:29,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:29,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:29,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:29,138 INFO L87 Difference]: Start difference. First operand 676 states. Second operand 4 states. [2019-09-10 08:50:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:29,444 INFO L93 Difference]: Finished difference Result 1320 states and 2339 transitions. [2019-09-10 08:50:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:50:29,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-09-10 08:50:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:29,478 INFO L225 Difference]: With dead ends: 1320 [2019-09-10 08:50:29,478 INFO L226 Difference]: Without dead ends: 1312 [2019-09-10 08:50:29,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-09-10 08:50:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1276. [2019-09-10 08:50:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-09-10 08:50:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1995 transitions. [2019-09-10 08:50:29,617 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1995 transitions. Word has length 247 [2019-09-10 08:50:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:29,618 INFO L475 AbstractCegarLoop]: Abstraction has 1276 states and 1995 transitions. [2019-09-10 08:50:29,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1995 transitions. [2019-09-10 08:50:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 08:50:29,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:29,627 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] [2019-09-10 08:50:29,628 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1529579486, now seen corresponding path program 1 times [2019-09-10 08:50:29,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:29,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:29,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:29,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:29,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:29,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:29,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:29,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:29,908 INFO L87 Difference]: Start difference. First operand 1276 states and 1995 transitions. Second operand 3 states. [2019-09-10 08:50:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:30,066 INFO L93 Difference]: Finished difference Result 2501 states and 3889 transitions. [2019-09-10 08:50:30,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:30,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-10 08:50:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:30,080 INFO L225 Difference]: With dead ends: 2501 [2019-09-10 08:50:30,081 INFO L226 Difference]: Without dead ends: 2501 [2019-09-10 08:50:30,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2019-09-10 08:50:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2467. [2019-09-10 08:50:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-09-10 08:50:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3843 transitions. [2019-09-10 08:50:30,144 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3843 transitions. Word has length 249 [2019-09-10 08:50:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:30,145 INFO L475 AbstractCegarLoop]: Abstraction has 2467 states and 3843 transitions. [2019-09-10 08:50:30,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3843 transitions. [2019-09-10 08:50:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 08:50:30,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:30,153 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] [2019-09-10 08:50:30,153 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash -810008519, now seen corresponding path program 1 times [2019-09-10 08:50:30,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:30,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:30,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:30,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:30,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:30,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:30,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:30,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:30,264 INFO L87 Difference]: Start difference. First operand 2467 states and 3843 transitions. Second operand 3 states. [2019-09-10 08:50:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:30,351 INFO L93 Difference]: Finished difference Result 4901 states and 7626 transitions. [2019-09-10 08:50:30,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:30,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-10 08:50:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:30,396 INFO L225 Difference]: With dead ends: 4901 [2019-09-10 08:50:30,396 INFO L226 Difference]: Without dead ends: 4901 [2019-09-10 08:50:30,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2019-09-10 08:50:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 2486. [2019-09-10 08:50:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-09-10 08:50:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3871 transitions. [2019-09-10 08:50:30,528 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3871 transitions. Word has length 249 [2019-09-10 08:50:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:30,529 INFO L475 AbstractCegarLoop]: Abstraction has 2486 states and 3871 transitions. [2019-09-10 08:50:30,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3871 transitions. [2019-09-10 08:50:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 08:50:30,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:30,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:30,543 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:30,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1379810240, now seen corresponding path program 1 times [2019-09-10 08:50:30,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:30,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:30,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:30,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:30,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:30,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:30,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:30,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:30,835 INFO L87 Difference]: Start difference. First operand 2486 states and 3871 transitions. Second operand 3 states. [2019-09-10 08:50:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:30,934 INFO L93 Difference]: Finished difference Result 4919 states and 7647 transitions. [2019-09-10 08:50:30,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:30,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-09-10 08:50:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:30,968 INFO L225 Difference]: With dead ends: 4919 [2019-09-10 08:50:30,968 INFO L226 Difference]: Without dead ends: 4919 [2019-09-10 08:50:30,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2019-09-10 08:50:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 2504. [2019-09-10 08:50:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-10 08:50:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3892 transitions. [2019-09-10 08:50:31,098 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3892 transitions. Word has length 250 [2019-09-10 08:50:31,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:31,098 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3892 transitions. [2019-09-10 08:50:31,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3892 transitions. [2019-09-10 08:50:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 08:50:31,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:31,109 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] [2019-09-10 08:50:31,109 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:31,110 INFO L82 PathProgramCache]: Analyzing trace with hash 697546131, now seen corresponding path program 1 times [2019-09-10 08:50:31,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:31,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:31,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:31,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:31,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:31,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:31,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:31,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:31,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:31,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:31,340 INFO L87 Difference]: Start difference. First operand 2504 states and 3892 transitions. Second operand 3 states. [2019-09-10 08:50:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:31,431 INFO L93 Difference]: Finished difference Result 3352 states and 5241 transitions. [2019-09-10 08:50:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:31,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-10 08:50:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:31,452 INFO L225 Difference]: With dead ends: 3352 [2019-09-10 08:50:31,452 INFO L226 Difference]: Without dead ends: 3352 [2019-09-10 08:50:31,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2019-09-10 08:50:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 2992. [2019-09-10 08:50:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2019-09-10 08:50:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 4698 transitions. [2019-09-10 08:50:31,540 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 4698 transitions. Word has length 251 [2019-09-10 08:50:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:31,541 INFO L475 AbstractCegarLoop]: Abstraction has 2992 states and 4698 transitions. [2019-09-10 08:50:31,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 4698 transitions. [2019-09-10 08:50:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 08:50:31,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:31,550 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] [2019-09-10 08:50:31,550 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash -731341597, now seen corresponding path program 1 times [2019-09-10 08:50:31,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:31,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:31,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:31,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:31,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:31,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:31,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:31,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:31,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:31,871 INFO L87 Difference]: Start difference. First operand 2992 states and 4698 transitions. Second operand 3 states. [2019-09-10 08:50:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:32,050 INFO L93 Difference]: Finished difference Result 5769 states and 8994 transitions. [2019-09-10 08:50:32,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:32,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-10 08:50:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:32,086 INFO L225 Difference]: With dead ends: 5769 [2019-09-10 08:50:32,086 INFO L226 Difference]: Without dead ends: 5769 [2019-09-10 08:50:32,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-09-10 08:50:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5737. [2019-09-10 08:50:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2019-09-10 08:50:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 8952 transitions. [2019-09-10 08:50:32,299 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 8952 transitions. Word has length 251 [2019-09-10 08:50:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:32,299 INFO L475 AbstractCegarLoop]: Abstraction has 5737 states and 8952 transitions. [2019-09-10 08:50:32,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 8952 transitions. [2019-09-10 08:50:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 08:50:32,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:32,328 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] [2019-09-10 08:50:32,328 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash 816882406, now seen corresponding path program 1 times [2019-09-10 08:50:32,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:32,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:32,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:32,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:32,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:32,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:32,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:32,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:32,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:32,690 INFO L87 Difference]: Start difference. First operand 5737 states and 8952 transitions. Second operand 4 states. [2019-09-10 08:50:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:32,801 INFO L93 Difference]: Finished difference Result 10490 states and 16280 transitions. [2019-09-10 08:50:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:32,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-10 08:50:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:32,849 INFO L225 Difference]: With dead ends: 10490 [2019-09-10 08:50:32,849 INFO L226 Difference]: Without dead ends: 10490 [2019-09-10 08:50:32,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2019-09-10 08:50:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 5972. [2019-09-10 08:50:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5972 states. [2019-09-10 08:50:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 9340 transitions. [2019-09-10 08:50:33,022 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 9340 transitions. Word has length 251 [2019-09-10 08:50:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:33,022 INFO L475 AbstractCegarLoop]: Abstraction has 5972 states and 9340 transitions. [2019-09-10 08:50:33,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 9340 transitions. [2019-09-10 08:50:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 08:50:33,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:33,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:33,036 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:33,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1584390844, now seen corresponding path program 1 times [2019-09-10 08:50:33,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:33,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:33,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:33,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:33,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:33,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:33,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:33,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:33,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:33,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:33,257 INFO L87 Difference]: Start difference. First operand 5972 states and 9340 transitions. Second operand 3 states. [2019-09-10 08:50:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:33,369 INFO L93 Difference]: Finished difference Result 8313 states and 13112 transitions. [2019-09-10 08:50:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:33,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 08:50:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:33,388 INFO L225 Difference]: With dead ends: 8313 [2019-09-10 08:50:33,389 INFO L226 Difference]: Without dead ends: 8313 [2019-09-10 08:50:33,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8313 states. [2019-09-10 08:50:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8313 to 7696. [2019-09-10 08:50:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7696 states. [2019-09-10 08:50:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7696 states to 7696 states and 12172 transitions. [2019-09-10 08:50:33,532 INFO L78 Accepts]: Start accepts. Automaton has 7696 states and 12172 transitions. Word has length 253 [2019-09-10 08:50:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:33,532 INFO L475 AbstractCegarLoop]: Abstraction has 7696 states and 12172 transitions. [2019-09-10 08:50:33,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 7696 states and 12172 transitions. [2019-09-10 08:50:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 08:50:33,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:33,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:33,547 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:33,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:33,547 INFO L82 PathProgramCache]: Analyzing trace with hash -551410647, now seen corresponding path program 1 times [2019-09-10 08:50:33,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:33,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:33,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:33,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:33,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:33,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:33,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:33,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:33,682 INFO L87 Difference]: Start difference. First operand 7696 states and 12172 transitions. Second operand 3 states. [2019-09-10 08:50:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:33,761 INFO L93 Difference]: Finished difference Result 14625 states and 22988 transitions. [2019-09-10 08:50:33,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:33,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 08:50:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:33,798 INFO L225 Difference]: With dead ends: 14625 [2019-09-10 08:50:33,798 INFO L226 Difference]: Without dead ends: 14625 [2019-09-10 08:50:33,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14625 states. [2019-09-10 08:50:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14625 to 7800. [2019-09-10 08:50:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7800 states. [2019-09-10 08:50:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7800 states to 7800 states and 12315 transitions. [2019-09-10 08:50:34,004 INFO L78 Accepts]: Start accepts. Automaton has 7800 states and 12315 transitions. Word has length 253 [2019-09-10 08:50:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:34,005 INFO L475 AbstractCegarLoop]: Abstraction has 7800 states and 12315 transitions. [2019-09-10 08:50:34,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7800 states and 12315 transitions. [2019-09-10 08:50:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:50:34,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:34,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:34,019 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:34,019 INFO L82 PathProgramCache]: Analyzing trace with hash -473843140, now seen corresponding path program 1 times [2019-09-10 08:50:34,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:34,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:34,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:34,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:34,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:34,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:50:34,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:34,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:50:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:50:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:34,426 INFO L87 Difference]: Start difference. First operand 7800 states and 12315 transitions. Second operand 5 states. [2019-09-10 08:50:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:35,082 INFO L93 Difference]: Finished difference Result 12718 states and 20176 transitions. [2019-09-10 08:50:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:50:35,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 254 [2019-09-10 08:50:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:35,110 INFO L225 Difference]: With dead ends: 12718 [2019-09-10 08:50:35,110 INFO L226 Difference]: Without dead ends: 12718 [2019-09-10 08:50:35,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 08:50:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12718 states. [2019-09-10 08:50:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12718 to 12716. [2019-09-10 08:50:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12716 states. [2019-09-10 08:50:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12716 states to 12716 states and 20175 transitions. [2019-09-10 08:50:35,321 INFO L78 Accepts]: Start accepts. Automaton has 12716 states and 20175 transitions. Word has length 254 [2019-09-10 08:50:35,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:35,321 INFO L475 AbstractCegarLoop]: Abstraction has 12716 states and 20175 transitions. [2019-09-10 08:50:35,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:50:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 12716 states and 20175 transitions. [2019-09-10 08:50:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:50:35,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:35,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:35,337 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash -873233055, now seen corresponding path program 1 times [2019-09-10 08:50:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:35,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:35,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:35,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:35,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:35,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:35,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:50:35,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:35,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:50:35,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:50:35,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:50:35,850 INFO L87 Difference]: Start difference. First operand 12716 states and 20175 transitions. Second operand 9 states. [2019-09-10 08:50:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:37,265 INFO L93 Difference]: Finished difference Result 29664 states and 46582 transitions. [2019-09-10 08:50:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:50:37,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 254 [2019-09-10 08:50:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:37,338 INFO L225 Difference]: With dead ends: 29664 [2019-09-10 08:50:37,338 INFO L226 Difference]: Without dead ends: 29664 [2019-09-10 08:50:37,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:50:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29664 states. [2019-09-10 08:50:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29664 to 15960. [2019-09-10 08:50:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15960 states. [2019-09-10 08:50:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15960 states to 15960 states and 24847 transitions. [2019-09-10 08:50:37,715 INFO L78 Accepts]: Start accepts. Automaton has 15960 states and 24847 transitions. Word has length 254 [2019-09-10 08:50:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:37,716 INFO L475 AbstractCegarLoop]: Abstraction has 15960 states and 24847 transitions. [2019-09-10 08:50:37,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:50:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 15960 states and 24847 transitions. [2019-09-10 08:50:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:50:37,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:37,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:37,734 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash -608288722, now seen corresponding path program 1 times [2019-09-10 08:50:37,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:37,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:37,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:37,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:37,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:38,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:38,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:38,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:38,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:38,708 INFO L87 Difference]: Start difference. First operand 15960 states and 24847 transitions. Second operand 4 states. [2019-09-10 08:50:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:38,951 INFO L93 Difference]: Finished difference Result 30983 states and 48039 transitions. [2019-09-10 08:50:38,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:38,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-10 08:50:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:39,031 INFO L225 Difference]: With dead ends: 30983 [2019-09-10 08:50:39,031 INFO L226 Difference]: Without dead ends: 30983 [2019-09-10 08:50:39,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30983 states. [2019-09-10 08:50:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30983 to 30956. [2019-09-10 08:50:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30956 states. [2019-09-10 08:50:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30956 states to 30956 states and 48004 transitions. [2019-09-10 08:50:39,458 INFO L78 Accepts]: Start accepts. Automaton has 30956 states and 48004 transitions. Word has length 254 [2019-09-10 08:50:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:39,459 INFO L475 AbstractCegarLoop]: Abstraction has 30956 states and 48004 transitions. [2019-09-10 08:50:39,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30956 states and 48004 transitions. [2019-09-10 08:50:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 08:50:39,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:39,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:39,490 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash 760775911, now seen corresponding path program 1 times [2019-09-10 08:50:39,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:39,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:39,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:39,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:39,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:39,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:39,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:39,721 INFO L87 Difference]: Start difference. First operand 30956 states and 48004 transitions. Second operand 3 states. [2019-09-10 08:50:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:39,948 INFO L93 Difference]: Finished difference Result 60092 states and 92794 transitions. [2019-09-10 08:50:39,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:39,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 08:50:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:40,041 INFO L225 Difference]: With dead ends: 60092 [2019-09-10 08:50:40,042 INFO L226 Difference]: Without dead ends: 60092 [2019-09-10 08:50:40,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60092 states. [2019-09-10 08:50:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60092 to 60067. [2019-09-10 08:50:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60067 states. [2019-09-10 08:50:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60067 states to 60067 states and 92763 transitions. [2019-09-10 08:50:41,718 INFO L78 Accepts]: Start accepts. Automaton has 60067 states and 92763 transitions. Word has length 256 [2019-09-10 08:50:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:41,718 INFO L475 AbstractCegarLoop]: Abstraction has 60067 states and 92763 transitions. [2019-09-10 08:50:41,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 60067 states and 92763 transitions. [2019-09-10 08:50:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 08:50:41,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:41,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:41,759 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1124780888, now seen corresponding path program 1 times [2019-09-10 08:50:41,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:41,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:41,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:41,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:41,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:41,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:41,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:41,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:41,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:41,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:41,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:41,876 INFO L87 Difference]: Start difference. First operand 60067 states and 92763 transitions. Second operand 3 states. [2019-09-10 08:50:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:42,216 INFO L93 Difference]: Finished difference Result 117915 states and 181634 transitions. [2019-09-10 08:50:42,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:42,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 08:50:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:42,392 INFO L225 Difference]: With dead ends: 117915 [2019-09-10 08:50:42,392 INFO L226 Difference]: Without dead ends: 117915 [2019-09-10 08:50:42,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117915 states. [2019-09-10 08:50:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117915 to 60553. [2019-09-10 08:50:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60553 states. [2019-09-10 08:50:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60553 states to 60553 states and 93316 transitions. [2019-09-10 08:50:44,978 INFO L78 Accepts]: Start accepts. Automaton has 60553 states and 93316 transitions. Word has length 256 [2019-09-10 08:50:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:44,978 INFO L475 AbstractCegarLoop]: Abstraction has 60553 states and 93316 transitions. [2019-09-10 08:50:44,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 60553 states and 93316 transitions. [2019-09-10 08:50:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 08:50:44,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:44,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:45,000 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -58340363, now seen corresponding path program 1 times [2019-09-10 08:50:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:45,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:45,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:45,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:45,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:45,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:45,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:45,162 INFO L87 Difference]: Start difference. First operand 60553 states and 93316 transitions. Second operand 3 states. [2019-09-10 08:50:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:45,456 INFO L93 Difference]: Finished difference Result 97824 states and 151776 transitions. [2019-09-10 08:50:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:45,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-10 08:50:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:45,566 INFO L225 Difference]: With dead ends: 97824 [2019-09-10 08:50:45,566 INFO L226 Difference]: Without dead ends: 97824 [2019-09-10 08:50:45,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97824 states. [2019-09-10 08:50:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97824 to 92281. [2019-09-10 08:50:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92281 states. [2019-09-10 08:50:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92281 states to 92281 states and 143204 transitions. [2019-09-10 08:50:46,793 INFO L78 Accepts]: Start accepts. Automaton has 92281 states and 143204 transitions. Word has length 257 [2019-09-10 08:50:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:46,793 INFO L475 AbstractCegarLoop]: Abstraction has 92281 states and 143204 transitions. [2019-09-10 08:50:46,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand 92281 states and 143204 transitions. [2019-09-10 08:50:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 08:50:46,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:46,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:46,818 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1872293222, now seen corresponding path program 1 times [2019-09-10 08:50:46,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:46,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:46,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:46,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:46,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:47,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:47,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:47,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:47,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:47,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:47,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:47,024 INFO L87 Difference]: Start difference. First operand 92281 states and 143204 transitions. Second operand 3 states. [2019-09-10 08:50:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:47,468 INFO L93 Difference]: Finished difference Result 181087 states and 279565 transitions. [2019-09-10 08:50:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:47,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-10 08:50:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:49,868 INFO L225 Difference]: With dead ends: 181087 [2019-09-10 08:50:49,868 INFO L226 Difference]: Without dead ends: 181087 [2019-09-10 08:50:49,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181087 states. [2019-09-10 08:50:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181087 to 181064. [2019-09-10 08:50:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181064 states. [2019-09-10 08:50:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181064 states to 181064 states and 279538 transitions. [2019-09-10 08:50:51,602 INFO L78 Accepts]: Start accepts. Automaton has 181064 states and 279538 transitions. Word has length 257 [2019-09-10 08:50:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:51,603 INFO L475 AbstractCegarLoop]: Abstraction has 181064 states and 279538 transitions. [2019-09-10 08:50:51,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 181064 states and 279538 transitions. [2019-09-10 08:50:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 08:50:51,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:51,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:51,661 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:51,662 INFO L82 PathProgramCache]: Analyzing trace with hash -638091607, now seen corresponding path program 1 times [2019-09-10 08:50:51,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:51,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:51,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:51,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:51,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:51,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:51,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:51,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:51,942 INFO L87 Difference]: Start difference. First operand 181064 states and 279538 transitions. Second operand 4 states. [2019-09-10 08:50:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:52,879 INFO L93 Difference]: Finished difference Result 329699 states and 507902 transitions. [2019-09-10 08:50:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:52,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-09-10 08:50:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:53,340 INFO L225 Difference]: With dead ends: 329699 [2019-09-10 08:50:53,340 INFO L226 Difference]: Without dead ends: 329699 [2019-09-10 08:50:53,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329699 states. [2019-09-10 08:50:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329699 to 181686. [2019-09-10 08:50:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181686 states. [2019-09-10 08:51:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181686 states to 181686 states and 280528 transitions. [2019-09-10 08:51:00,041 INFO L78 Accepts]: Start accepts. Automaton has 181686 states and 280528 transitions. Word has length 257 [2019-09-10 08:51:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:00,041 INFO L475 AbstractCegarLoop]: Abstraction has 181686 states and 280528 transitions. [2019-09-10 08:51:00,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 181686 states and 280528 transitions. [2019-09-10 08:51:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 08:51:00,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:00,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:00,079 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1979259928, now seen corresponding path program 1 times [2019-09-10 08:51:00,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:00,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:00,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:00,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:00,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:00,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:00,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:00,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:00,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:00,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:00,373 INFO L87 Difference]: Start difference. First operand 181686 states and 280528 transitions. Second operand 4 states. [2019-09-10 08:51:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:00,870 INFO L93 Difference]: Finished difference Result 167063 states and 257246 transitions. [2019-09-10 08:51:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:00,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-10 08:51:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:01,158 INFO L225 Difference]: With dead ends: 167063 [2019-09-10 08:51:01,159 INFO L226 Difference]: Without dead ends: 160837 [2019-09-10 08:51:01,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:51:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160837 states. [2019-09-10 08:51:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160837 to 160415. [2019-09-10 08:51:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160415 states. [2019-09-10 08:51:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160415 states to 160415 states and 247141 transitions. [2019-09-10 08:51:03,285 INFO L78 Accepts]: Start accepts. Automaton has 160415 states and 247141 transitions. Word has length 259 [2019-09-10 08:51:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:03,286 INFO L475 AbstractCegarLoop]: Abstraction has 160415 states and 247141 transitions. [2019-09-10 08:51:03,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 160415 states and 247141 transitions. [2019-09-10 08:51:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:51:03,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:03,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:03,317 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash 292070836, now seen corresponding path program 1 times [2019-09-10 08:51:03,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:03,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:03,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:03,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:03,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:03,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:03,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:03,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:03,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:03,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:03,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:03,462 INFO L87 Difference]: Start difference. First operand 160415 states and 247141 transitions. Second operand 3 states. [2019-09-10 08:51:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:07,244 INFO L93 Difference]: Finished difference Result 279635 states and 434049 transitions. [2019-09-10 08:51:07,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:07,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 08:51:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:07,595 INFO L225 Difference]: With dead ends: 279635 [2019-09-10 08:51:07,595 INFO L226 Difference]: Without dead ends: 279635 [2019-09-10 08:51:07,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279635 states. [2019-09-10 08:51:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279635 to 259537. [2019-09-10 08:51:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259537 states. [2019-09-10 08:51:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259537 states to 259537 states and 405666 transitions. [2019-09-10 08:51:10,189 INFO L78 Accepts]: Start accepts. Automaton has 259537 states and 405666 transitions. Word has length 260 [2019-09-10 08:51:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:10,189 INFO L475 AbstractCegarLoop]: Abstraction has 259537 states and 405666 transitions. [2019-09-10 08:51:10,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 259537 states and 405666 transitions. [2019-09-10 08:51:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:51:10,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:10,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:10,222 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash -796959044, now seen corresponding path program 1 times [2019-09-10 08:51:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:10,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:10,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:10,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:10,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:10,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:10,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:10,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:10,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:10,615 INFO L87 Difference]: Start difference. First operand 259537 states and 405666 transitions. Second operand 4 states. [2019-09-10 08:51:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:16,971 INFO L93 Difference]: Finished difference Result 488311 states and 759690 transitions. [2019-09-10 08:51:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:16,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-10 08:51:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:17,753 INFO L225 Difference]: With dead ends: 488311 [2019-09-10 08:51:17,753 INFO L226 Difference]: Without dead ends: 488311 [2019-09-10 08:51:17,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:51:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488311 states. [2019-09-10 08:51:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488311 to 488293. [2019-09-10 08:51:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488293 states. [2019-09-10 08:51:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488293 states to 488293 states and 759670 transitions. [2019-09-10 08:51:23,295 INFO L78 Accepts]: Start accepts. Automaton has 488293 states and 759670 transitions. Word has length 261 [2019-09-10 08:51:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:23,296 INFO L475 AbstractCegarLoop]: Abstraction has 488293 states and 759670 transitions. [2019-09-10 08:51:23,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 488293 states and 759670 transitions. [2019-09-10 08:51:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 08:51:23,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:23,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:23,375 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:23,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:23,376 INFO L82 PathProgramCache]: Analyzing trace with hash 2054588407, now seen corresponding path program 1 times [2019-09-10 08:51:23,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:23,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:23,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:30,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:30,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:30,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:30,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:30,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:30,696 INFO L87 Difference]: Start difference. First operand 488293 states and 759670 transitions. Second operand 3 states. [2019-09-10 08:51:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:33,095 INFO L93 Difference]: Finished difference Result 834128 states and 1295323 transitions. [2019-09-10 08:51:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:51:33,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 08:51:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:34,439 INFO L225 Difference]: With dead ends: 834128 [2019-09-10 08:51:34,440 INFO L226 Difference]: Without dead ends: 834128 [2019-09-10 08:51:34,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834128 states. [2019-09-10 08:51:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834128 to 489092. [2019-09-10 08:51:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489092 states. [2019-09-10 08:51:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489092 states to 489092 states and 760657 transitions. [2019-09-10 08:51:50,315 INFO L78 Accepts]: Start accepts. Automaton has 489092 states and 760657 transitions. Word has length 262 [2019-09-10 08:51:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:50,316 INFO L475 AbstractCegarLoop]: Abstraction has 489092 states and 760657 transitions. [2019-09-10 08:51:50,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 489092 states and 760657 transitions. [2019-09-10 08:51:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-10 08:51:51,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:51,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:51,610 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash 730703686, now seen corresponding path program 1 times [2019-09-10 08:51:51,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:51,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:51,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:51,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:51,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:51,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:51,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:51,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:51,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:51,812 INFO L87 Difference]: Start difference. First operand 489092 states and 760657 transitions. Second operand 3 states. [2019-09-10 08:52:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:02,025 INFO L93 Difference]: Finished difference Result 959027 states and 1485865 transitions. [2019-09-10 08:52:02,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:02,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-09-10 08:52:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:03,387 INFO L225 Difference]: With dead ends: 959027 [2019-09-10 08:52:03,388 INFO L226 Difference]: Without dead ends: 959027 [2019-09-10 08:52:03,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959027 states. [2019-09-10 08:52:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959027 to 958707. [2019-09-10 08:52:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958707 states. [2019-09-10 08:52:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958707 states to 958707 states and 1485469 transitions. [2019-09-10 08:52:32,494 INFO L78 Accepts]: Start accepts. Automaton has 958707 states and 1485469 transitions. Word has length 263 [2019-09-10 08:52:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:32,495 INFO L475 AbstractCegarLoop]: Abstraction has 958707 states and 1485469 transitions. [2019-09-10 08:52:32,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 958707 states and 1485469 transitions. [2019-09-10 08:52:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 08:52:32,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:32,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:52:32,622 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash -608768772, now seen corresponding path program 1 times [2019-09-10 08:52:32,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:32,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:32,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:32,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:32,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:42,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:42,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:42,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:42,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:42,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:42,474 INFO L87 Difference]: Start difference. First operand 958707 states and 1485469 transitions. Second operand 4 states. [2019-09-10 08:52:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:45,132 INFO L93 Difference]: Finished difference Result 866021 states and 1338325 transitions. [2019-09-10 08:52:45,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:45,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-09-10 08:52:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:46,428 INFO L225 Difference]: With dead ends: 866021 [2019-09-10 08:52:46,428 INFO L226 Difference]: Without dead ends: 849840 [2019-09-10 08:52:46,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849840 states. [2019-09-10 08:53:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849840 to 848622. [2019-09-10 08:53:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848622 states. [2019-09-10 08:53:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848622 states to 848622 states and 1312176 transitions. [2019-09-10 08:53:06,399 INFO L78 Accepts]: Start accepts. Automaton has 848622 states and 1312176 transitions. Word has length 264 [2019-09-10 08:53:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:06,399 INFO L475 AbstractCegarLoop]: Abstraction has 848622 states and 1312176 transitions. [2019-09-10 08:53:06,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 848622 states and 1312176 transitions. [2019-09-10 08:53:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 08:53:17,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:17,729 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] [2019-09-10 08:53:17,729 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:17,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash 805480715, now seen corresponding path program 1 times [2019-09-10 08:53:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:17,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:17,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:17,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:53:17,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:17,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:17,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:17,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:17,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:17,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:17,922 INFO L87 Difference]: Start difference. First operand 848622 states and 1312176 transitions. Second operand 3 states. [2019-09-10 08:53:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:23,814 INFO L93 Difference]: Finished difference Result 1664518 states and 2559367 transitions. [2019-09-10 08:53:23,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:23,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-10 08:53:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:26,601 INFO L225 Difference]: With dead ends: 1664518 [2019-09-10 08:53:26,602 INFO L226 Difference]: Without dead ends: 1664518 [2019-09-10 08:53:26,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664518 states. [2019-09-10 08:54:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664518 to 1664504. [2019-09-10 08:54:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664504 states.