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.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:01:47,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:01:47,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:01:47,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:01:47,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:01:47,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:01:47,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:01:47,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:01:47,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:01:47,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:01:47,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:01:47,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:01:47,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:01:47,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:01:47,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:01:47,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:01:47,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:01:47,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:01:47,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:01:47,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:01:47,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:01:47,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:01:47,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:01:47,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:01:47,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:01:47,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:01:47,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:01:47,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:01:47,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:01:47,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:01:47,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:01:47,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:01:47,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:01:47,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:01:47,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:01:47,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:01:47,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:01:47,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:01:47,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:01:47,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:01:47,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:01:47,059 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:47,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:01:47,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:01:47,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:01:47,091 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:01:47,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:01:47,093 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:01:47,093 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:01:47,093 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:01:47,094 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:01:47,094 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:01:47,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:01:47,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:01:47,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:01:47,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:01:47,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:01:47,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:01:47,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:01:47,099 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:01:47,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:01:47,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:01:47,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:01:47,100 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:01:47,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:01:47,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:01:47,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:01:47,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:01:47,101 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:01:47,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:01:47,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:01:47,102 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:01:47,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:01:47,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:01:47,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:01:47,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:01:47,188 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:01:47,189 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.BOUNDED-8.pals.c [2019-09-10 04:01:47,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bdefb3b8/9978af67a59e4ed9891cb6f50cd75a91/FLAG92ada72bf [2019-09-10 04:01:47,881 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:01:47,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2019-09-10 04:01:47,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bdefb3b8/9978af67a59e4ed9891cb6f50cd75a91/FLAG92ada72bf [2019-09-10 04:01:48,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bdefb3b8/9978af67a59e4ed9891cb6f50cd75a91 [2019-09-10 04:01:48,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:01:48,155 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:01:48,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:48,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:01:48,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:01:48,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:48" (1/1) ... [2019-09-10 04:01:48,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f90b705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:48, skipping insertion in model container [2019-09-10 04:01:48,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:01:48" (1/1) ... [2019-09-10 04:01:48,172 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:01:48,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:01:48,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:48,735 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:01:48,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:01:48,844 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:01:48,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:48 WrapperNode [2019-09-10 04:01:48,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:01:48,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:01:48,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:01:48,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:01:48,856 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:48" (1/1) ... [2019-09-10 04:01:48,857 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:48" (1/1) ... [2019-09-10 04:01:48,874 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:48" (1/1) ... [2019-09-10 04:01:48,875 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:48" (1/1) ... [2019-09-10 04:01:48,901 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:48" (1/1) ... [2019-09-10 04:01:48,925 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:48" (1/1) ... [2019-09-10 04:01:48,930 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:48" (1/1) ... [2019-09-10 04:01:48,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:01:48,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:01:48,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:01:48,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:01:48,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:48" (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:49,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:01:49,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:01:49,040 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:01:49,041 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:01:49,041 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:01:49,041 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:01:49,041 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:01:49,041 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:01:49,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:01:49,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:01:49,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:01:49,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:01:49,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:01:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:01:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:01:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:01:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:01:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:01:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:01:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:01:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:01:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:01:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:01:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:01:49,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:01:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:01:50,654 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:01:50,654 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:01:50,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:50 BoogieIcfgContainer [2019-09-10 04:01:50,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:01:50,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:01:50,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:01:50,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:01:50,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:01:48" (1/3) ... [2019-09-10 04:01:50,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0c357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:50, skipping insertion in model container [2019-09-10 04:01:50,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:01:48" (2/3) ... [2019-09-10 04:01:50,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0c357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:01:50, skipping insertion in model container [2019-09-10 04:01:50,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:01:50" (3/3) ... [2019-09-10 04:01:50,670 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c [2019-09-10 04:01:50,682 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:01:50,696 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:01:50,716 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:01:50,762 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:01:50,762 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:01:50,762 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:01:50,763 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:01:50,763 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:01:50,763 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:01:50,763 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:01:50,763 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:01:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states. [2019-09-10 04:01:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:01:50,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:50,881 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:50,884 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:50,893 INFO L82 PathProgramCache]: Analyzing trace with hash -772559481, now seen corresponding path program 1 times [2019-09-10 04:01:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:50,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:50,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:51,443 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:51,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:51,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:51,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:51,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:51,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:51,476 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 5 states. [2019-09-10 04:01:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:51,682 INFO L93 Difference]: Finished difference Result 332 states and 570 transitions. [2019-09-10 04:01:51,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:01:51,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 04:01:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:51,718 INFO L225 Difference]: With dead ends: 332 [2019-09-10 04:01:51,718 INFO L226 Difference]: Without dead ends: 323 [2019-09-10 04:01:51,722 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:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-10 04:01:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-09-10 04:01:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-10 04:01:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 520 transitions. [2019-09-10 04:01:51,799 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 520 transitions. Word has length 98 [2019-09-10 04:01:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:51,800 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 520 transitions. [2019-09-10 04:01:51,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 520 transitions. [2019-09-10 04:01:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 04:01:51,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:51,807 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:51,808 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1532894247, now seen corresponding path program 1 times [2019-09-10 04:01:51,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:51,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:51,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:52,065 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:52,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:52,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:52,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:52,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:52,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:52,072 INFO L87 Difference]: Start difference. First operand 323 states and 520 transitions. Second operand 5 states. [2019-09-10 04:01:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:53,409 INFO L93 Difference]: Finished difference Result 448 states and 708 transitions. [2019-09-10 04:01:53,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:01:53,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-10 04:01:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:53,415 INFO L225 Difference]: With dead ends: 448 [2019-09-10 04:01:53,415 INFO L226 Difference]: Without dead ends: 448 [2019-09-10 04:01:53,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:01:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-10 04:01:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 440. [2019-09-10 04:01:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-10 04:01:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 701 transitions. [2019-09-10 04:01:53,444 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 701 transitions. Word has length 139 [2019-09-10 04:01:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:53,445 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 701 transitions. [2019-09-10 04:01:53,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 701 transitions. [2019-09-10 04:01:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 04:01:53,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:53,451 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:01:53,451 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:53,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1125729132, now seen corresponding path program 1 times [2019-09-10 04:01:53,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:53,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:53,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:53,680 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:53,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:53,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:53,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:53,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:53,694 INFO L87 Difference]: Start difference. First operand 440 states and 701 transitions. Second operand 5 states. [2019-09-10 04:01:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:54,914 INFO L93 Difference]: Finished difference Result 674 states and 1060 transitions. [2019-09-10 04:01:54,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:01:54,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-09-10 04:01:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:54,920 INFO L225 Difference]: With dead ends: 674 [2019-09-10 04:01:54,920 INFO L226 Difference]: Without dead ends: 674 [2019-09-10 04:01:54,921 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:01:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-09-10 04:01:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 666. [2019-09-10 04:01:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 04:01:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1053 transitions. [2019-09-10 04:01:54,979 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1053 transitions. Word has length 142 [2019-09-10 04:01:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:54,980 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1053 transitions. [2019-09-10 04:01:54,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1053 transitions. [2019-09-10 04:01:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:01:54,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:54,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,988 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:54,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2099911033, now seen corresponding path program 1 times [2019-09-10 04:01:54,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:54,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:54,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:54,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:55,229 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:55,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:55,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:55,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:55,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:55,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:55,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:55,231 INFO L87 Difference]: Start difference. First operand 666 states and 1053 transitions. Second operand 5 states. [2019-09-10 04:01:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:56,459 INFO L93 Difference]: Finished difference Result 1118 states and 1740 transitions. [2019-09-10 04:01:56,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:01:56,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-10 04:01:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:56,472 INFO L225 Difference]: With dead ends: 1118 [2019-09-10 04:01:56,472 INFO L226 Difference]: Without dead ends: 1118 [2019-09-10 04:01:56,473 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:01:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-09-10 04:01:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1104. [2019-09-10 04:01:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-10 04:01:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1727 transitions. [2019-09-10 04:01:56,558 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1727 transitions. Word has length 145 [2019-09-10 04:01:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:56,559 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1727 transitions. [2019-09-10 04:01:56,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1727 transitions. [2019-09-10 04:01:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:01:56,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:56,565 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:01:56,565 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:56,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash 624307774, now seen corresponding path program 1 times [2019-09-10 04:01:56,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:56,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:56,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:56,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:56,788 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,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:56,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:01:56,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:56,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:01:56,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:01:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:01:56,791 INFO L87 Difference]: Start difference. First operand 1104 states and 1727 transitions. Second operand 5 states. [2019-09-10 04:01:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:57,838 INFO L93 Difference]: Finished difference Result 1978 states and 3040 transitions. [2019-09-10 04:01:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:01:57,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 04:01:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:57,849 INFO L225 Difference]: With dead ends: 1978 [2019-09-10 04:01:57,850 INFO L226 Difference]: Without dead ends: 1978 [2019-09-10 04:01:57,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:01:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-09-10 04:01:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1952. [2019-09-10 04:01:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-10 04:01:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3015 transitions. [2019-09-10 04:01:57,925 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3015 transitions. Word has length 148 [2019-09-10 04:01:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:57,925 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3015 transitions. [2019-09-10 04:01:57,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3015 transitions. [2019-09-10 04:01:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 04:01:57,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:57,929 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] [2019-09-10 04:01:57,930 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1208811063, now seen corresponding path program 1 times [2019-09-10 04:01:57,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:57,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:57,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:58,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:01:58,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:58,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:01:58,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:58,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:01:58,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:01:58,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:01:58,198 INFO L87 Difference]: Start difference. First operand 1952 states and 3015 transitions. Second operand 11 states. [2019-09-10 04:02:00,264 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-09-10 04:02:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:04,017 INFO L93 Difference]: Finished difference Result 7303 states and 11821 transitions. [2019-09-10 04:02:04,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 04:02:04,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-10 04:02:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:04,062 INFO L225 Difference]: With dead ends: 7303 [2019-09-10 04:02:04,062 INFO L226 Difference]: Without dead ends: 7303 [2019-09-10 04:02:04,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:02:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2019-09-10 04:02:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 5697. [2019-09-10 04:02:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5697 states. [2019-09-10 04:02:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5697 states to 5697 states and 8881 transitions. [2019-09-10 04:02:04,344 INFO L78 Accepts]: Start accepts. Automaton has 5697 states and 8881 transitions. Word has length 151 [2019-09-10 04:02:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:04,349 INFO L475 AbstractCegarLoop]: Abstraction has 5697 states and 8881 transitions. [2019-09-10 04:02:04,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5697 states and 8881 transitions. [2019-09-10 04:02:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:04,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:04,359 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:02:04,360 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:04,360 INFO L82 PathProgramCache]: Analyzing trace with hash -796777300, now seen corresponding path program 1 times [2019-09-10 04:02:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:04,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:04,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:04,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:04,651 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,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:04,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:04,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:04,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:04,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:04,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:04,653 INFO L87 Difference]: Start difference. First operand 5697 states and 8881 transitions. Second operand 11 states. [2019-09-10 04:02:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:10,792 INFO L93 Difference]: Finished difference Result 8982 states and 14196 transitions. [2019-09-10 04:02:10,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 04:02:10,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-10 04:02:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:10,854 INFO L225 Difference]: With dead ends: 8982 [2019-09-10 04:02:10,854 INFO L226 Difference]: Without dead ends: 8982 [2019-09-10 04:02:10,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 04:02:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8982 states. [2019-09-10 04:02:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8982 to 7588. [2019-09-10 04:02:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7588 states. [2019-09-10 04:02:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7588 states to 7588 states and 11863 transitions. [2019-09-10 04:02:11,146 INFO L78 Accepts]: Start accepts. Automaton has 7588 states and 11863 transitions. Word has length 152 [2019-09-10 04:02:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:11,146 INFO L475 AbstractCegarLoop]: Abstraction has 7588 states and 11863 transitions. [2019-09-10 04:02:11,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 7588 states and 11863 transitions. [2019-09-10 04:02:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:11,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:11,159 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:02:11,159 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1747849298, now seen corresponding path program 1 times [2019-09-10 04:02:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:11,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:11,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:11,343 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,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:11,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:11,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:11,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:11,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:11,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:11,346 INFO L87 Difference]: Start difference. First operand 7588 states and 11863 transitions. Second operand 6 states. [2019-09-10 04:02:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:13,623 INFO L93 Difference]: Finished difference Result 14884 states and 23219 transitions. [2019-09-10 04:02:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:02:13,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-10 04:02:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:13,715 INFO L225 Difference]: With dead ends: 14884 [2019-09-10 04:02:13,715 INFO L226 Difference]: Without dead ends: 14884 [2019-09-10 04:02:13,716 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:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14884 states. [2019-09-10 04:02:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14884 to 14752. [2019-09-10 04:02:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14752 states. [2019-09-10 04:02:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14752 states to 14752 states and 23047 transitions. [2019-09-10 04:02:14,043 INFO L78 Accepts]: Start accepts. Automaton has 14752 states and 23047 transitions. Word has length 152 [2019-09-10 04:02:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:14,044 INFO L475 AbstractCegarLoop]: Abstraction has 14752 states and 23047 transitions. [2019-09-10 04:02:14,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 14752 states and 23047 transitions. [2019-09-10 04:02:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:14,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:14,057 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:02:14,057 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash -963136192, now seen corresponding path program 1 times [2019-09-10 04:02:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:14,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:14,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:14,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:14,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:14,306 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:14,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:14,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:14,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:14,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:14,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:14,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:14,308 INFO L87 Difference]: Start difference. First operand 14752 states and 23047 transitions. Second operand 11 states. [2019-09-10 04:02:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:22,057 INFO L93 Difference]: Finished difference Result 22750 states and 35863 transitions. [2019-09-10 04:02:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 04:02:22,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-10 04:02:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:22,152 INFO L225 Difference]: With dead ends: 22750 [2019-09-10 04:02:22,153 INFO L226 Difference]: Without dead ends: 22750 [2019-09-10 04:02:22,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=612, Invalid=2468, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:02:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22750 states. [2019-09-10 04:02:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22750 to 22342. [2019-09-10 04:02:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22342 states. [2019-09-10 04:02:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22342 states to 22342 states and 35115 transitions. [2019-09-10 04:02:22,654 INFO L78 Accepts]: Start accepts. Automaton has 22342 states and 35115 transitions. Word has length 152 [2019-09-10 04:02:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:22,655 INFO L475 AbstractCegarLoop]: Abstraction has 22342 states and 35115 transitions. [2019-09-10 04:02:22,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22342 states and 35115 transitions. [2019-09-10 04:02:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:22,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:22,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:22,670 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash -106267540, now seen corresponding path program 1 times [2019-09-10 04:02:22,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:22,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:22,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:22,990 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:22,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:22,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:22,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:22,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:22,992 INFO L87 Difference]: Start difference. First operand 22342 states and 35115 transitions. Second operand 11 states. [2019-09-10 04:02:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:31,038 INFO L93 Difference]: Finished difference Result 30103 states and 47353 transitions. [2019-09-10 04:02:31,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 04:02:31,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-10 04:02:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:31,154 INFO L225 Difference]: With dead ends: 30103 [2019-09-10 04:02:31,155 INFO L226 Difference]: Without dead ends: 30103 [2019-09-10 04:02:31,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:02:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30103 states. [2019-09-10 04:02:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30103 to 29867. [2019-09-10 04:02:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29867 states. [2019-09-10 04:02:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29867 states to 29867 states and 47115 transitions. [2019-09-10 04:02:31,794 INFO L78 Accepts]: Start accepts. Automaton has 29867 states and 47115 transitions. Word has length 152 [2019-09-10 04:02:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:31,795 INFO L475 AbstractCegarLoop]: Abstraction has 29867 states and 47115 transitions. [2019-09-10 04:02:31,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29867 states and 47115 transitions. [2019-09-10 04:02:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:02:31,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:31,812 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:02:31,812 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:31,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1311271810, now seen corresponding path program 1 times [2019-09-10 04:02:31,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:31,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:31,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:31,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:31,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:32,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:32,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:02:32,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:32,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:02:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:02:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:02:32,906 INFO L87 Difference]: Start difference. First operand 29867 states and 47115 transitions. Second operand 11 states. [2019-09-10 04:02:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:39,971 INFO L93 Difference]: Finished difference Result 34589 states and 54555 transitions. [2019-09-10 04:02:39,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 04:02:39,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-10 04:02:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:40,074 INFO L225 Difference]: With dead ends: 34589 [2019-09-10 04:02:40,074 INFO L226 Difference]: Without dead ends: 34589 [2019-09-10 04:02:40,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 04:02:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34589 states. [2019-09-10 04:02:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34589 to 34473. [2019-09-10 04:02:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-09-10 04:02:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 54441 transitions. [2019-09-10 04:02:40,678 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 54441 transitions. Word has length 152 [2019-09-10 04:02:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:40,678 INFO L475 AbstractCegarLoop]: Abstraction has 34473 states and 54441 transitions. [2019-09-10 04:02:40,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:02:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 54441 transitions. [2019-09-10 04:02:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:02:40,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:40,693 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:02:40,693 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1859704533, now seen corresponding path program 1 times [2019-09-10 04:02:40,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:40,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:40,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:40,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:40,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:40,959 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:40,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:02:40,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:40,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:02:40,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:02:40,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:02:40,961 INFO L87 Difference]: Start difference. First operand 34473 states and 54441 transitions. Second operand 12 states. [2019-09-10 04:02:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:46,189 INFO L93 Difference]: Finished difference Result 35477 states and 55953 transitions. [2019-09-10 04:02:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 04:02:46,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 153 [2019-09-10 04:02:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:46,314 INFO L225 Difference]: With dead ends: 35477 [2019-09-10 04:02:46,314 INFO L226 Difference]: Without dead ends: 35477 [2019-09-10 04:02:46,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 04:02:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35477 states. [2019-09-10 04:02:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35477 to 35397. [2019-09-10 04:02:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35397 states. [2019-09-10 04:02:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35397 states to 35397 states and 55869 transitions. [2019-09-10 04:02:46,965 INFO L78 Accepts]: Start accepts. Automaton has 35397 states and 55869 transitions. Word has length 153 [2019-09-10 04:02:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:46,966 INFO L475 AbstractCegarLoop]: Abstraction has 35397 states and 55869 transitions. [2019-09-10 04:02:46,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:02:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 35397 states and 55869 transitions. [2019-09-10 04:02:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:02:46,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:46,987 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,987 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1074991427, now seen corresponding path program 1 times [2019-09-10 04:02:46,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:46,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:46,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:02:48,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:48,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:48,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:48,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:48,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:48,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:48,122 INFO L87 Difference]: Start difference. First operand 35397 states and 55869 transitions. Second operand 6 states. [2019-09-10 04:02:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:49,424 INFO L93 Difference]: Finished difference Result 37799 states and 59432 transitions. [2019-09-10 04:02:49,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:49,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-10 04:02:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:49,583 INFO L225 Difference]: With dead ends: 37799 [2019-09-10 04:02:49,583 INFO L226 Difference]: Without dead ends: 37799 [2019-09-10 04:02:49,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:02:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37799 states. [2019-09-10 04:02:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37799 to 35475. [2019-09-10 04:02:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35475 states. [2019-09-10 04:02:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35475 states to 35475 states and 55869 transitions. [2019-09-10 04:02:50,359 INFO L78 Accepts]: Start accepts. Automaton has 35475 states and 55869 transitions. Word has length 153 [2019-09-10 04:02:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:50,359 INFO L475 AbstractCegarLoop]: Abstraction has 35475 states and 55869 transitions. [2019-09-10 04:02:50,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 35475 states and 55869 transitions. [2019-09-10 04:02:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:02:50,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:50,376 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:02:50,377 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:50,377 INFO L82 PathProgramCache]: Analyzing trace with hash -218122775, now seen corresponding path program 1 times [2019-09-10 04:02:50,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:50,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:50,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:50,616 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:50,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:50,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:50,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:50,618 INFO L87 Difference]: Start difference. First operand 35475 states and 55869 transitions. Second operand 6 states. [2019-09-10 04:02:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:52,485 INFO L93 Difference]: Finished difference Result 39779 states and 64760 transitions. [2019-09-10 04:02:52,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:52,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-10 04:02:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:52,682 INFO L225 Difference]: With dead ends: 39779 [2019-09-10 04:02:52,682 INFO L226 Difference]: Without dead ends: 39779 [2019-09-10 04:02:52,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:02:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39779 states. [2019-09-10 04:02:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39779 to 35922. [2019-09-10 04:02:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35922 states. [2019-09-10 04:02:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35922 states to 35922 states and 56488 transitions. [2019-09-10 04:02:53,700 INFO L78 Accepts]: Start accepts. Automaton has 35922 states and 56488 transitions. Word has length 153 [2019-09-10 04:02:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:53,700 INFO L475 AbstractCegarLoop]: Abstraction has 35922 states and 56488 transitions. [2019-09-10 04:02:53,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35922 states and 56488 transitions. [2019-09-10 04:02:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:02:53,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:53,706 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:02:53,707 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1329850336, now seen corresponding path program 1 times [2019-09-10 04:02:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:53,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:53,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:53,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:53,869 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:53,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:53,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:53,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:53,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:53,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:53,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:53,871 INFO L87 Difference]: Start difference. First operand 35922 states and 56488 transitions. Second operand 6 states. [2019-09-10 04:02:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:56,224 INFO L93 Difference]: Finished difference Result 72378 states and 114109 transitions. [2019-09-10 04:02:56,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:02:56,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-10 04:02:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:56,466 INFO L225 Difference]: With dead ends: 72378 [2019-09-10 04:02:56,467 INFO L226 Difference]: Without dead ends: 72378 [2019-09-10 04:02:56,467 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:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72378 states. [2019-09-10 04:02:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72378 to 56014. [2019-09-10 04:02:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56014 states. [2019-09-10 04:02:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56014 states to 56014 states and 88172 transitions. [2019-09-10 04:02:57,505 INFO L78 Accepts]: Start accepts. Automaton has 56014 states and 88172 transitions. Word has length 153 [2019-09-10 04:02:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:57,505 INFO L475 AbstractCegarLoop]: Abstraction has 56014 states and 88172 transitions. [2019-09-10 04:02:57,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:02:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 56014 states and 88172 transitions. [2019-09-10 04:02:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 04:02:57,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:57,510 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:02:57,511 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:57,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1012416599, now seen corresponding path program 1 times [2019-09-10 04:02:57,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:57,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:57,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:57,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:57,716 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:57,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:57,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:02:57,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:57,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:02:57,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:02:57,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:02:57,718 INFO L87 Difference]: Start difference. First operand 56014 states and 88172 transitions. Second operand 6 states. [2019-09-10 04:02:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:59,447 INFO L93 Difference]: Finished difference Result 62580 states and 101943 transitions. [2019-09-10 04:02:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:02:59,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-10 04:02:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:59,713 INFO L225 Difference]: With dead ends: 62580 [2019-09-10 04:02:59,713 INFO L226 Difference]: Without dead ends: 62580 [2019-09-10 04:02:59,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:02:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62580 states. [2019-09-10 04:03:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62580 to 56702. [2019-09-10 04:03:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56702 states. [2019-09-10 04:03:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56702 states to 56702 states and 89204 transitions. [2019-09-10 04:03:02,643 INFO L78 Accepts]: Start accepts. Automaton has 56702 states and 89204 transitions. Word has length 153 [2019-09-10 04:03:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:02,643 INFO L475 AbstractCegarLoop]: Abstraction has 56702 states and 89204 transitions. [2019-09-10 04:03:02,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:03:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 56702 states and 89204 transitions. [2019-09-10 04:03:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 04:03:02,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:02,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:02,647 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:02,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1308469339, now seen corresponding path program 1 times [2019-09-10 04:03:02,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:02,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:02,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:02,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:02,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:02,811 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:02,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:02,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:03:02,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:02,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:03:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:03:02,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:03:02,813 INFO L87 Difference]: Start difference. First operand 56702 states and 89204 transitions. Second operand 6 states. [2019-09-10 04:03:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:04,347 INFO L93 Difference]: Finished difference Result 74909 states and 117181 transitions. [2019-09-10 04:03:04,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:03:04,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-10 04:03:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:04,544 INFO L225 Difference]: With dead ends: 74909 [2019-09-10 04:03:04,544 INFO L226 Difference]: Without dead ends: 74909 [2019-09-10 04:03:04,545 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:03:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74909 states. [2019-09-10 04:03:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74909 to 74041. [2019-09-10 04:03:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74041 states. [2019-09-10 04:03:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74041 states to 74041 states and 116315 transitions. [2019-09-10 04:03:05,479 INFO L78 Accepts]: Start accepts. Automaton has 74041 states and 116315 transitions. Word has length 154 [2019-09-10 04:03:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:05,479 INFO L475 AbstractCegarLoop]: Abstraction has 74041 states and 116315 transitions. [2019-09-10 04:03:05,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:03:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 74041 states and 116315 transitions. [2019-09-10 04:03:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 04:03:05,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:05,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,485 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash -697343369, now seen corresponding path program 1 times [2019-09-10 04:03:05,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:05,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:05,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:05,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:05,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:05,651 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:05,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:05,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:03:05,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:05,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:03:05,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:03:05,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:03:05,653 INFO L87 Difference]: Start difference. First operand 74041 states and 116315 transitions. Second operand 6 states. [2019-09-10 04:03:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:08,512 INFO L93 Difference]: Finished difference Result 149288 states and 235452 transitions. [2019-09-10 04:03:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:03:08,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-10 04:03:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:08,854 INFO L225 Difference]: With dead ends: 149288 [2019-09-10 04:03:08,854 INFO L226 Difference]: Without dead ends: 149288 [2019-09-10 04:03:08,855 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:03:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149288 states. [2019-09-10 04:03:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149288 to 111835. [2019-09-10 04:03:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111835 states. [2019-09-10 04:03:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111835 states to 111835 states and 175965 transitions. [2019-09-10 04:03:13,282 INFO L78 Accepts]: Start accepts. Automaton has 111835 states and 175965 transitions. Word has length 155 [2019-09-10 04:03:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:13,283 INFO L475 AbstractCegarLoop]: Abstraction has 111835 states and 175965 transitions. [2019-09-10 04:03:13,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:03:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 111835 states and 175965 transitions. [2019-09-10 04:03:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 04:03:13,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:13,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:13,288 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:13,289 INFO L82 PathProgramCache]: Analyzing trace with hash 950711842, now seen corresponding path program 1 times [2019-09-10 04:03:13,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:13,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:13,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:13,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:13,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:13,563 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,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:13,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:03:13,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:13,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:03:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:03:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:03:13,568 INFO L87 Difference]: Start difference. First operand 111835 states and 175965 transitions. Second operand 12 states. [2019-09-10 04:03:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:20,463 INFO L93 Difference]: Finished difference Result 170547 states and 272129 transitions. [2019-09-10 04:03:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 04:03:20,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2019-09-10 04:03:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:21,308 INFO L225 Difference]: With dead ends: 170547 [2019-09-10 04:03:21,309 INFO L226 Difference]: Without dead ends: 170487 [2019-09-10 04:03:21,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=598, Invalid=1952, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 04:03:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170487 states. [2019-09-10 04:03:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170487 to 152145. [2019-09-10 04:03:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152145 states. [2019-09-10 04:03:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152145 states to 152145 states and 240725 transitions. [2019-09-10 04:03:23,415 INFO L78 Accepts]: Start accepts. Automaton has 152145 states and 240725 transitions. Word has length 155 [2019-09-10 04:03:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:23,416 INFO L475 AbstractCegarLoop]: Abstraction has 152145 states and 240725 transitions. [2019-09-10 04:03:23,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:03:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 152145 states and 240725 transitions. [2019-09-10 04:03:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 04:03:23,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:23,419 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:23,419 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:23,420 INFO L82 PathProgramCache]: Analyzing trace with hash 441238752, now seen corresponding path program 1 times [2019-09-10 04:03:23,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:23,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:23,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:23,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:23,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:23,576 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:23,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:23,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:03:23,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:23,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:03:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:03:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:03:23,578 INFO L87 Difference]: Start difference. First operand 152145 states and 240725 transitions. Second operand 7 states. [2019-09-10 04:03:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:26,678 INFO L93 Difference]: Finished difference Result 198440 states and 314783 transitions. [2019-09-10 04:03:26,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:03:26,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-10 04:03:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:27,294 INFO L225 Difference]: With dead ends: 198440 [2019-09-10 04:03:27,295 INFO L226 Difference]: Without dead ends: 198440 [2019-09-10 04:03:27,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:03:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198440 states. [2019-09-10 04:03:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198440 to 198052. [2019-09-10 04:03:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198052 states. [2019-09-10 04:03:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198052 states to 198052 states and 314016 transitions. [2019-09-10 04:03:33,128 INFO L78 Accepts]: Start accepts. Automaton has 198052 states and 314016 transitions. Word has length 155 [2019-09-10 04:03:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:33,128 INFO L475 AbstractCegarLoop]: Abstraction has 198052 states and 314016 transitions. [2019-09-10 04:03:33,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:03:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 198052 states and 314016 transitions. [2019-09-10 04:03:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 04:03:33,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:33,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:33,131 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1018171407, now seen corresponding path program 1 times [2019-09-10 04:03:33,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:33,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:33,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:33,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:33,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:33,389 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:33,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:33,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:03:33,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:33,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:03:33,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:03:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:03:33,392 INFO L87 Difference]: Start difference. First operand 198052 states and 314016 transitions. Second operand 5 states. [2019-09-10 04:03:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:34,896 INFO L93 Difference]: Finished difference Result 391194 states and 613359 transitions. [2019-09-10 04:03:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:03:34,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 04:03:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:36,211 INFO L225 Difference]: With dead ends: 391194 [2019-09-10 04:03:36,211 INFO L226 Difference]: Without dead ends: 391194 [2019-09-10 04:03:36,212 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:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391194 states. [2019-09-10 04:03:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391194 to 391192. [2019-09-10 04:03:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391192 states. [2019-09-10 04:03:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391192 states to 391192 states and 613358 transitions. [2019-09-10 04:03:46,632 INFO L78 Accepts]: Start accepts. Automaton has 391192 states and 613358 transitions. Word has length 157 [2019-09-10 04:03:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:03:46,632 INFO L475 AbstractCegarLoop]: Abstraction has 391192 states and 613358 transitions. [2019-09-10 04:03:46,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:03:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 391192 states and 613358 transitions. [2019-09-10 04:03:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 04:03:46,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:03:46,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:03:46,639 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:03:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:03:46,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1250405517, now seen corresponding path program 1 times [2019-09-10 04:03:46,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:03:46,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:46,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:03:46,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:03:46,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:03:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:03:46,866 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:46,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:03:46,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:03:46,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:03:46,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:03:46,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:03:46,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:03:46,868 INFO L87 Difference]: Start difference. First operand 391192 states and 613358 transitions. Second operand 5 states. [2019-09-10 04:03:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:56,133 INFO L93 Difference]: Finished difference Result 772665 states and 1197512 transitions. [2019-09-10 04:03:56,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:03:56,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-10 04:03:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:58,128 INFO L225 Difference]: With dead ends: 772665 [2019-09-10 04:03:58,129 INFO L226 Difference]: Without dead ends: 772665 [2019-09-10 04:03:58,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772665 states. [2019-09-10 04:04:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772665 to 772663. [2019-09-10 04:04:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772663 states. [2019-09-10 04:04:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772663 states to 772663 states and 1197511 transitions. [2019-09-10 04:04:26,334 INFO L78 Accepts]: Start accepts. Automaton has 772663 states and 1197511 transitions. Word has length 157 [2019-09-10 04:04:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:26,334 INFO L475 AbstractCegarLoop]: Abstraction has 772663 states and 1197511 transitions. [2019-09-10 04:04:26,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 772663 states and 1197511 transitions. [2019-09-10 04:04:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 04:04:26,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:26,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:04:26,343 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash 388898933, now seen corresponding path program 1 times [2019-09-10 04:04:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:26,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:26,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:26,631 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:26,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:26,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 04:04:26,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:26,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 04:04:26,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 04:04:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:04:26,635 INFO L87 Difference]: Start difference. First operand 772663 states and 1197511 transitions. Second operand 16 states. [2019-09-10 04:04:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:45,724 INFO L93 Difference]: Finished difference Result 945519 states and 1465910 transitions. [2019-09-10 04:04:45,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 04:04:45,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2019-09-10 04:04:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:56,276 INFO L225 Difference]: With dead ends: 945519 [2019-09-10 04:04:56,276 INFO L226 Difference]: Without dead ends: 945435 [2019-09-10 04:04:56,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 04:04:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945435 states. [2019-09-10 04:05:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945435 to 773149. [2019-09-10 04:05:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773149 states. [2019-09-10 04:05:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773149 states to 773149 states and 1198218 transitions. [2019-09-10 04:05:25,127 INFO L78 Accepts]: Start accepts. Automaton has 773149 states and 1198218 transitions. Word has length 159 [2019-09-10 04:05:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:25,127 INFO L475 AbstractCegarLoop]: Abstraction has 773149 states and 1198218 transitions. [2019-09-10 04:05:25,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 04:05:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 773149 states and 1198218 transitions. [2019-09-10 04:05:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 04:05:25,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:25,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:05:25,141 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:25,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:25,141 INFO L82 PathProgramCache]: Analyzing trace with hash -508494345, now seen corresponding path program 1 times [2019-09-10 04:05:25,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:25,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:25,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:25,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:25,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:25,315 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:05:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 04:05:25,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:25,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 04:05:25,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 04:05:25,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:05:25,317 INFO L87 Difference]: Start difference. First operand 773149 states and 1198218 transitions. Second operand 10 states. [2019-09-10 04:05:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:44,732 INFO L93 Difference]: Finished difference Result 1075263 states and 1678086 transitions. [2019-09-10 04:05:44,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:05:44,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2019-09-10 04:05:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:48,360 INFO L225 Difference]: With dead ends: 1075263 [2019-09-10 04:05:48,360 INFO L226 Difference]: Without dead ends: 1075226 [2019-09-10 04:05:48,361 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:05:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075226 states. [2019-09-10 04:06:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075226 to 796362. [2019-09-10 04:06:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796362 states. [2019-09-10 04:06:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796362 states to 796362 states and 1235181 transitions. [2019-09-10 04:06:17,863 INFO L78 Accepts]: Start accepts. Automaton has 796362 states and 1235181 transitions. Word has length 159 [2019-09-10 04:06:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:17,864 INFO L475 AbstractCegarLoop]: Abstraction has 796362 states and 1235181 transitions. [2019-09-10 04:06:17,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:06:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 796362 states and 1235181 transitions. [2019-09-10 04:06:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 04:06:17,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:06:17,879 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash 832799607, now seen corresponding path program 1 times [2019-09-10 04:06:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:17,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:17,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:18,051 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:18,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:18,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 04:06:18,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:18,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 04:06:18,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 04:06:18,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:06:18,054 INFO L87 Difference]: Start difference. First operand 796362 states and 1235181 transitions. Second operand 10 states. [2019-09-10 04:06:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:30,939 INFO L93 Difference]: Finished difference Result 1023759 states and 1601873 transitions. [2019-09-10 04:06:30,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:06:30,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2019-09-10 04:06:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:35,298 INFO L225 Difference]: With dead ends: 1023759 [2019-09-10 04:06:35,299 INFO L226 Difference]: Without dead ends: 1023706 [2019-09-10 04:06:35,299 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:06:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023706 states. [2019-09-10 04:06:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023706 to 795253. [2019-09-10 04:06:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795253 states. [2019-09-10 04:07:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795253 states to 795253 states and 1233439 transitions. [2019-09-10 04:07:00,525 INFO L78 Accepts]: Start accepts. Automaton has 795253 states and 1233439 transitions. Word has length 159 [2019-09-10 04:07:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:00,526 INFO L475 AbstractCegarLoop]: Abstraction has 795253 states and 1233439 transitions. [2019-09-10 04:07:00,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:07:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 795253 states and 1233439 transitions. [2019-09-10 04:07:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 04:07:00,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:00,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:07:00,532 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:00,533 INFO L82 PathProgramCache]: Analyzing trace with hash -64593671, now seen corresponding path program 1 times [2019-09-10 04:07:00,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:00,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:00,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:00,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:00,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:00,734 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:07:00,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:00,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:07:00,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:00,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:07:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:07:00,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:07:00,736 INFO L87 Difference]: Start difference. First operand 795253 states and 1233439 transitions. Second operand 5 states. [2019-09-10 04:07:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:17,729 INFO L93 Difference]: Finished difference Result 1570351 states and 2406856 transitions. [2019-09-10 04:07:17,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:07:17,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-10 04:07:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:24,124 INFO L225 Difference]: With dead ends: 1570351 [2019-09-10 04:07:24,124 INFO L226 Difference]: Without dead ends: 1570351 [2019-09-10 04:07:24,124 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:07:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570351 states. [2019-09-10 04:08:13,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570351 to 1570349. [2019-09-10 04:08:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570349 states.