java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:47:27,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:47:27,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:47:27,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:47:27,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:47:27,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:47:27,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:47:27,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:47:27,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:47:27,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:47:27,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:47:27,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:47:27,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:47:27,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:47:27,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:47:27,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:47:27,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:47:27,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:47:27,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:47:27,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:47:27,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:47:27,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:47:27,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:47:27,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:47:27,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:47:27,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:47:27,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:47:27,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:47:27,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:47:27,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:47:27,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:47:27,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:47:27,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:47:27,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:47:27,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:47:27,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:47:27,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:47:27,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:47:27,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:47:27,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:47:27,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:47:27,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:47:27,102 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:47:27,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:47:27,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:47:27,104 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:47:27,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:47:27,104 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:47:27,105 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:47:27,105 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:47:27,105 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:47:27,105 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:47:27,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:47:27,107 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:47:27,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:47:27,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:47:27,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:47:27,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:47:27,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:47:27,109 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:47:27,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:47:27,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:47:27,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:47:27,110 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:47:27,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:47:27,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:47:27,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:47:27,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:47:27,111 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:47:27,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:47:27,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:47:27,111 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:47:27,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:47:27,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:47:27,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:47:27,180 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:47:27,180 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:47:27,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:47:27,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59e85156/27bd3465dd3849519f4e8669998f9185/FLAGe29409075 [2019-09-10 08:47:27,853 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:47:27,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:47:27,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59e85156/27bd3465dd3849519f4e8669998f9185/FLAGe29409075 [2019-09-10 08:47:28,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59e85156/27bd3465dd3849519f4e8669998f9185 [2019-09-10 08:47:28,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:47:28,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:47:28,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:47:28,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:47:28,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:47:28,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:47:28" (1/1) ... [2019-09-10 08:47:28,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16df6fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:28, skipping insertion in model container [2019-09-10 08:47:28,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:47:28" (1/1) ... [2019-09-10 08:47:28,124 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:47:28,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:47:29,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:47:29,272 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:47:29,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:47:29,693 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:47:29,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29 WrapperNode [2019-09-10 08:47:29,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:47:29,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:47:29,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:47:29,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:47:29,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... [2019-09-10 08:47:29,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... [2019-09-10 08:47:29,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... [2019-09-10 08:47:29,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... [2019-09-10 08:47:29,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... [2019-09-10 08:47:29,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... [2019-09-10 08:47:29,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... [2019-09-10 08:47:29,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:47:29,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:47:29,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:47:29,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:47:29,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:47:29,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:47:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:47:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:47:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:47:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:47:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:47:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:47:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:47:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:47:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:47:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:47:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:47:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:47:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:47:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:47:29,941 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:47:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:47:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:47:29,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:47:32,888 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:47:32,889 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:47:32,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:47:32 BoogieIcfgContainer [2019-09-10 08:47:32,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:47:32,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:47:32,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:47:32,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:47:32,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:47:28" (1/3) ... [2019-09-10 08:47:32,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7302a279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:47:32, skipping insertion in model container [2019-09-10 08:47:32,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:47:29" (2/3) ... [2019-09-10 08:47:32,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7302a279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:47:32, skipping insertion in model container [2019-09-10 08:47:32,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:47:32" (3/3) ... [2019-09-10 08:47:32,904 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:47:32,915 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:47:32,938 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:47:32,955 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:47:32,979 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:47:32,979 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:47:32,979 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:47:32,979 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:47:32,979 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:47:32,980 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:47:32,980 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:47:32,980 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:47:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states. [2019-09-10 08:47:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:33,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:33,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:33,061 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:33,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1585949308, now seen corresponding path program 1 times [2019-09-10 08:47:33,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:33,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:33,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:33,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:33,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:34,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:34,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:34,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:34,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:34,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:34,102 INFO L87 Difference]: Start difference. First operand 783 states. Second operand 3 states. [2019-09-10 08:47:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:34,442 INFO L93 Difference]: Finished difference Result 1280 states and 2254 transitions. [2019-09-10 08:47:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:34,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 08:47:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:34,487 INFO L225 Difference]: With dead ends: 1280 [2019-09-10 08:47:34,487 INFO L226 Difference]: Without dead ends: 1272 [2019-09-10 08:47:34,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-09-10 08:47:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1270. [2019-09-10 08:47:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-09-10 08:47:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1993 transitions. [2019-09-10 08:47:34,629 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1993 transitions. Word has length 312 [2019-09-10 08:47:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:34,631 INFO L475 AbstractCegarLoop]: Abstraction has 1270 states and 1993 transitions. [2019-09-10 08:47:34,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1993 transitions. [2019-09-10 08:47:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:34,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:34,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:34,642 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:34,643 INFO L82 PathProgramCache]: Analyzing trace with hash 711078858, now seen corresponding path program 1 times [2019-09-10 08:47:34,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:34,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:34,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:35,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:35,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:35,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:35,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:35,176 INFO L87 Difference]: Start difference. First operand 1270 states and 1993 transitions. Second operand 3 states. [2019-09-10 08:47:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:35,477 INFO L93 Difference]: Finished difference Result 2236 states and 3496 transitions. [2019-09-10 08:47:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:35,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 08:47:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:35,496 INFO L225 Difference]: With dead ends: 2236 [2019-09-10 08:47:35,497 INFO L226 Difference]: Without dead ends: 2236 [2019-09-10 08:47:35,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2019-09-10 08:47:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2234. [2019-09-10 08:47:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-09-10 08:47:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3495 transitions. [2019-09-10 08:47:35,590 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3495 transitions. Word has length 312 [2019-09-10 08:47:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:35,592 INFO L475 AbstractCegarLoop]: Abstraction has 2234 states and 3495 transitions. [2019-09-10 08:47:35,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3495 transitions. [2019-09-10 08:47:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:35,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:35,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:35,603 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash -103281279, now seen corresponding path program 1 times [2019-09-10 08:47:35,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:35,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:36,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:36,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:36,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:36,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:36,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:36,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:36,034 INFO L87 Difference]: Start difference. First operand 2234 states and 3495 transitions. Second operand 3 states. [2019-09-10 08:47:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:36,246 INFO L93 Difference]: Finished difference Result 4128 states and 6436 transitions. [2019-09-10 08:47:36,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:36,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 08:47:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:36,269 INFO L225 Difference]: With dead ends: 4128 [2019-09-10 08:47:36,269 INFO L226 Difference]: Without dead ends: 4128 [2019-09-10 08:47:36,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2019-09-10 08:47:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 4126. [2019-09-10 08:47:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4126 states. [2019-09-10 08:47:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 6435 transitions. [2019-09-10 08:47:36,402 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 6435 transitions. Word has length 312 [2019-09-10 08:47:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:36,403 INFO L475 AbstractCegarLoop]: Abstraction has 4126 states and 6435 transitions. [2019-09-10 08:47:36,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 6435 transitions. [2019-09-10 08:47:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:36,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:36,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:36,415 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1910629545, now seen corresponding path program 1 times [2019-09-10 08:47:36,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:36,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:36,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:36,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:36,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:36,836 INFO L87 Difference]: Start difference. First operand 4126 states and 6435 transitions. Second operand 3 states. [2019-09-10 08:47:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:37,067 INFO L93 Difference]: Finished difference Result 7840 states and 12188 transitions. [2019-09-10 08:47:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:37,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 08:47:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:37,107 INFO L225 Difference]: With dead ends: 7840 [2019-09-10 08:47:37,107 INFO L226 Difference]: Without dead ends: 7840 [2019-09-10 08:47:37,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7840 states. [2019-09-10 08:47:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7840 to 7838. [2019-09-10 08:47:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7838 states. [2019-09-10 08:47:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 12187 transitions. [2019-09-10 08:47:37,380 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 12187 transitions. Word has length 312 [2019-09-10 08:47:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:37,382 INFO L475 AbstractCegarLoop]: Abstraction has 7838 states and 12187 transitions. [2019-09-10 08:47:37,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 12187 transitions. [2019-09-10 08:47:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 08:47:37,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:37,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:37,412 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:37,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash 591051586, now seen corresponding path program 1 times [2019-09-10 08:47:37,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:37,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:37,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:37,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:38,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:38,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:38,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:38,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:38,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:38,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:38,426 INFO L87 Difference]: Start difference. First operand 7838 states and 12187 transitions. Second operand 4 states. [2019-09-10 08:47:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:38,640 INFO L93 Difference]: Finished difference Result 15364 states and 23749 transitions. [2019-09-10 08:47:38,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:38,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 08:47:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:38,710 INFO L225 Difference]: With dead ends: 15364 [2019-09-10 08:47:38,711 INFO L226 Difference]: Without dead ends: 15364 [2019-09-10 08:47:38,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15364 states. [2019-09-10 08:47:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15364 to 15362. [2019-09-10 08:47:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15362 states. [2019-09-10 08:47:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15362 states to 15362 states and 23748 transitions. [2019-09-10 08:47:39,129 INFO L78 Accepts]: Start accepts. Automaton has 15362 states and 23748 transitions. Word has length 312 [2019-09-10 08:47:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:39,130 INFO L475 AbstractCegarLoop]: Abstraction has 15362 states and 23748 transitions. [2019-09-10 08:47:39,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 15362 states and 23748 transitions. [2019-09-10 08:47:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:47:39,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:39,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:39,174 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash -341742011, now seen corresponding path program 1 times [2019-09-10 08:47:39,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:39,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:39,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:39,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:39,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:40,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:40,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:40,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:40,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:40,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:40,049 INFO L87 Difference]: Start difference. First operand 15362 states and 23748 transitions. Second operand 3 states. [2019-09-10 08:47:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:40,262 INFO L93 Difference]: Finished difference Result 30114 states and 46274 transitions. [2019-09-10 08:47:40,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:40,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 08:47:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:40,356 INFO L225 Difference]: With dead ends: 30114 [2019-09-10 08:47:40,356 INFO L226 Difference]: Without dead ends: 30114 [2019-09-10 08:47:40,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30114 states. [2019-09-10 08:47:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30114 to 30112. [2019-09-10 08:47:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30112 states. [2019-09-10 08:47:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30112 states to 30112 states and 46273 transitions. [2019-09-10 08:47:41,075 INFO L78 Accepts]: Start accepts. Automaton has 30112 states and 46273 transitions. Word has length 314 [2019-09-10 08:47:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:41,076 INFO L475 AbstractCegarLoop]: Abstraction has 30112 states and 46273 transitions. [2019-09-10 08:47:41,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30112 states and 46273 transitions. [2019-09-10 08:47:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 08:47:41,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:41,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:41,134 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:41,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1364269386, now seen corresponding path program 1 times [2019-09-10 08:47:41,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:41,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:41,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:41,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:41,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:41,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:41,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:41,376 INFO L87 Difference]: Start difference. First operand 30112 states and 46273 transitions. Second operand 3 states. [2019-09-10 08:47:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:41,548 INFO L93 Difference]: Finished difference Result 60191 states and 92486 transitions. [2019-09-10 08:47:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:41,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 08:47:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:41,673 INFO L225 Difference]: With dead ends: 60191 [2019-09-10 08:47:41,674 INFO L226 Difference]: Without dead ends: 60191 [2019-09-10 08:47:41,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60191 states. [2019-09-10 08:47:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60191 to 30131. [2019-09-10 08:47:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30131 states. [2019-09-10 08:47:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30131 states to 30131 states and 46301 transitions. [2019-09-10 08:47:43,686 INFO L78 Accepts]: Start accepts. Automaton has 30131 states and 46301 transitions. Word has length 314 [2019-09-10 08:47:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:43,686 INFO L475 AbstractCegarLoop]: Abstraction has 30131 states and 46301 transitions. [2019-09-10 08:47:43,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 30131 states and 46301 transitions. [2019-09-10 08:47:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 08:47:43,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:43,739 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:43,740 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:43,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash 297913838, now seen corresponding path program 1 times [2019-09-10 08:47:43,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:43,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:43,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:43,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:43,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:43,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:43,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:43,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:43,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:43,905 INFO L87 Difference]: Start difference. First operand 30131 states and 46301 transitions. Second operand 3 states. [2019-09-10 08:47:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:44,076 INFO L93 Difference]: Finished difference Result 60209 states and 92507 transitions. [2019-09-10 08:47:44,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:44,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 08:47:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:44,191 INFO L225 Difference]: With dead ends: 60209 [2019-09-10 08:47:44,191 INFO L226 Difference]: Without dead ends: 60209 [2019-09-10 08:47:44,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60209 states. [2019-09-10 08:47:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60209 to 30149. [2019-09-10 08:47:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30149 states. [2019-09-10 08:47:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30149 states to 30149 states and 46322 transitions. [2019-09-10 08:47:44,732 INFO L78 Accepts]: Start accepts. Automaton has 30149 states and 46322 transitions. Word has length 315 [2019-09-10 08:47:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:44,732 INFO L475 AbstractCegarLoop]: Abstraction has 30149 states and 46322 transitions. [2019-09-10 08:47:44,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30149 states and 46322 transitions. [2019-09-10 08:47:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 08:47:44,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:44,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:44,911 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1992072000, now seen corresponding path program 1 times [2019-09-10 08:47:44,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:44,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:44,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:45,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:45,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:45,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:45,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:45,170 INFO L87 Difference]: Start difference. First operand 30149 states and 46322 transitions. Second operand 3 states. [2019-09-10 08:47:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:45,447 INFO L93 Difference]: Finished difference Result 55668 states and 84933 transitions. [2019-09-10 08:47:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:45,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 08:47:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:45,577 INFO L225 Difference]: With dead ends: 55668 [2019-09-10 08:47:45,577 INFO L226 Difference]: Without dead ends: 55668 [2019-09-10 08:47:45,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55668 states. [2019-09-10 08:47:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55668 to 55666. [2019-09-10 08:47:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55666 states. [2019-09-10 08:47:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55666 states to 55666 states and 84932 transitions. [2019-09-10 08:47:46,370 INFO L78 Accepts]: Start accepts. Automaton has 55666 states and 84932 transitions. Word has length 316 [2019-09-10 08:47:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:46,371 INFO L475 AbstractCegarLoop]: Abstraction has 55666 states and 84932 transitions. [2019-09-10 08:47:46,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 55666 states and 84932 transitions. [2019-09-10 08:47:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 08:47:47,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:47,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:47,597 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:47,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:47,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1060367773, now seen corresponding path program 1 times [2019-09-10 08:47:47,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:47,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:47,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:47,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:47,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:47,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:47:47,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:47,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:47:47,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:47:47,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:47:47,990 INFO L87 Difference]: Start difference. First operand 55666 states and 84932 transitions. Second operand 4 states. [2019-09-10 08:47:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:48,304 INFO L93 Difference]: Finished difference Result 107423 states and 163767 transitions. [2019-09-10 08:47:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:48,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-10 08:47:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:48,448 INFO L225 Difference]: With dead ends: 107423 [2019-09-10 08:47:48,449 INFO L226 Difference]: Without dead ends: 107423 [2019-09-10 08:47:48,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107423 states. [2019-09-10 08:47:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107423 to 55901. [2019-09-10 08:47:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55901 states. [2019-09-10 08:47:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55901 states to 55901 states and 85320 transitions. [2019-09-10 08:47:49,698 INFO L78 Accepts]: Start accepts. Automaton has 55901 states and 85320 transitions. Word has length 316 [2019-09-10 08:47:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:49,698 INFO L475 AbstractCegarLoop]: Abstraction has 55901 states and 85320 transitions. [2019-09-10 08:47:49,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 55901 states and 85320 transitions. [2019-09-10 08:47:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:47:49,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:49,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:49,746 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 26814646, now seen corresponding path program 1 times [2019-09-10 08:47:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:49,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:49,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:49,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:49,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:49,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:49,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:49,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:49,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:49,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:49,923 INFO L87 Difference]: Start difference. First operand 55901 states and 85320 transitions. Second operand 3 states. [2019-09-10 08:47:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:50,231 INFO L93 Difference]: Finished difference Result 90735 states and 139501 transitions. [2019-09-10 08:47:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:50,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:47:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:50,337 INFO L225 Difference]: With dead ends: 90735 [2019-09-10 08:47:50,337 INFO L226 Difference]: Without dead ends: 90735 [2019-09-10 08:47:50,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90735 states. [2019-09-10 08:47:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90735 to 70613. [2019-09-10 08:47:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70613 states. [2019-09-10 08:47:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70613 states to 70613 states and 109508 transitions. [2019-09-10 08:47:51,538 INFO L78 Accepts]: Start accepts. Automaton has 70613 states and 109508 transitions. Word has length 318 [2019-09-10 08:47:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:51,539 INFO L475 AbstractCegarLoop]: Abstraction has 70613 states and 109508 transitions. [2019-09-10 08:47:51,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 70613 states and 109508 transitions. [2019-09-10 08:47:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:47:51,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:51,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:51,585 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1870282559, now seen corresponding path program 1 times [2019-09-10 08:47:51,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:51,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:51,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:51,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:51,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:51,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:51,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:51,741 INFO L87 Difference]: Start difference. First operand 70613 states and 109508 transitions. Second operand 3 states. [2019-09-10 08:47:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:52,041 INFO L93 Difference]: Finished difference Result 140459 states and 217660 transitions. [2019-09-10 08:47:52,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:52,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:47:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:52,178 INFO L225 Difference]: With dead ends: 140459 [2019-09-10 08:47:52,179 INFO L226 Difference]: Without dead ends: 140459 [2019-09-10 08:47:52,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140459 states. [2019-09-10 08:47:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140459 to 70717. [2019-09-10 08:47:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70717 states. [2019-09-10 08:47:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70717 states to 70717 states and 109651 transitions. [2019-09-10 08:47:55,200 INFO L78 Accepts]: Start accepts. Automaton has 70717 states and 109651 transitions. Word has length 318 [2019-09-10 08:47:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:55,201 INFO L475 AbstractCegarLoop]: Abstraction has 70717 states and 109651 transitions. [2019-09-10 08:47:55,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 70717 states and 109651 transitions. [2019-09-10 08:47:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 08:47:55,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:55,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:55,235 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1807698497, now seen corresponding path program 1 times [2019-09-10 08:47:55,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:55,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:55,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:55,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:55,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:55,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:55,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:55,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:55,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:55,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:55,378 INFO L87 Difference]: Start difference. First operand 70717 states and 109651 transitions. Second operand 3 states. [2019-09-10 08:47:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:56,028 INFO L93 Difference]: Finished difference Result 140584 states and 217806 transitions. [2019-09-10 08:47:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:56,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-10 08:47:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:56,197 INFO L225 Difference]: With dead ends: 140584 [2019-09-10 08:47:56,198 INFO L226 Difference]: Without dead ends: 140584 [2019-09-10 08:47:56,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140584 states. [2019-09-10 08:47:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140584 to 70842. [2019-09-10 08:47:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70842 states. [2019-09-10 08:47:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70842 states to 70842 states and 109797 transitions. [2019-09-10 08:47:59,186 INFO L78 Accepts]: Start accepts. Automaton has 70842 states and 109797 transitions. Word has length 319 [2019-09-10 08:47:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:59,187 INFO L475 AbstractCegarLoop]: Abstraction has 70842 states and 109797 transitions. [2019-09-10 08:47:59,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 70842 states and 109797 transitions. [2019-09-10 08:47:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:47:59,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:59,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:59,225 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1740228124, now seen corresponding path program 1 times [2019-09-10 08:47:59,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:59,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:59,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:59,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:59,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:59,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:59,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:59,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:59,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:59,408 INFO L87 Difference]: Start difference. First operand 70842 states and 109797 transitions. Second operand 3 states. [2019-09-10 08:47:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:59,800 INFO L93 Difference]: Finished difference Result 113132 states and 176434 transitions. [2019-09-10 08:47:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:59,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:47:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:59,934 INFO L225 Difference]: With dead ends: 113132 [2019-09-10 08:47:59,934 INFO L226 Difference]: Without dead ends: 113132 [2019-09-10 08:47:59,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113132 states. [2019-09-10 08:48:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113132 to 97226. [2019-09-10 08:48:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97226 states. [2019-09-10 08:48:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97226 states to 97226 states and 152957 transitions. [2019-09-10 08:48:01,332 INFO L78 Accepts]: Start accepts. Automaton has 97226 states and 152957 transitions. Word has length 320 [2019-09-10 08:48:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:01,332 INFO L475 AbstractCegarLoop]: Abstraction has 97226 states and 152957 transitions. [2019-09-10 08:48:01,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 97226 states and 152957 transitions. [2019-09-10 08:48:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:48:01,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:01,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:01,368 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1941514580, now seen corresponding path program 1 times [2019-09-10 08:48:01,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:01,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:01,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:01,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:01,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:01,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:01,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:01,916 INFO L87 Difference]: Start difference. First operand 97226 states and 152957 transitions. Second operand 4 states. [2019-09-10 08:48:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:02,312 INFO L93 Difference]: Finished difference Result 98910 states and 154690 transitions. [2019-09-10 08:48:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:02,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 08:48:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:02,415 INFO L225 Difference]: With dead ends: 98910 [2019-09-10 08:48:02,415 INFO L226 Difference]: Without dead ends: 98116 [2019-09-10 08:48:02,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98116 states. [2019-09-10 08:48:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98116 to 98114. [2019-09-10 08:48:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98114 states. [2019-09-10 08:48:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98114 states to 98114 states and 153494 transitions. [2019-09-10 08:48:03,995 INFO L78 Accepts]: Start accepts. Automaton has 98114 states and 153494 transitions. Word has length 320 [2019-09-10 08:48:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:03,996 INFO L475 AbstractCegarLoop]: Abstraction has 98114 states and 153494 transitions. [2019-09-10 08:48:03,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:03,996 INFO L276 IsEmpty]: Start isEmpty. Operand 98114 states and 153494 transitions. [2019-09-10 08:48:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:48:04,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:04,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:04,031 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:04,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:04,031 INFO L82 PathProgramCache]: Analyzing trace with hash 198924753, now seen corresponding path program 1 times [2019-09-10 08:48:04,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:04,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:04,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:04,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:48:04,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:04,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:48:04,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:48:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:48:04,431 INFO L87 Difference]: Start difference. First operand 98114 states and 153494 transitions. Second operand 9 states. [2019-09-10 08:48:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:12,431 INFO L93 Difference]: Finished difference Result 758022 states and 1197840 transitions. [2019-09-10 08:48:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:48:12,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 321 [2019-09-10 08:48:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:13,333 INFO L225 Difference]: With dead ends: 758022 [2019-09-10 08:48:13,334 INFO L226 Difference]: Without dead ends: 758022 [2019-09-10 08:48:13,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:48:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758022 states. [2019-09-10 08:48:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758022 to 299634. [2019-09-10 08:48:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299634 states. [2019-09-10 08:48:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299634 states to 299634 states and 469234 transitions. [2019-09-10 08:48:24,915 INFO L78 Accepts]: Start accepts. Automaton has 299634 states and 469234 transitions. Word has length 321 [2019-09-10 08:48:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:24,916 INFO L475 AbstractCegarLoop]: Abstraction has 299634 states and 469234 transitions. [2019-09-10 08:48:24,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:48:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 299634 states and 469234 transitions. [2019-09-10 08:48:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:48:25,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:25,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:25,019 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash 20753511, now seen corresponding path program 1 times [2019-09-10 08:48:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:25,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:25,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:25,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:26,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:26,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:48:26,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:26,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:48:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:48:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:48:26,627 INFO L87 Difference]: Start difference. First operand 299634 states and 469234 transitions. Second operand 10 states. [2019-09-10 08:48:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:30,179 INFO L93 Difference]: Finished difference Result 537298 states and 842782 transitions. [2019-09-10 08:48:30,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:48:30,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 321 [2019-09-10 08:48:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:30,908 INFO L225 Difference]: With dead ends: 537298 [2019-09-10 08:48:30,908 INFO L226 Difference]: Without dead ends: 537298 [2019-09-10 08:48:30,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:48:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537298 states. [2019-09-10 08:48:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537298 to 214570. [2019-09-10 08:48:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214570 states. [2019-09-10 08:48:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214570 states to 214570 states and 333470 transitions. [2019-09-10 08:48:42,450 INFO L78 Accepts]: Start accepts. Automaton has 214570 states and 333470 transitions. Word has length 321 [2019-09-10 08:48:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:42,450 INFO L475 AbstractCegarLoop]: Abstraction has 214570 states and 333470 transitions. [2019-09-10 08:48:42,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:48:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 214570 states and 333470 transitions. [2019-09-10 08:48:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:48:42,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:42,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:42,503 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:42,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:42,504 INFO L82 PathProgramCache]: Analyzing trace with hash 461727222, now seen corresponding path program 1 times [2019-09-10 08:48:42,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:42,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:42,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:42,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:42,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:42,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:42,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:42,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:42,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:42,965 INFO L87 Difference]: Start difference. First operand 214570 states and 333470 transitions. Second operand 4 states. [2019-09-10 08:48:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:44,102 INFO L93 Difference]: Finished difference Result 418835 states and 647942 transitions. [2019-09-10 08:48:44,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:44,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-10 08:48:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:46,061 INFO L225 Difference]: With dead ends: 418835 [2019-09-10 08:48:46,061 INFO L226 Difference]: Without dead ends: 418835 [2019-09-10 08:48:46,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:48:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418835 states. [2019-09-10 08:48:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418835 to 418833. [2019-09-10 08:48:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418833 states. [2019-09-10 08:48:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418833 states to 418833 states and 647941 transitions. [2019-09-10 08:48:57,312 INFO L78 Accepts]: Start accepts. Automaton has 418833 states and 647941 transitions. Word has length 321 [2019-09-10 08:48:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:57,312 INFO L475 AbstractCegarLoop]: Abstraction has 418833 states and 647941 transitions. [2019-09-10 08:48:57,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 418833 states and 647941 transitions. [2019-09-10 08:48:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:48:57,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:57,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:57,442 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash -925504248, now seen corresponding path program 1 times [2019-09-10 08:48:57,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:57,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:57,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:57,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:57,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:57,745 INFO L87 Difference]: Start difference. First operand 418833 states and 647941 transitions. Second operand 4 states. [2019-09-10 08:49:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:04,380 INFO L93 Difference]: Finished difference Result 837064 states and 1294868 transitions. [2019-09-10 08:49:04,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:04,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 08:49:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:06,555 INFO L225 Difference]: With dead ends: 837064 [2019-09-10 08:49:06,555 INFO L226 Difference]: Without dead ends: 837064 [2019-09-10 08:49:06,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:49:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837064 states. [2019-09-10 08:49:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837064 to 419862. [2019-09-10 08:49:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419862 states. [2019-09-10 08:49:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419862 states to 419862 states and 649665 transitions. [2019-09-10 08:49:20,013 INFO L78 Accepts]: Start accepts. Automaton has 419862 states and 649665 transitions. Word has length 322 [2019-09-10 08:49:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:20,014 INFO L475 AbstractCegarLoop]: Abstraction has 419862 states and 649665 transitions. [2019-09-10 08:49:20,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 419862 states and 649665 transitions. [2019-09-10 08:49:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:49:20,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:20,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:20,135 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -502421795, now seen corresponding path program 1 times [2019-09-10 08:49:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:20,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:20,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:20,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:20,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:20,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:20,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:20,374 INFO L87 Difference]: Start difference. First operand 419862 states and 649665 transitions. Second operand 3 states. [2019-09-10 08:49:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:23,181 INFO L93 Difference]: Finished difference Result 819496 states and 1260269 transitions. [2019-09-10 08:49:23,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:23,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:49:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:24,222 INFO L225 Difference]: With dead ends: 819496 [2019-09-10 08:49:24,222 INFO L226 Difference]: Without dead ends: 819496 [2019-09-10 08:49:24,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819496 states. [2019-09-10 08:49:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819496 to 819494. [2019-09-10 08:49:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819494 states. [2019-09-10 08:49:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819494 states to 819494 states and 1260268 transitions. [2019-09-10 08:49:55,976 INFO L78 Accepts]: Start accepts. Automaton has 819494 states and 1260268 transitions. Word has length 322 [2019-09-10 08:49:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:55,976 INFO L475 AbstractCegarLoop]: Abstraction has 819494 states and 1260268 transitions. [2019-09-10 08:49:55,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 819494 states and 1260268 transitions. [2019-09-10 08:49:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-10 08:49:56,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:56,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:56,203 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash 451991542, now seen corresponding path program 1 times [2019-09-10 08:49:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:56,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:56,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:56,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:56,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:56,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:56,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:56,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:56,416 INFO L87 Difference]: Start difference. First operand 819494 states and 1260268 transitions. Second operand 3 states. [2019-09-10 08:50:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:07,439 INFO L93 Difference]: Finished difference Result 1512197 states and 2315108 transitions. [2019-09-10 08:50:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:07,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-10 08:50:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:09,466 INFO L225 Difference]: With dead ends: 1512197 [2019-09-10 08:50:09,466 INFO L226 Difference]: Without dead ends: 1512197 [2019-09-10 08:50:09,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512197 states. [2019-09-10 08:50:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512197 to 1512195. [2019-09-10 08:50:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512195 states. [2019-09-10 08:51:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512195 states to 1512195 states and 2315107 transitions. [2019-09-10 08:51:11,078 INFO L78 Accepts]: Start accepts. Automaton has 1512195 states and 2315107 transitions. Word has length 323 [2019-09-10 08:51:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:11,078 INFO L475 AbstractCegarLoop]: Abstraction has 1512195 states and 2315107 transitions. [2019-09-10 08:51:11,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:51:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1512195 states and 2315107 transitions. [2019-09-10 08:51:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:51:11,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:11,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:11,621 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash 149915828, now seen corresponding path program 1 times [2019-09-10 08:51:11,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:11,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:11,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:51:12,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:12,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:12,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:12,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:12,007 INFO L87 Difference]: Start difference. First operand 1512195 states and 2315107 transitions. Second operand 4 states. [2019-09-10 08:51:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:51:34,223 INFO L93 Difference]: Finished difference Result 2962896 states and 4519624 transitions. [2019-09-10 08:51:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:51:34,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 08:51:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:40,266 INFO L225 Difference]: With dead ends: 2962896 [2019-09-10 08:51:40,266 INFO L226 Difference]: Without dead ends: 2962896 [2019-09-10 08:51:40,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:51:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962896 states.