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_floodmax.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:01:52,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:01:52,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:01:52,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:01:52,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:01:52,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:01:52,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:01:52,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:01:52,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:01:52,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:01:52,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:01:52,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:01:52,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:01:52,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:01:52,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:01:52,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:01:52,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:01:52,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:01:52,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:01:52,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:01:52,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:01:52,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:01:52,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:01:52,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:01:52,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:01:52,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:01:52,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:01:52,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:01:52,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:01:52,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:01:52,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:01:52,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:01:52,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:01:52,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:01:52,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:01:52,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:01:52,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:01:52,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:01:52,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:01:52,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:01:52,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:01:52,130 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:01:52,153 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:01:52,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:01:52,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:01:52,154 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:01:52,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:01:52,155 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:01:52,155 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:01:52,155 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:01:52,155 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:01:52,156 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:01:52,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:01:52,156 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:01:52,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:01:52,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:01:52,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:01:52,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:01:52,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:01:52,158 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:01:52,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:01:52,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:01:52,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:01:52,159 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:01:52,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:01:52,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:01:52,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:01:52,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:01:52,160 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:01:52,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:01:52,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:01:52,160 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:01:52,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:01:52,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:01:52,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:01:52,208 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:01:52,209 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:01:52,209 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:52,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/487b49155/53945d7dcb80408399e7ebdc8eeea7ae/FLAG0deeb0ecb [2019-09-10 04:01:52,803 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:01:52,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:52,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/487b49155/53945d7dcb80408399e7ebdc8eeea7ae/FLAG0deeb0ecb [2019-09-10 04:01:53,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/487b49155/53945d7dcb80408399e7ebdc8eeea7ae [2019-09-10 04:01:53,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:01:53,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:01:53,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:53,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:01:53,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:01:53,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff1afcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53, skipping insertion in model container [2019-09-10 04:01:53,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,170 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:01:53,236 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:01:53,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:53,691 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:01:53,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:53,826 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:01:53,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53 WrapperNode [2019-09-10 04:01:53,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:53,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:01:53,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:01:53,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:01:53,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (1/1) ... [2019-09-10 04:01:53,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:01:53,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:01:53,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:01:53,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:01:53,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (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:01:54,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:01:54,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:01:54,005 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:01:54,006 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:01:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:01:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:01:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:01:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:01:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:01:54,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:01:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:01:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:01:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:01:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:01:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:01:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:01:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:01:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:01:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:01:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:01:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:01:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:01:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:01:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:01:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:01:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:01:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:01:55,599 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:01:55,600 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:01:55,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:55 BoogieIcfgContainer [2019-09-10 04:01:55,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:01:55,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:01:55,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:01:55,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:01:55,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:01:53" (1/3) ... [2019-09-10 04:01:55,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532ddaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:55, skipping insertion in model container [2019-09-10 04:01:55,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:53" (2/3) ... [2019-09-10 04:01:55,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532ddaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:55, skipping insertion in model container [2019-09-10 04:01:55,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:55" (3/3) ... [2019-09-10 04:01:55,614 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:01:55,625 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:01:55,636 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:01:55,653 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:01:55,694 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:01:55,694 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:01:55,694 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:01:55,695 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:01:55,695 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:01:55,695 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:01:55,695 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:01:55,696 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:01:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-09-10 04:01:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:01:55,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:55,781 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:01:55,782 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1109206420, now seen corresponding path program 1 times [2019-09-10 04:01:55,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:55,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:55,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:56,345 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:01:56,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:56,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:56,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:56,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:56,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:56,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:56,373 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 5 states. [2019-09-10 04:01:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:56,554 INFO L93 Difference]: Finished difference Result 334 states and 576 transitions. [2019-09-10 04:01:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:01:56,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 04:01:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:56,579 INFO L225 Difference]: With dead ends: 334 [2019-09-10 04:01:56,580 INFO L226 Difference]: Without dead ends: 330 [2019-09-10 04:01:56,582 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:01:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-10 04:01:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2019-09-10 04:01:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 04:01:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 531 transitions. [2019-09-10 04:01:56,655 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 531 transitions. Word has length 98 [2019-09-10 04:01:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:56,656 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 531 transitions. [2019-09-10 04:01:56,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 531 transitions. [2019-09-10 04:01:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 04:01:56,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:56,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:01:56,664 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1532145528, now seen corresponding path program 1 times [2019-09-10 04:01:56,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:56,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:56,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:56,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:56,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:57,123 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:01:57,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:57,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:01:57,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:57,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:01:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:01:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:57,127 INFO L87 Difference]: Start difference. First operand 330 states and 531 transitions. Second operand 11 states. [2019-09-10 04:02:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:03,621 INFO L93 Difference]: Finished difference Result 1185 states and 1990 transitions. [2019-09-10 04:02:03,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 04:02:03,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-09-10 04:02:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:03,652 INFO L225 Difference]: With dead ends: 1185 [2019-09-10 04:02:03,652 INFO L226 Difference]: Without dead ends: 1185 [2019-09-10 04:02:03,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:02:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-09-10 04:02:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 865. [2019-09-10 04:02:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-10 04:02:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1401 transitions. [2019-09-10 04:02:03,857 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1401 transitions. Word has length 139 [2019-09-10 04:02:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:03,860 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1401 transitions. [2019-09-10 04:02:03,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1401 transitions. [2019-09-10 04:02:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 04:02:03,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:03,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:03,881 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1009788152, now seen corresponding path program 1 times [2019-09-10 04:02:03,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:03,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:03,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:03,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:03,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:04,196 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:02:04,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:04,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:04,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:04,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:04,198 INFO L87 Difference]: Start difference. First operand 865 states and 1401 transitions. Second operand 6 states. [2019-09-10 04:02:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:06,783 INFO L93 Difference]: Finished difference Result 2027 states and 3263 transitions. [2019-09-10 04:02:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:02:06,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 04:02:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:06,796 INFO L225 Difference]: With dead ends: 2027 [2019-09-10 04:02:06,796 INFO L226 Difference]: Without dead ends: 2027 [2019-09-10 04:02:06,797 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:02:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-10 04:02:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2014. [2019-09-10 04:02:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-09-10 04:02:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 3249 transitions. [2019-09-10 04:02:06,858 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 3249 transitions. Word has length 140 [2019-09-10 04:02:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:06,858 INFO L475 AbstractCegarLoop]: Abstraction has 2014 states and 3249 transitions. [2019-09-10 04:02:06,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 3249 transitions. [2019-09-10 04:02:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 04:02:06,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:06,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:06,863 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1742961455, now seen corresponding path program 1 times [2019-09-10 04:02:06,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:06,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:06,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:06,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:06,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:07,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:07,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:07,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:07,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:07,114 INFO L87 Difference]: Start difference. First operand 2014 states and 3249 transitions. Second operand 6 states. [2019-09-10 04:02:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:08,950 INFO L93 Difference]: Finished difference Result 5755 states and 9250 transitions. [2019-09-10 04:02:08,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:02:08,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 04:02:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:08,979 INFO L225 Difference]: With dead ends: 5755 [2019-09-10 04:02:08,979 INFO L226 Difference]: Without dead ends: 5755 [2019-09-10 04:02:08,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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:02:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2019-09-10 04:02:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5066. [2019-09-10 04:02:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5066 states. [2019-09-10 04:02:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5066 states to 5066 states and 8139 transitions. [2019-09-10 04:02:09,168 INFO L78 Accepts]: Start accepts. Automaton has 5066 states and 8139 transitions. Word has length 141 [2019-09-10 04:02:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:09,168 INFO L475 AbstractCegarLoop]: Abstraction has 5066 states and 8139 transitions. [2019-09-10 04:02:09,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 8139 transitions. [2019-09-10 04:02:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 04:02:09,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:09,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:09,175 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1127168415, now seen corresponding path program 1 times [2019-09-10 04:02:09,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:09,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:09,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:09,435 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:02:09,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:09,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:09,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:09,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:09,438 INFO L87 Difference]: Start difference. First operand 5066 states and 8139 transitions. Second operand 6 states. [2019-09-10 04:02:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:10,866 INFO L93 Difference]: Finished difference Result 10382 states and 16575 transitions. [2019-09-10 04:02:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:02:10,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 04:02:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:10,921 INFO L225 Difference]: With dead ends: 10382 [2019-09-10 04:02:10,921 INFO L226 Difference]: Without dead ends: 10382 [2019-09-10 04:02:10,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:02:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2019-09-10 04:02:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10342. [2019-09-10 04:02:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10342 states. [2019-09-10 04:02:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10342 states to 10342 states and 16534 transitions. [2019-09-10 04:02:11,201 INFO L78 Accepts]: Start accepts. Automaton has 10342 states and 16534 transitions. Word has length 142 [2019-09-10 04:02:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:11,201 INFO L475 AbstractCegarLoop]: Abstraction has 10342 states and 16534 transitions. [2019-09-10 04:02:11,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 10342 states and 16534 transitions. [2019-09-10 04:02:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 04:02:11,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:11,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:11,207 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash -834231578, now seen corresponding path program 1 times [2019-09-10 04:02:11,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:11,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:11,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:11,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:11,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:11,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:11,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:11,523 INFO L87 Difference]: Start difference. First operand 10342 states and 16534 transitions. Second operand 6 states. [2019-09-10 04:02:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:13,479 INFO L93 Difference]: Finished difference Result 39433 states and 63010 transitions. [2019-09-10 04:02:13,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:02:13,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 04:02:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:13,741 INFO L225 Difference]: With dead ends: 39433 [2019-09-10 04:02:13,741 INFO L226 Difference]: Without dead ends: 39433 [2019-09-10 04:02:13,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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:02:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39433 states. [2019-09-10 04:02:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39433 to 31316. [2019-09-10 04:02:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31316 states. [2019-09-10 04:02:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31316 states to 31316 states and 49962 transitions. [2019-09-10 04:02:14,966 INFO L78 Accepts]: Start accepts. Automaton has 31316 states and 49962 transitions. Word has length 143 [2019-09-10 04:02:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:14,977 INFO L475 AbstractCegarLoop]: Abstraction has 31316 states and 49962 transitions. [2019-09-10 04:02:14,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 31316 states and 49962 transitions. [2019-09-10 04:02:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:02:14,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:14,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:14,993 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:14,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash 311829015, now seen corresponding path program 1 times [2019-09-10 04:02:14,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:14,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:14,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:14,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:14,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:15,446 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:02:15,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:15,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:15,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:15,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:15,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:15,451 INFO L87 Difference]: Start difference. First operand 31316 states and 49962 transitions. Second operand 11 states. [2019-09-10 04:02:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:24,572 INFO L93 Difference]: Finished difference Result 37176 states and 59154 transitions. [2019-09-10 04:02:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 04:02:24,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:02:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:24,703 INFO L225 Difference]: With dead ends: 37176 [2019-09-10 04:02:24,703 INFO L226 Difference]: Without dead ends: 37176 [2019-09-10 04:02:24,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:02:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37176 states. [2019-09-10 04:02:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37176 to 36784. [2019-09-10 04:02:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36784 states. [2019-09-10 04:02:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36784 states to 36784 states and 58754 transitions. [2019-09-10 04:02:25,952 INFO L78 Accepts]: Start accepts. Automaton has 36784 states and 58754 transitions. Word has length 145 [2019-09-10 04:02:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:25,953 INFO L475 AbstractCegarLoop]: Abstraction has 36784 states and 58754 transitions. [2019-09-10 04:02:25,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 36784 states and 58754 transitions. [2019-09-10 04:02:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:02:25,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:25,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:25,965 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:25,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1376899337, now seen corresponding path program 1 times [2019-09-10 04:02:25,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:25,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:25,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:25,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:25,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:26,381 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:02:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:26,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:26,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:26,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:26,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:26,385 INFO L87 Difference]: Start difference. First operand 36784 states and 58754 transitions. Second operand 11 states. [2019-09-10 04:02:29,893 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-09-10 04:02:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:33,741 INFO L93 Difference]: Finished difference Result 43748 states and 69893 transitions. [2019-09-10 04:02:33,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 04:02:33,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:02:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:33,866 INFO L225 Difference]: With dead ends: 43748 [2019-09-10 04:02:33,866 INFO L226 Difference]: Without dead ends: 43748 [2019-09-10 04:02:33,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:02:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43748 states. [2019-09-10 04:02:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43748 to 43545. [2019-09-10 04:02:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43545 states. [2019-09-10 04:02:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43545 states to 43545 states and 69694 transitions. [2019-09-10 04:02:34,579 INFO L78 Accepts]: Start accepts. Automaton has 43545 states and 69694 transitions. Word has length 145 [2019-09-10 04:02:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:34,580 INFO L475 AbstractCegarLoop]: Abstraction has 43545 states and 69694 transitions. [2019-09-10 04:02:34,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 43545 states and 69694 transitions. [2019-09-10 04:02:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:02:34,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:34,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:34,587 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:34,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:34,588 INFO L82 PathProgramCache]: Analyzing trace with hash 146101726, now seen corresponding path program 1 times [2019-09-10 04:02:34,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:34,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:34,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:34,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:34,743 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:02:34,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:34,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:02:34,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:34,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:02:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:02:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:02:34,746 INFO L87 Difference]: Start difference. First operand 43545 states and 69694 transitions. Second operand 4 states. [2019-09-10 04:02:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:35,388 INFO L93 Difference]: Finished difference Result 115099 states and 182970 transitions. [2019-09-10 04:02:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:02:35,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-10 04:02:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:35,840 INFO L225 Difference]: With dead ends: 115099 [2019-09-10 04:02:35,840 INFO L226 Difference]: Without dead ends: 115099 [2019-09-10 04:02:35,841 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:02:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115099 states. [2019-09-10 04:02:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115099 to 114106. [2019-09-10 04:02:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114106 states. [2019-09-10 04:02:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114106 states to 114106 states and 181652 transitions. [2019-09-10 04:02:39,423 INFO L78 Accepts]: Start accepts. Automaton has 114106 states and 181652 transitions. Word has length 145 [2019-09-10 04:02:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:39,423 INFO L475 AbstractCegarLoop]: Abstraction has 114106 states and 181652 transitions. [2019-09-10 04:02:39,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:02:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 114106 states and 181652 transitions. [2019-09-10 04:02:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:02:39,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:39,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:39,436 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1790577429, now seen corresponding path program 1 times [2019-09-10 04:02:39,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:39,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:39,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:39,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:39,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:39,849 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:02:39,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:39,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:39,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:39,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:39,855 INFO L87 Difference]: Start difference. First operand 114106 states and 181652 transitions. Second operand 11 states. [2019-09-10 04:02:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:48,805 INFO L93 Difference]: Finished difference Result 138930 states and 222242 transitions. [2019-09-10 04:02:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 04:02:48,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 04:02:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:49,277 INFO L225 Difference]: With dead ends: 138930 [2019-09-10 04:02:49,278 INFO L226 Difference]: Without dead ends: 138930 [2019-09-10 04:02:49,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:02:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138930 states. [2019-09-10 04:02:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138930 to 138001. [2019-09-10 04:02:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138001 states. [2019-09-10 04:02:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138001 states to 138001 states and 220072 transitions. [2019-09-10 04:02:55,167 INFO L78 Accepts]: Start accepts. Automaton has 138001 states and 220072 transitions. Word has length 145 [2019-09-10 04:02:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:55,168 INFO L475 AbstractCegarLoop]: Abstraction has 138001 states and 220072 transitions. [2019-09-10 04:02:55,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 138001 states and 220072 transitions. [2019-09-10 04:02:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:02:55,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:55,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:55,175 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1588333813, now seen corresponding path program 1 times [2019-09-10 04:02:55,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:55,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:55,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:55,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:55,462 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:02:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:02:55,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:55,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:02:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:02:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:02:55,465 INFO L87 Difference]: Start difference. First operand 138001 states and 220072 transitions. Second operand 12 states. [2019-09-10 04:03:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:01,998 INFO L93 Difference]: Finished difference Result 144311 states and 230185 transitions. [2019-09-10 04:03:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 04:03:01,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-10 04:03:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:02,438 INFO L225 Difference]: With dead ends: 144311 [2019-09-10 04:03:02,438 INFO L226 Difference]: Without dead ends: 144311 [2019-09-10 04:03:02,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 04:03:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144311 states. [2019-09-10 04:03:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144311 to 144042. [2019-09-10 04:03:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144042 states. [2019-09-10 04:03:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144042 states to 144042 states and 229710 transitions. [2019-09-10 04:03:07,709 INFO L78 Accepts]: Start accepts. Automaton has 144042 states and 229710 transitions. Word has length 146 [2019-09-10 04:03:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:07,709 INFO L475 AbstractCegarLoop]: Abstraction has 144042 states and 229710 transitions. [2019-09-10 04:03:07,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:03:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 144042 states and 229710 transitions. [2019-09-10 04:03:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 04:03:07,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:07,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:07,718 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1862627981, now seen corresponding path program 1 times [2019-09-10 04:03:07,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:07,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:07,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:07,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:03:07,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:07,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:03:07,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:07,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:03:07,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:03:07,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:03:07,869 INFO L87 Difference]: Start difference. First operand 144042 states and 229710 transitions. Second operand 7 states. [2019-09-10 04:03:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:10,272 INFO L93 Difference]: Finished difference Result 162151 states and 259705 transitions. [2019-09-10 04:03:10,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:03:10,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-10 04:03:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:10,884 INFO L225 Difference]: With dead ends: 162151 [2019-09-10 04:03:10,885 INFO L226 Difference]: Without dead ends: 162151 [2019-09-10 04:03:10,885 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:03:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162151 states. [2019-09-10 04:03:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162151 to 161990. [2019-09-10 04:03:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161990 states. [2019-09-10 04:03:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161990 states to 161990 states and 259392 transitions. [2019-09-10 04:03:13,481 INFO L78 Accepts]: Start accepts. Automaton has 161990 states and 259392 transitions. Word has length 146 [2019-09-10 04:03:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:13,482 INFO L475 AbstractCegarLoop]: Abstraction has 161990 states and 259392 transitions. [2019-09-10 04:03:13,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:03:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 161990 states and 259392 transitions. [2019-09-10 04:03:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:03:13,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:13,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:13,488 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:13,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1985707213, now seen corresponding path program 1 times [2019-09-10 04:03:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:13,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:13,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:13,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:13,703 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:03:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:13,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:03:13,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:13,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:03:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:03:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:03:13,705 INFO L87 Difference]: Start difference. First operand 161990 states and 259392 transitions. Second operand 5 states. [2019-09-10 04:03:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:15,361 INFO L93 Difference]: Finished difference Result 321585 states and 510658 transitions. [2019-09-10 04:03:15,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:03:15,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 04:03:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:16,072 INFO L225 Difference]: With dead ends: 321585 [2019-09-10 04:03:16,072 INFO L226 Difference]: Without dead ends: 321585 [2019-09-10 04:03:16,072 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:03:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321585 states. [2019-09-10 04:03:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321585 to 321583. [2019-09-10 04:03:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321583 states. [2019-09-10 04:03:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321583 states to 321583 states and 510657 transitions. [2019-09-10 04:03:24,916 INFO L78 Accepts]: Start accepts. Automaton has 321583 states and 510657 transitions. Word has length 148 [2019-09-10 04:03:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:24,917 INFO L475 AbstractCegarLoop]: Abstraction has 321583 states and 510657 transitions. [2019-09-10 04:03:24,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:03:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 321583 states and 510657 transitions. [2019-09-10 04:03:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:03:24,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:24,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:24,928 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1735540910, now seen corresponding path program 1 times [2019-09-10 04:03:24,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:24,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:24,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:24,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:24,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:25,076 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:03:25,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:25,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:03:25,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:25,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:03:25,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:03:25,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:03:25,078 INFO L87 Difference]: Start difference. First operand 321583 states and 510657 transitions. Second operand 5 states. [2019-09-10 04:03:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:27,727 INFO L93 Difference]: Finished difference Result 435975 states and 682782 transitions. [2019-09-10 04:03:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:03:27,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:03:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:28,905 INFO L225 Difference]: With dead ends: 435975 [2019-09-10 04:03:28,905 INFO L226 Difference]: Without dead ends: 435975 [2019-09-10 04:03:28,906 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:03:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435975 states. [2019-09-10 04:03:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435975 to 408277. [2019-09-10 04:03:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408277 states. [2019-09-10 04:03:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408277 states to 408277 states and 650693 transitions. [2019-09-10 04:03:41,768 INFO L78 Accepts]: Start accepts. Automaton has 408277 states and 650693 transitions. Word has length 150 [2019-09-10 04:03:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:41,769 INFO L475 AbstractCegarLoop]: Abstraction has 408277 states and 650693 transitions. [2019-09-10 04:03:41,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:03:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 408277 states and 650693 transitions. [2019-09-10 04:03:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:03:41,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:41,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:41,786 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash 281113469, now seen corresponding path program 1 times [2019-09-10 04:03:41,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:41,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:41,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:41,964 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:03:41,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:41,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 04:03:41,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:41,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 04:03:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 04:03:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:03:41,966 INFO L87 Difference]: Start difference. First operand 408277 states and 650693 transitions. Second operand 10 states. [2019-09-10 04:03:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:52,253 INFO L93 Difference]: Finished difference Result 548921 states and 885805 transitions. [2019-09-10 04:03:52,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:03:52,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-10 04:03:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:54,049 INFO L225 Difference]: With dead ends: 548921 [2019-09-10 04:03:54,050 INFO L226 Difference]: Without dead ends: 548921 [2019-09-10 04:03:54,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:03:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548921 states. [2019-09-10 04:04:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548921 to 411237. [2019-09-10 04:04:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411237 states. [2019-09-10 04:04:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411237 states to 411237 states and 655272 transitions. [2019-09-10 04:04:08,374 INFO L78 Accepts]: Start accepts. Automaton has 411237 states and 655272 transitions. Word has length 152 [2019-09-10 04:04:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:08,375 INFO L475 AbstractCegarLoop]: Abstraction has 411237 states and 655272 transitions. [2019-09-10 04:04:08,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:04:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 411237 states and 655272 transitions. [2019-09-10 04:04:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:04:09,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:09,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:04:09,675 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 555873083, now seen corresponding path program 1 times [2019-09-10 04:04:09,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:09,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:09,840 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:04:09,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:09,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:09,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:09,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:09,842 INFO L87 Difference]: Start difference. First operand 411237 states and 655272 transitions. Second operand 5 states. [2019-09-10 04:04:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:21,250 INFO L93 Difference]: Finished difference Result 666931 states and 1055339 transitions. [2019-09-10 04:04:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:04:21,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-09-10 04:04:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:22,863 INFO L225 Difference]: With dead ends: 666931 [2019-09-10 04:04:22,864 INFO L226 Difference]: Without dead ends: 666931 [2019-09-10 04:04:22,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:04:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666931 states. [2019-09-10 04:04:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666931 to 666789. [2019-09-10 04:04:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666789 states. [2019-09-10 04:04:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666789 states to 666789 states and 1055058 transitions. [2019-09-10 04:04:47,417 INFO L78 Accepts]: Start accepts. Automaton has 666789 states and 1055058 transitions. Word has length 152 [2019-09-10 04:04:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:47,417 INFO L475 AbstractCegarLoop]: Abstraction has 666789 states and 1055058 transitions. [2019-09-10 04:04:47,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 666789 states and 1055058 transitions. [2019-09-10 04:04:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:04:47,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:47,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:04:47,423 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1874141699, now seen corresponding path program 1 times [2019-09-10 04:04:47,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:47,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:47,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:47,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:47,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:47,608 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:04:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:47,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:47,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:47,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:47,610 INFO L87 Difference]: Start difference. First operand 666789 states and 1055058 transitions. Second operand 5 states. [2019-09-10 04:05:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:02,970 INFO L93 Difference]: Finished difference Result 1322984 states and 2074115 transitions. [2019-09-10 04:05:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:05:02,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:05:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:15,579 INFO L225 Difference]: With dead ends: 1322984 [2019-09-10 04:05:15,580 INFO L226 Difference]: Without dead ends: 1322984 [2019-09-10 04:05:15,580 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:05:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322984 states. [2019-09-10 04:05:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322984 to 1322982. [2019-09-10 04:05:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322982 states. [2019-09-10 04:06:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322982 states to 1322982 states and 2074114 transitions. [2019-09-10 04:06:08,308 INFO L78 Accepts]: Start accepts. Automaton has 1322982 states and 2074114 transitions. Word has length 153 [2019-09-10 04:06:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:08,309 INFO L475 AbstractCegarLoop]: Abstraction has 1322982 states and 2074114 transitions. [2019-09-10 04:06:08,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:06:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1322982 states and 2074114 transitions. [2019-09-10 04:06:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:06:08,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:08,316 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:06:08,316 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:08,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:08,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1792688217, now seen corresponding path program 1 times [2019-09-10 04:06:08,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:08,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:08,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:08,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:08,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:08,516 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:06:08,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:08,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:06:08,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:08,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:06:08,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:06:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:06:08,518 INFO L87 Difference]: Start difference. First operand 1322982 states and 2074114 transitions. Second operand 5 states. [2019-09-10 04:06:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:45,889 INFO L93 Difference]: Finished difference Result 2627700 states and 4096255 transitions. [2019-09-10 04:06:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:06:45,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 04:06:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:55,807 INFO L225 Difference]: With dead ends: 2627700 [2019-09-10 04:06:55,807 INFO L226 Difference]: Without dead ends: 2627700 [2019-09-10 04:06:55,807 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:06:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627700 states.