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/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:52:17,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:52:17,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:52:17,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:52:17,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:52:17,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:52:17,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:52:17,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:52:17,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:52:17,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:52:17,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:52:17,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:52:17,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:52:17,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:52:17,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:52:17,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:52:17,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:52:17,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:52:17,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:52:17,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:52:17,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:52:17,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:52:17,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:52:17,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:52:17,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:52:17,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:52:17,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:52:17,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:52:17,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:52:17,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:52:17,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:52:17,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:52:17,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:52:17,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:52:17,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:52:17,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:52:17,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:52:17,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:52:17,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:52:17,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:52:17,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:52:17,120 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 04:52:17,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:52:17,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:52:17,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:52:17,136 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:52:17,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:52:17,137 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:52:17,137 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:52:17,137 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:52:17,137 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:52:17,138 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:52:17,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:52:17,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:52:17,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:52:17,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:52:17,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:52:17,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:52:17,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:52:17,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:52:17,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:52:17,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:52:17,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:52:17,140 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:52:17,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:52:17,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:52:17,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:52:17,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:52:17,142 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:52:17,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:52:17,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:52:17,142 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:52:17,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:52:17,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:52:17,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:52:17,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:52:17,189 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:52:17,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-10 04:52:17,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9297532d5/c1bca6592c8f483d8685d866603ff2d0/FLAG7c36b8273 [2019-09-10 04:52:17,811 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:52:17,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-10 04:52:17,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9297532d5/c1bca6592c8f483d8685d866603ff2d0/FLAG7c36b8273 [2019-09-10 04:52:18,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9297532d5/c1bca6592c8f483d8685d866603ff2d0 [2019-09-10 04:52:18,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:52:18,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:52:18,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:52:18,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:52:18,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:52:18,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc9efcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18, skipping insertion in model container [2019-09-10 04:52:18,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,123 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:52:18,177 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:52:18,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:52:18,579 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:52:18,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:52:18,666 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:52:18,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18 WrapperNode [2019-09-10 04:52:18,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:52:18,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:52:18,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:52:18,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:52:18,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (1/1) ... [2019-09-10 04:52:18,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:52:18,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:52:18,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:52:18,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:52:18,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (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 04:52:18,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:52:18,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:52:18,819 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:52:18,819 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:52:18,819 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:52:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:52:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:52:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:52:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:52:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:52:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:52:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:52:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:52:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:52:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:52:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:52:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:52:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:52:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:52:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:52:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:52:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:52:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:52:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:52:18,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:52:19,646 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:52:19,647 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:52:19,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:52:19 BoogieIcfgContainer [2019-09-10 04:52:19,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:52:19,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:52:19,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:52:19,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:52:19,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:52:18" (1/3) ... [2019-09-10 04:52:19,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4db696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:52:19, skipping insertion in model container [2019-09-10 04:52:19,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:18" (2/3) ... [2019-09-10 04:52:19,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4db696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:52:19, skipping insertion in model container [2019-09-10 04:52:19,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:52:19" (3/3) ... [2019-09-10 04:52:19,656 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2019-09-10 04:52:19,663 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:52:19,670 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:52:19,686 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:52:19,711 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:52:19,711 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:52:19,711 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:52:19,712 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:52:19,712 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:52:19,712 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:52:19,712 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:52:19,712 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:52:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-09-10 04:52:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 04:52:19,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:19,745 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] [2019-09-10 04:52:19,747 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1222599780, now seen corresponding path program 1 times [2019-09-10 04:52:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:19,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:19,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:19,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:20,221 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 04:52:20,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:20,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:20,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:20,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:20,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:20,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:20,272 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 5 states. [2019-09-10 04:52:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:20,407 INFO L93 Difference]: Finished difference Result 172 states and 276 transitions. [2019-09-10 04:52:20,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:52:20,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 04:52:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:20,423 INFO L225 Difference]: With dead ends: 172 [2019-09-10 04:52:20,424 INFO L226 Difference]: Without dead ends: 168 [2019-09-10 04:52:20,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-10 04:52:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-10 04:52:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-10 04:52:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-09-10 04:52:20,479 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 59 [2019-09-10 04:52:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:20,480 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-09-10 04:52:20,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2019-09-10 04:52:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 04:52:20,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:20,484 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] [2019-09-10 04:52:20,484 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:20,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:20,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1294429502, now seen corresponding path program 1 times [2019-09-10 04:52:20,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:20,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:20,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:20,757 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 04:52:20,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:20,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:52:20,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:20,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:52:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:52:20,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:52:20,763 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand 9 states. [2019-09-10 04:52:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:23,888 INFO L93 Difference]: Finished difference Result 972 states and 1487 transitions. [2019-09-10 04:52:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 04:52:23,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 04:52:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:23,901 INFO L225 Difference]: With dead ends: 972 [2019-09-10 04:52:23,902 INFO L226 Difference]: Without dead ends: 972 [2019-09-10 04:52:23,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:52:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-09-10 04:52:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 664. [2019-09-10 04:52:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-10 04:52:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1017 transitions. [2019-09-10 04:52:23,983 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1017 transitions. Word has length 88 [2019-09-10 04:52:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:23,984 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1017 transitions. [2019-09-10 04:52:23,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:52:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1017 transitions. [2019-09-10 04:52:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 04:52:23,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:23,988 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] [2019-09-10 04:52:23,989 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1877557831, now seen corresponding path program 1 times [2019-09-10 04:52:23,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:23,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:23,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:23,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:23,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:24,162 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 04:52:24,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:24,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:52:24,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:24,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:52:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:52:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:24,164 INFO L87 Difference]: Start difference. First operand 664 states and 1017 transitions. Second operand 6 states. [2019-09-10 04:52:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:25,312 INFO L93 Difference]: Finished difference Result 1284 states and 1976 transitions. [2019-09-10 04:52:25,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:52:25,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-10 04:52:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:25,322 INFO L225 Difference]: With dead ends: 1284 [2019-09-10 04:52:25,322 INFO L226 Difference]: Without dead ends: 1284 [2019-09-10 04:52:25,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:52:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-10 04:52:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 974. [2019-09-10 04:52:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-10 04:52:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1495 transitions. [2019-09-10 04:52:25,375 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1495 transitions. Word has length 89 [2019-09-10 04:52:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:25,375 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1495 transitions. [2019-09-10 04:52:25,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:52:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1495 transitions. [2019-09-10 04:52:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 04:52:25,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:25,380 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] [2019-09-10 04:52:25,380 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1476602283, now seen corresponding path program 1 times [2019-09-10 04:52:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:25,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:25,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:25,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:25,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:52:25,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:25,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:52:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:52:25,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:25,515 INFO L87 Difference]: Start difference. First operand 974 states and 1495 transitions. Second operand 6 states. [2019-09-10 04:52:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:26,828 INFO L93 Difference]: Finished difference Result 4525 states and 6980 transitions. [2019-09-10 04:52:26,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:52:26,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 04:52:26,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:26,863 INFO L225 Difference]: With dead ends: 4525 [2019-09-10 04:52:26,864 INFO L226 Difference]: Without dead ends: 4525 [2019-09-10 04:52:26,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:52:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2019-09-10 04:52:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4499. [2019-09-10 04:52:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-09-10 04:52:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 6940 transitions. [2019-09-10 04:52:27,066 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 6940 transitions. Word has length 90 [2019-09-10 04:52:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:27,067 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 6940 transitions. [2019-09-10 04:52:27,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:52:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 6940 transitions. [2019-09-10 04:52:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 04:52:27,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:27,073 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] [2019-09-10 04:52:27,073 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1983567120, now seen corresponding path program 1 times [2019-09-10 04:52:27,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:27,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:27,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:27,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:27,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:27,249 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 04:52:27,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:27,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:52:27,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:27,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:52:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:52:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:27,252 INFO L87 Difference]: Start difference. First operand 4499 states and 6940 transitions. Second operand 6 states. [2019-09-10 04:52:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:28,602 INFO L93 Difference]: Finished difference Result 18594 states and 28664 transitions. [2019-09-10 04:52:28,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:52:28,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 04:52:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:28,722 INFO L225 Difference]: With dead ends: 18594 [2019-09-10 04:52:28,723 INFO L226 Difference]: Without dead ends: 18594 [2019-09-10 04:52:28,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:52:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18594 states. [2019-09-10 04:52:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18594 to 18508. [2019-09-10 04:52:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-09-10 04:52:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 28504 transitions. [2019-09-10 04:52:29,290 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 28504 transitions. Word has length 91 [2019-09-10 04:52:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:29,291 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 28504 transitions. [2019-09-10 04:52:29,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:52:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 28504 transitions. [2019-09-10 04:52:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:52:29,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:29,294 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] [2019-09-10 04:52:29,294 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:29,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1312570520, now seen corresponding path program 1 times [2019-09-10 04:52:29,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:29,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:29,380 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 04:52:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:29,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:52:29,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:29,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:52:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:52:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:52:29,383 INFO L87 Difference]: Start difference. First operand 18508 states and 28504 transitions. Second operand 4 states. [2019-09-10 04:52:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:29,714 INFO L93 Difference]: Finished difference Result 47509 states and 72548 transitions. [2019-09-10 04:52:29,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:52:29,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-10 04:52:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:29,926 INFO L225 Difference]: With dead ends: 47509 [2019-09-10 04:52:29,926 INFO L226 Difference]: Without dead ends: 47509 [2019-09-10 04:52:29,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:52:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47509 states. [2019-09-10 04:52:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47509 to 46966. [2019-09-10 04:52:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46966 states. [2019-09-10 04:52:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46966 states to 46966 states and 71832 transitions. [2019-09-10 04:52:31,912 INFO L78 Accepts]: Start accepts. Automaton has 46966 states and 71832 transitions. Word has length 93 [2019-09-10 04:52:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:31,912 INFO L475 AbstractCegarLoop]: Abstraction has 46966 states and 71832 transitions. [2019-09-10 04:52:31,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:52:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 46966 states and 71832 transitions. [2019-09-10 04:52:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:52:31,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:31,916 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] [2019-09-10 04:52:31,916 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:31,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1013214077, now seen corresponding path program 1 times [2019-09-10 04:52:31,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:31,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:31,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:31,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:31,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:31,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:31,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:31,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:31,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:31,998 INFO L87 Difference]: Start difference. First operand 46966 states and 71832 transitions. Second operand 5 states. [2019-09-10 04:52:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:34,304 INFO L93 Difference]: Finished difference Result 95528 states and 148460 transitions. [2019-09-10 04:52:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:52:34,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 04:52:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:34,668 INFO L225 Difference]: With dead ends: 95528 [2019-09-10 04:52:34,668 INFO L226 Difference]: Without dead ends: 95528 [2019-09-10 04:52:34,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:52:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95528 states. [2019-09-10 04:52:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95528 to 95073. [2019-09-10 04:52:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95073 states. [2019-09-10 04:52:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95073 states to 95073 states and 147032 transitions. [2019-09-10 04:52:36,978 INFO L78 Accepts]: Start accepts. Automaton has 95073 states and 147032 transitions. Word has length 94 [2019-09-10 04:52:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:36,979 INFO L475 AbstractCegarLoop]: Abstraction has 95073 states and 147032 transitions. [2019-09-10 04:52:36,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 95073 states and 147032 transitions. [2019-09-10 04:52:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:52:36,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:36,983 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] [2019-09-10 04:52:36,983 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash -27207661, now seen corresponding path program 1 times [2019-09-10 04:52:36,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:36,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:37,175 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 04:52:37,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:37,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:37,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:37,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:37,179 INFO L87 Difference]: Start difference. First operand 95073 states and 147032 transitions. Second operand 5 states. [2019-09-10 04:52:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:40,228 INFO L93 Difference]: Finished difference Result 187866 states and 286862 transitions. [2019-09-10 04:52:40,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:52:40,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 04:52:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:40,830 INFO L225 Difference]: With dead ends: 187866 [2019-09-10 04:52:40,830 INFO L226 Difference]: Without dead ends: 187866 [2019-09-10 04:52:40,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:52:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187866 states. [2019-09-10 04:52:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187866 to 187864. [2019-09-10 04:52:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187864 states. [2019-09-10 04:52:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187864 states to 187864 states and 286861 transitions. [2019-09-10 04:52:44,017 INFO L78 Accepts]: Start accepts. Automaton has 187864 states and 286861 transitions. Word has length 95 [2019-09-10 04:52:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:44,018 INFO L475 AbstractCegarLoop]: Abstraction has 187864 states and 286861 transitions. [2019-09-10 04:52:44,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 187864 states and 286861 transitions. [2019-09-10 04:52:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:52:44,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:44,025 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] [2019-09-10 04:52:44,025 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1036384240, now seen corresponding path program 1 times [2019-09-10 04:52:44,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:44,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:44,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:44,178 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 04:52:44,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:44,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:52:44,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:44,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:52:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:52:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:52:44,180 INFO L87 Difference]: Start difference. First operand 187864 states and 286861 transitions. Second operand 11 states. [2019-09-10 04:52:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:49,049 INFO L93 Difference]: Finished difference Result 266763 states and 425189 transitions. [2019-09-10 04:52:49,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 04:52:49,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-09-10 04:52:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:50,580 INFO L225 Difference]: With dead ends: 266763 [2019-09-10 04:52:50,581 INFO L226 Difference]: Without dead ends: 266763 [2019-09-10 04:52:50,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 04:52:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266763 states. [2019-09-10 04:52:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266763 to 197311. [2019-09-10 04:52:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197311 states. [2019-09-10 04:53:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197311 states to 197311 states and 305046 transitions. [2019-09-10 04:53:00,440 INFO L78 Accepts]: Start accepts. Automaton has 197311 states and 305046 transitions. Word has length 95 [2019-09-10 04:53:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:00,440 INFO L475 AbstractCegarLoop]: Abstraction has 197311 states and 305046 transitions. [2019-09-10 04:53:00,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:53:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 197311 states and 305046 transitions. [2019-09-10 04:53:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:53:00,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:00,447 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] [2019-09-10 04:53:00,447 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1101664622, now seen corresponding path program 1 times [2019-09-10 04:53:00,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:00,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:00,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:00,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:00,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:00,555 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 04:53:00,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:00,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:53:00,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:00,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:53:00,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:53:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:53:00,557 INFO L87 Difference]: Start difference. First operand 197311 states and 305046 transitions. Second operand 7 states. [2019-09-10 04:53:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:53:02,311 INFO L93 Difference]: Finished difference Result 271463 states and 420687 transitions. [2019-09-10 04:53:02,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:53:02,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 04:53:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:53:07,203 INFO L225 Difference]: With dead ends: 271463 [2019-09-10 04:53:07,204 INFO L226 Difference]: Without dead ends: 271463 [2019-09-10 04:53:07,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:53:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271463 states. [2019-09-10 04:53:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271463 to 270585. [2019-09-10 04:53:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270585 states. [2019-09-10 04:53:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270585 states to 270585 states and 419206 transitions. [2019-09-10 04:53:11,545 INFO L78 Accepts]: Start accepts. Automaton has 270585 states and 419206 transitions. Word has length 95 [2019-09-10 04:53:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:11,546 INFO L475 AbstractCegarLoop]: Abstraction has 270585 states and 419206 transitions. [2019-09-10 04:53:11,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:53:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 270585 states and 419206 transitions. [2019-09-10 04:53:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:53:11,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:11,552 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] [2019-09-10 04:53:11,553 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1444462806, now seen corresponding path program 1 times [2019-09-10 04:53:11,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:11,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:11,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:11,711 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 04:53:11,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:11,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:53:11,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:11,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:53:11,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:53:11,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:53:11,712 INFO L87 Difference]: Start difference. First operand 270585 states and 419206 transitions. Second operand 11 states. [2019-09-10 04:53:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:53:15,687 INFO L93 Difference]: Finished difference Result 367887 states and 591937 transitions. [2019-09-10 04:53:15,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 04:53:15,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-09-10 04:53:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:53:16,744 INFO L225 Difference]: With dead ends: 367887 [2019-09-10 04:53:16,744 INFO L226 Difference]: Without dead ends: 367885 [2019-09-10 04:53:16,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 04:53:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367885 states. [2019-09-10 04:53:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367885 to 267049. [2019-09-10 04:53:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267049 states. [2019-09-10 04:53:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267049 states to 267049 states and 410276 transitions. [2019-09-10 04:53:29,277 INFO L78 Accepts]: Start accepts. Automaton has 267049 states and 410276 transitions. Word has length 95 [2019-09-10 04:53:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:29,278 INFO L475 AbstractCegarLoop]: Abstraction has 267049 states and 410276 transitions. [2019-09-10 04:53:29,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:53:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 267049 states and 410276 transitions. [2019-09-10 04:53:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:53:29,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:29,282 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] [2019-09-10 04:53:29,282 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1417757155, now seen corresponding path program 1 times [2019-09-10 04:53:29,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:29,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:29,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:29,375 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 04:53:29,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:29,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:53:29,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:29,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:53:29,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:53:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:53:29,377 INFO L87 Difference]: Start difference. First operand 267049 states and 410276 transitions. Second operand 5 states. [2019-09-10 04:53:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:53:32,365 INFO L93 Difference]: Finished difference Result 362495 states and 556816 transitions. [2019-09-10 04:53:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:53:32,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-10 04:53:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:53:33,365 INFO L225 Difference]: With dead ends: 362495 [2019-09-10 04:53:33,365 INFO L226 Difference]: Without dead ends: 362495 [2019-09-10 04:53:33,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:53:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362495 states. [2019-09-10 04:53:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362495 to 350857. [2019-09-10 04:53:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350857 states. [2019-09-10 04:53:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350857 states to 350857 states and 538923 transitions. [2019-09-10 04:53:45,242 INFO L78 Accepts]: Start accepts. Automaton has 350857 states and 538923 transitions. Word has length 96 [2019-09-10 04:53:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:45,242 INFO L475 AbstractCegarLoop]: Abstraction has 350857 states and 538923 transitions. [2019-09-10 04:53:45,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:53:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 350857 states and 538923 transitions. [2019-09-10 04:53:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:53:45,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:45,246 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] [2019-09-10 04:53:45,247 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1696645317, now seen corresponding path program 1 times [2019-09-10 04:53:45,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:45,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:45,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:45,289 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 04:53:45,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:45,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:53:45,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:45,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:53:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:53:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:53:45,291 INFO L87 Difference]: Start difference. First operand 350857 states and 538923 transitions. Second operand 3 states. [2019-09-10 04:53:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:53:53,239 INFO L93 Difference]: Finished difference Result 350959 states and 539047 transitions. [2019-09-10 04:53:53,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:53:53,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 04:53:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:53:54,215 INFO L225 Difference]: With dead ends: 350959 [2019-09-10 04:53:54,215 INFO L226 Difference]: Without dead ends: 350959 [2019-09-10 04:53:54,215 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 04:53:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350959 states. [2019-09-10 04:53:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350959 to 350859. [2019-09-10 04:53:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350859 states. [2019-09-10 04:54:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350859 states to 350859 states and 538925 transitions. [2019-09-10 04:54:00,470 INFO L78 Accepts]: Start accepts. Automaton has 350859 states and 538925 transitions. Word has length 96 [2019-09-10 04:54:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:54:00,470 INFO L475 AbstractCegarLoop]: Abstraction has 350859 states and 538925 transitions. [2019-09-10 04:54:00,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:54:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 350859 states and 538925 transitions. [2019-09-10 04:54:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:54:00,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:54:00,474 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] [2019-09-10 04:54:00,474 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:54:00,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:54:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546431, now seen corresponding path program 1 times [2019-09-10 04:54:00,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:54:00,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:00,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:54:00,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:00,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:54:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:54:00,570 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 04:54:00,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:54:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:54:00,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:54:00,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:54:00,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:54:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:54:00,572 INFO L87 Difference]: Start difference. First operand 350859 states and 538925 transitions. Second operand 4 states. [2019-09-10 04:54:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:54:01,740 INFO L93 Difference]: Finished difference Result 350915 states and 539001 transitions. [2019-09-10 04:54:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:54:01,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 04:54:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:54:09,107 INFO L225 Difference]: With dead ends: 350915 [2019-09-10 04:54:09,107 INFO L226 Difference]: Without dead ends: 350856 [2019-09-10 04:54:09,107 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 04:54:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350856 states. [2019-09-10 04:54:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350856 to 350856. [2019-09-10 04:54:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350856 states. [2019-09-10 04:54:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350856 states to 350856 states and 538919 transitions. [2019-09-10 04:54:15,684 INFO L78 Accepts]: Start accepts. Automaton has 350856 states and 538919 transitions. Word has length 97 [2019-09-10 04:54:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:54:15,684 INFO L475 AbstractCegarLoop]: Abstraction has 350856 states and 538919 transitions. [2019-09-10 04:54:15,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:54:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 350856 states and 538919 transitions. [2019-09-10 04:54:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:54:15,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:54:15,687 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] [2019-09-10 04:54:15,687 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:54:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:54:15,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1912897000, now seen corresponding path program 1 times [2019-09-10 04:54:15,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:54:15,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:15,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:54:15,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:15,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:54:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:54:15,800 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 04:54:15,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:54:15,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:54:15,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:54:15,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:54:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:54:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:54:15,802 INFO L87 Difference]: Start difference. First operand 350856 states and 538919 transitions. Second operand 5 states. [2019-09-10 04:54:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:54:19,549 INFO L93 Difference]: Finished difference Result 524140 states and 795247 transitions. [2019-09-10 04:54:19,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:54:19,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 04:54:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:54:21,017 INFO L225 Difference]: With dead ends: 524140 [2019-09-10 04:54:21,018 INFO L226 Difference]: Without dead ends: 524140 [2019-09-10 04:54:21,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:54:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524140 states. [2019-09-10 04:54:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524140 to 524138. [2019-09-10 04:54:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524138 states. [2019-09-10 04:54:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524138 states to 524138 states and 795246 transitions. [2019-09-10 04:54:45,983 INFO L78 Accepts]: Start accepts. Automaton has 524138 states and 795246 transitions. Word has length 97 [2019-09-10 04:54:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:54:45,984 INFO L475 AbstractCegarLoop]: Abstraction has 524138 states and 795246 transitions. [2019-09-10 04:54:45,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:54:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 524138 states and 795246 transitions. [2019-09-10 04:54:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:54:45,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:54:45,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:54:45,988 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:54:45,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:54:45,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1016547523, now seen corresponding path program 1 times [2019-09-10 04:54:45,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:54:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:45,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:54:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:45,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:54:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:54:46,101 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 04:54:46,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:54:46,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:54:46,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:54:46,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:54:46,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:54:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:54:46,103 INFO L87 Difference]: Start difference. First operand 524138 states and 795246 transitions. Second operand 5 states. [2019-09-10 04:55:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:00,022 INFO L93 Difference]: Finished difference Result 1021118 states and 1525285 transitions. [2019-09-10 04:55:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:55:00,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 04:55:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:02,744 INFO L225 Difference]: With dead ends: 1021118 [2019-09-10 04:55:02,744 INFO L226 Difference]: Without dead ends: 1021118 [2019-09-10 04:55:02,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:55:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021118 states. [2019-09-10 04:55:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021118 to 1021116. [2019-09-10 04:55:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021116 states. [2019-09-10 04:55:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021116 states to 1021116 states and 1525284 transitions. [2019-09-10 04:55:37,560 INFO L78 Accepts]: Start accepts. Automaton has 1021116 states and 1525284 transitions. Word has length 98 [2019-09-10 04:55:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:37,560 INFO L475 AbstractCegarLoop]: Abstraction has 1021116 states and 1525284 transitions. [2019-09-10 04:55:37,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:55:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1021116 states and 1525284 transitions. [2019-09-10 04:55:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:55:37,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:37,567 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] [2019-09-10 04:55:37,567 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:37,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash -617847026, now seen corresponding path program 1 times [2019-09-10 04:55:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:37,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:37,681 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 04:55:37,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:37,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:55:37,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:37,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:55:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:55:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:55:37,683 INFO L87 Difference]: Start difference. First operand 1021116 states and 1525284 transitions. Second operand 5 states. [2019-09-10 04:55:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:59,878 INFO L93 Difference]: Finished difference Result 1617845 states and 2377023 transitions. [2019-09-10 04:55:59,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:55:59,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 04:55:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:56:05,690 INFO L225 Difference]: With dead ends: 1617845 [2019-09-10 04:56:05,691 INFO L226 Difference]: Without dead ends: 1617845 [2019-09-10 04:56:05,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:56:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617845 states.