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.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:03:59,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:03:59,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:03:59,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:03:59,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:03:59,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:03:59,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:03:59,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:03:59,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:03:59,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:03:59,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:03:59,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:03:59,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:03:59,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:03:59,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:03:59,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:03:59,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:03:59,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:03:59,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:03:59,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:03:59,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:03:59,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:03:59,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:03:59,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:03:59,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:03:59,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:03:59,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:03:59,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:03:59,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:03:59,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:03:59,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:03:59,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:03:59,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:03:59,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:03:59,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:03:59,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:03:59,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:03:59,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:03:59,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:03:59,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:03:59,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:03:59,917 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 09:03:59,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:03:59,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:03:59,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:03:59,933 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:03:59,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:03:59,933 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:03:59,933 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:03:59,934 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:03:59,934 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:03:59,934 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:03:59,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:03:59,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:03:59,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:03:59,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:03:59,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:03:59,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:03:59,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:03:59,936 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:03:59,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:03:59,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:03:59,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:03:59,937 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:03:59,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:03:59,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:03:59,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:03:59,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:03:59,938 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:03:59,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:03:59,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:03:59,939 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:03:59,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:03:59,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:03:59,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:03:59,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:03:59,982 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:03:59,983 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.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 09:04:00,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56030d3ea/be75a74ff43d4c5c827b734ee7fe342d/FLAG3e21e3d93 [2019-09-10 09:04:00,656 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:04:00,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 09:04:00,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56030d3ea/be75a74ff43d4c5c827b734ee7fe342d/FLAG3e21e3d93 [2019-09-10 09:04:00,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56030d3ea/be75a74ff43d4c5c827b734ee7fe342d [2019-09-10 09:04:00,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:04:00,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:04:00,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:04:00,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:04:00,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:04:00,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:04:00" (1/1) ... [2019-09-10 09:04:00,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:00, skipping insertion in model container [2019-09-10 09:04:00,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:04:00" (1/1) ... [2019-09-10 09:04:00,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:04:00,999 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:04:01,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:04:01,662 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:04:01,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:04:01,957 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:04:01,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01 WrapperNode [2019-09-10 09:04:01,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:04:01,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:04:01,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:04:01,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:04:01,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (1/1) ... [2019-09-10 09:04:01,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (1/1) ... [2019-09-10 09:04:02,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (1/1) ... [2019-09-10 09:04:02,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (1/1) ... [2019-09-10 09:04:02,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (1/1) ... [2019-09-10 09:04:02,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (1/1) ... [2019-09-10 09:04:02,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (1/1) ... [2019-09-10 09:04:02,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:04:02,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:04:02,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:04:02,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:04:02,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (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 09:04:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:04:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:04:02,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:04:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:04:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:04:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 09:04:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:04:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:04:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:04:02,228 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:04:02,228 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:04:02,228 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:04:02,228 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:04:02,229 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:04:02,229 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:04:02,229 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:04:02,229 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:04:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:04:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:04:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:04:02,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:04:04,895 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:04:04,895 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:04:04,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:04:04 BoogieIcfgContainer [2019-09-10 09:04:04,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:04:04,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:04:04,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:04:04,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:04:04,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:04:00" (1/3) ... [2019-09-10 09:04:04,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3577b149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:04:04, skipping insertion in model container [2019-09-10 09:04:04,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:04:01" (2/3) ... [2019-09-10 09:04:04,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3577b149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:04:04, skipping insertion in model container [2019-09-10 09:04:04,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:04:04" (3/3) ... [2019-09-10 09:04:04,908 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 09:04:04,919 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:04:04,942 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:04:04,965 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:04:05,006 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:04:05,006 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:04:05,007 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:04:05,007 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:04:05,007 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:04:05,008 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:04:05,008 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:04:05,008 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:04:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states. [2019-09-10 09:04:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 09:04:05,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:05,118 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] [2019-09-10 09:04:05,120 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1476174912, now seen corresponding path program 1 times [2019-09-10 09:04:05,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:05,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:05,952 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 09:04:05,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:05,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:05,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:05,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:05,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:05,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:05,977 INFO L87 Difference]: Start difference. First operand 785 states. Second operand 3 states. [2019-09-10 09:04:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:06,173 INFO L93 Difference]: Finished difference Result 1004 states and 1788 transitions. [2019-09-10 09:04:06,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:06,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-10 09:04:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:06,210 INFO L225 Difference]: With dead ends: 1004 [2019-09-10 09:04:06,210 INFO L226 Difference]: Without dead ends: 996 [2019-09-10 09:04:06,213 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 09:04:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-09-10 09:04:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 993. [2019-09-10 09:04:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-10 09:04:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1714 transitions. [2019-09-10 09:04:06,324 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1714 transitions. Word has length 217 [2019-09-10 09:04:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:06,325 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1714 transitions. [2019-09-10 09:04:06,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1714 transitions. [2019-09-10 09:04:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-10 09:04:06,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:06,331 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] [2019-09-10 09:04:06,332 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash 590177669, now seen corresponding path program 1 times [2019-09-10 09:04:06,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:06,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:06,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:06,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:06,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:06,600 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 09:04:06,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:06,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:06,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:06,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:06,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:06,605 INFO L87 Difference]: Start difference. First operand 993 states and 1714 transitions. Second operand 3 states. [2019-09-10 09:04:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:06,660 INFO L93 Difference]: Finished difference Result 1410 states and 2408 transitions. [2019-09-10 09:04:06,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:06,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-10 09:04:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:06,673 INFO L225 Difference]: With dead ends: 1410 [2019-09-10 09:04:06,674 INFO L226 Difference]: Without dead ends: 1410 [2019-09-10 09:04:06,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 09:04:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-09-10 09:04:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1406. [2019-09-10 09:04:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1406 states. [2019-09-10 09:04:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2405 transitions. [2019-09-10 09:04:06,719 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2405 transitions. Word has length 221 [2019-09-10 09:04:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:06,720 INFO L475 AbstractCegarLoop]: Abstraction has 1406 states and 2405 transitions. [2019-09-10 09:04:06,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2405 transitions. [2019-09-10 09:04:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-10 09:04:06,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:06,725 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] [2019-09-10 09:04:06,725 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash 993447882, now seen corresponding path program 1 times [2019-09-10 09:04:06,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:06,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:04:07,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:07,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:07,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:07,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:07,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:07,072 INFO L87 Difference]: Start difference. First operand 1406 states and 2405 transitions. Second operand 3 states. [2019-09-10 09:04:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:07,136 INFO L93 Difference]: Finished difference Result 2212 states and 3742 transitions. [2019-09-10 09:04:07,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:07,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-10 09:04:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:07,151 INFO L225 Difference]: With dead ends: 2212 [2019-09-10 09:04:07,152 INFO L226 Difference]: Without dead ends: 2212 [2019-09-10 09:04:07,152 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 09:04:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2019-09-10 09:04:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2206. [2019-09-10 09:04:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-09-10 09:04:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3737 transitions. [2019-09-10 09:04:07,209 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3737 transitions. Word has length 225 [2019-09-10 09:04:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:07,209 INFO L475 AbstractCegarLoop]: Abstraction has 2206 states and 3737 transitions. [2019-09-10 09:04:07,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3737 transitions. [2019-09-10 09:04:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 09:04:07,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:07,215 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] [2019-09-10 09:04:07,215 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2006883697, now seen corresponding path program 1 times [2019-09-10 09:04:07,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:07,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:07,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:07,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:07,439 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 09:04:07,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:07,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:07,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:07,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:07,441 INFO L87 Difference]: Start difference. First operand 2206 states and 3737 transitions. Second operand 3 states. [2019-09-10 09:04:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:07,510 INFO L93 Difference]: Finished difference Result 3764 states and 6310 transitions. [2019-09-10 09:04:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:07,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-10 09:04:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:07,530 INFO L225 Difference]: With dead ends: 3764 [2019-09-10 09:04:07,530 INFO L226 Difference]: Without dead ends: 3764 [2019-09-10 09:04:07,531 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 09:04:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2019-09-10 09:04:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3754. [2019-09-10 09:04:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3754 states. [2019-09-10 09:04:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 6301 transitions. [2019-09-10 09:04:07,633 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 6301 transitions. Word has length 229 [2019-09-10 09:04:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:07,634 INFO L475 AbstractCegarLoop]: Abstraction has 3754 states and 6301 transitions. [2019-09-10 09:04:07,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 6301 transitions. [2019-09-10 09:04:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-10 09:04:07,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:07,640 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] [2019-09-10 09:04:07,640 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1918804652, now seen corresponding path program 1 times [2019-09-10 09:04:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:07,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:07,941 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 09:04:07,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:07,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:07,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:07,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:07,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:07,944 INFO L87 Difference]: Start difference. First operand 3754 states and 6301 transitions. Second operand 3 states. [2019-09-10 09:04:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:08,057 INFO L93 Difference]: Finished difference Result 6764 states and 11246 transitions. [2019-09-10 09:04:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:08,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-10 09:04:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:08,104 INFO L225 Difference]: With dead ends: 6764 [2019-09-10 09:04:08,105 INFO L226 Difference]: Without dead ends: 6764 [2019-09-10 09:04:08,105 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 09:04:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2019-09-10 09:04:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 6746. [2019-09-10 09:04:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6746 states. [2019-09-10 09:04:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 11229 transitions. [2019-09-10 09:04:08,306 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 11229 transitions. Word has length 233 [2019-09-10 09:04:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:08,307 INFO L475 AbstractCegarLoop]: Abstraction has 6746 states and 11229 transitions. [2019-09-10 09:04:08,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 11229 transitions. [2019-09-10 09:04:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 09:04:08,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:08,316 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:08,316 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:08,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:08,317 INFO L82 PathProgramCache]: Analyzing trace with hash -262750311, now seen corresponding path program 1 times [2019-09-10 09:04:08,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:08,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:08,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:08,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:08,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:04:08,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:08,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:04:08,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:08,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:04:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:04:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:04:08,871 INFO L87 Difference]: Start difference. First operand 6746 states and 11229 transitions. Second operand 7 states. [2019-09-10 09:04:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:09,724 INFO L93 Difference]: Finished difference Result 35130 states and 58495 transitions. [2019-09-10 09:04:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 09:04:09,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-10 09:04:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:09,842 INFO L225 Difference]: With dead ends: 35130 [2019-09-10 09:04:09,842 INFO L226 Difference]: Without dead ends: 35130 [2019-09-10 09:04:09,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-10 09:04:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35130 states. [2019-09-10 09:04:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35130 to 12778. [2019-09-10 09:04:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12778 states. [2019-09-10 09:04:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12778 states to 12778 states and 21183 transitions. [2019-09-10 09:04:10,532 INFO L78 Accepts]: Start accepts. Automaton has 12778 states and 21183 transitions. Word has length 237 [2019-09-10 09:04:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:10,533 INFO L475 AbstractCegarLoop]: Abstraction has 12778 states and 21183 transitions. [2019-09-10 09:04:10,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 09:04:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 12778 states and 21183 transitions. [2019-09-10 09:04:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 09:04:10,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:10,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 09:04:10,544 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:10,544 INFO L82 PathProgramCache]: Analyzing trace with hash 373948977, now seen corresponding path program 1 times [2019-09-10 09:04:10,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:10,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:10,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:10,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:04:10,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:10,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:10,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:10,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:10,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:10,871 INFO L87 Difference]: Start difference. First operand 12778 states and 21183 transitions. Second operand 4 states. [2019-09-10 09:04:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:11,068 INFO L93 Difference]: Finished difference Result 22080 states and 36693 transitions. [2019-09-10 09:04:11,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:11,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 09:04:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:11,127 INFO L225 Difference]: With dead ends: 22080 [2019-09-10 09:04:11,127 INFO L226 Difference]: Without dead ends: 22080 [2019-09-10 09:04:11,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:04:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22080 states. [2019-09-10 09:04:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22080 to 19004. [2019-09-10 09:04:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19004 states. [2019-09-10 09:04:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19004 states to 19004 states and 31524 transitions. [2019-09-10 09:04:11,531 INFO L78 Accepts]: Start accepts. Automaton has 19004 states and 31524 transitions. Word has length 238 [2019-09-10 09:04:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:11,532 INFO L475 AbstractCegarLoop]: Abstraction has 19004 states and 31524 transitions. [2019-09-10 09:04:11,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:04:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19004 states and 31524 transitions. [2019-09-10 09:04:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 09:04:11,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:11,544 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] [2019-09-10 09:04:11,544 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1358651552, now seen corresponding path program 1 times [2019-09-10 09:04:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:11,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:11,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:12,529 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 09:04:12,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:12,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:12,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:12,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:12,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:12,532 INFO L87 Difference]: Start difference. First operand 19004 states and 31524 transitions. Second operand 4 states. [2019-09-10 09:04:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:12,752 INFO L93 Difference]: Finished difference Result 32844 states and 54496 transitions. [2019-09-10 09:04:12,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:12,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-10 09:04:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:12,856 INFO L225 Difference]: With dead ends: 32844 [2019-09-10 09:04:12,857 INFO L226 Difference]: Without dead ends: 32844 [2019-09-10 09:04:12,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:04:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32844 states. [2019-09-10 09:04:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32844 to 28302. [2019-09-10 09:04:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28302 states. [2019-09-10 09:04:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28302 states to 28302 states and 46897 transitions. [2019-09-10 09:04:13,503 INFO L78 Accepts]: Start accepts. Automaton has 28302 states and 46897 transitions. Word has length 239 [2019-09-10 09:04:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:13,503 INFO L475 AbstractCegarLoop]: Abstraction has 28302 states and 46897 transitions. [2019-09-10 09:04:13,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:04:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28302 states and 46897 transitions. [2019-09-10 09:04:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 09:04:13,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:13,519 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] [2019-09-10 09:04:13,519 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 769864920, now seen corresponding path program 1 times [2019-09-10 09:04:13,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:13,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:13,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:13,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:13,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:13,918 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 09:04:13,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:13,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:13,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:13,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:13,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:13,921 INFO L87 Difference]: Start difference. First operand 28302 states and 46897 transitions. Second operand 4 states. [2019-09-10 09:04:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:14,194 INFO L93 Difference]: Finished difference Result 49594 states and 82207 transitions. [2019-09-10 09:04:14,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:14,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 09:04:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:14,327 INFO L225 Difference]: With dead ends: 49594 [2019-09-10 09:04:14,327 INFO L226 Difference]: Without dead ends: 49594 [2019-09-10 09:04:14,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 09:04:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49594 states. [2019-09-10 09:04:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49594 to 42178. [2019-09-10 09:04:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42178 states. [2019-09-10 09:04:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42178 states to 42178 states and 69829 transitions. [2019-09-10 09:04:15,049 INFO L78 Accepts]: Start accepts. Automaton has 42178 states and 69829 transitions. Word has length 240 [2019-09-10 09:04:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:15,050 INFO L475 AbstractCegarLoop]: Abstraction has 42178 states and 69829 transitions. [2019-09-10 09:04:15,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:04:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 42178 states and 69829 transitions. [2019-09-10 09:04:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:04:15,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:15,072 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] [2019-09-10 09:04:15,072 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:15,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1605280074, now seen corresponding path program 1 times [2019-09-10 09:04:15,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:15,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:15,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:15,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:15,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:16,150 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 09:04:16,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:16,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:16,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:16,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:16,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:16,156 INFO L87 Difference]: Start difference. First operand 42178 states and 69829 transitions. Second operand 3 states. [2019-09-10 09:04:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:16,400 INFO L93 Difference]: Finished difference Result 65264 states and 107805 transitions. [2019-09-10 09:04:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:16,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 09:04:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:16,523 INFO L225 Difference]: With dead ends: 65264 [2019-09-10 09:04:16,525 INFO L226 Difference]: Without dead ends: 65264 [2019-09-10 09:04:16,525 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 09:04:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65264 states. [2019-09-10 09:04:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65264 to 65262. [2019-09-10 09:04:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65262 states. [2019-09-10 09:04:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65262 states to 65262 states and 107804 transitions. [2019-09-10 09:04:18,935 INFO L78 Accepts]: Start accepts. Automaton has 65262 states and 107804 transitions. Word has length 241 [2019-09-10 09:04:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:18,936 INFO L475 AbstractCegarLoop]: Abstraction has 65262 states and 107804 transitions. [2019-09-10 09:04:18,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65262 states and 107804 transitions. [2019-09-10 09:04:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:04:18,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:18,944 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] [2019-09-10 09:04:18,945 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1855446932, now seen corresponding path program 1 times [2019-09-10 09:04:18,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:18,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:18,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:18,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:19,126 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 09:04:19,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:19,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:19,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:19,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:19,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:19,128 INFO L87 Difference]: Start difference. First operand 65262 states and 107804 transitions. Second operand 3 states. [2019-09-10 09:04:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:19,439 INFO L93 Difference]: Finished difference Result 100534 states and 165664 transitions. [2019-09-10 09:04:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:19,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 09:04:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:19,602 INFO L225 Difference]: With dead ends: 100534 [2019-09-10 09:04:19,603 INFO L226 Difference]: Without dead ends: 100534 [2019-09-10 09:04:19,603 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 09:04:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100534 states. [2019-09-10 09:04:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100534 to 100532. [2019-09-10 09:04:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100532 states. [2019-09-10 09:04:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100532 states to 100532 states and 165663 transitions. [2019-09-10 09:04:21,074 INFO L78 Accepts]: Start accepts. Automaton has 100532 states and 165663 transitions. Word has length 241 [2019-09-10 09:04:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:21,075 INFO L475 AbstractCegarLoop]: Abstraction has 100532 states and 165663 transitions. [2019-09-10 09:04:21,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 100532 states and 165663 transitions. [2019-09-10 09:04:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:04:21,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:21,081 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] [2019-09-10 09:04:21,081 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1177705458, now seen corresponding path program 1 times [2019-09-10 09:04:21,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:21,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:21,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:21,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:21,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:21,270 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 09:04:21,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:21,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:21,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:21,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:21,273 INFO L87 Difference]: Start difference. First operand 100532 states and 165663 transitions. Second operand 3 states. [2019-09-10 09:04:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:21,720 INFO L93 Difference]: Finished difference Result 141916 states and 233380 transitions. [2019-09-10 09:04:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:21,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 09:04:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:21,948 INFO L225 Difference]: With dead ends: 141916 [2019-09-10 09:04:21,948 INFO L226 Difference]: Without dead ends: 141916 [2019-09-10 09:04:21,948 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 09:04:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141916 states. [2019-09-10 09:04:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141916 to 141914. [2019-09-10 09:04:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141914 states. [2019-09-10 09:04:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141914 states to 141914 states and 233379 transitions. [2019-09-10 09:04:25,270 INFO L78 Accepts]: Start accepts. Automaton has 141914 states and 233379 transitions. Word has length 241 [2019-09-10 09:04:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:25,270 INFO L475 AbstractCegarLoop]: Abstraction has 141914 states and 233379 transitions. [2019-09-10 09:04:25,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:25,271 INFO L276 IsEmpty]: Start isEmpty. Operand 141914 states and 233379 transitions. [2019-09-10 09:04:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:04:25,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:25,276 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] [2019-09-10 09:04:25,276 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1164563408, now seen corresponding path program 1 times [2019-09-10 09:04:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:25,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:25,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:25,879 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 09:04:25,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:25,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:25,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:25,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:25,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:25,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:25,881 INFO L87 Difference]: Start difference. First operand 141914 states and 233379 transitions. Second operand 3 states. [2019-09-10 09:04:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:26,353 INFO L93 Difference]: Finished difference Result 198908 states and 326391 transitions. [2019-09-10 09:04:26,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:26,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 09:04:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:26,613 INFO L225 Difference]: With dead ends: 198908 [2019-09-10 09:04:26,613 INFO L226 Difference]: Without dead ends: 198908 [2019-09-10 09:04:26,614 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 09:04:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198908 states. [2019-09-10 09:04:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198908 to 198906. [2019-09-10 09:04:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198906 states. [2019-09-10 09:04:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198906 states to 198906 states and 326390 transitions. [2019-09-10 09:04:31,803 INFO L78 Accepts]: Start accepts. Automaton has 198906 states and 326390 transitions. Word has length 241 [2019-09-10 09:04:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:31,804 INFO L475 AbstractCegarLoop]: Abstraction has 198906 states and 326390 transitions. [2019-09-10 09:04:31,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 198906 states and 326390 transitions. [2019-09-10 09:04:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:04:31,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:31,809 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] [2019-09-10 09:04:31,810 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:31,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:31,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1961043161, now seen corresponding path program 1 times [2019-09-10 09:04:31,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:31,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:31,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:31,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:31,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:32,007 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 09:04:32,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:32,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:32,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:32,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:32,009 INFO L87 Difference]: Start difference. First operand 198906 states and 326390 transitions. Second operand 4 states. [2019-09-10 09:04:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:33,000 INFO L93 Difference]: Finished difference Result 385750 states and 633055 transitions. [2019-09-10 09:04:33,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:33,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-10 09:04:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:33,580 INFO L225 Difference]: With dead ends: 385750 [2019-09-10 09:04:33,580 INFO L226 Difference]: Without dead ends: 385750 [2019-09-10 09:04:33,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:04:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385750 states. [2019-09-10 09:04:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385750 to 324834. [2019-09-10 09:04:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324834 states. [2019-09-10 09:04:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324834 states to 324834 states and 532202 transitions. [2019-09-10 09:04:46,607 INFO L78 Accepts]: Start accepts. Automaton has 324834 states and 532202 transitions. Word has length 241 [2019-09-10 09:04:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:46,607 INFO L475 AbstractCegarLoop]: Abstraction has 324834 states and 532202 transitions. [2019-09-10 09:04:46,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:04:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 324834 states and 532202 transitions. [2019-09-10 09:04:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 09:04:46,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:46,612 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] [2019-09-10 09:04:46,613 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash 60152152, now seen corresponding path program 1 times [2019-09-10 09:04:46,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:46,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:46,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:46,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:46,772 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 09:04:46,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:46,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:46,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:46,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:46,773 INFO L87 Difference]: Start difference. First operand 324834 states and 532202 transitions. Second operand 3 states. [2019-09-10 09:04:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:47,995 INFO L93 Difference]: Finished difference Result 490722 states and 803113 transitions. [2019-09-10 09:04:47,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:47,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 09:04:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:48,702 INFO L225 Difference]: With dead ends: 490722 [2019-09-10 09:04:48,702 INFO L226 Difference]: Without dead ends: 490722 [2019-09-10 09:04:48,703 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 09:04:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490722 states. [2019-09-10 09:04:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490722 to 490720. [2019-09-10 09:04:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490720 states. [2019-09-10 09:04:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490720 states to 490720 states and 803112 transitions. [2019-09-10 09:04:55,828 INFO L78 Accepts]: Start accepts. Automaton has 490720 states and 803112 transitions. Word has length 241 [2019-09-10 09:04:55,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:55,829 INFO L475 AbstractCegarLoop]: Abstraction has 490720 states and 803112 transitions. [2019-09-10 09:04:55,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 490720 states and 803112 transitions. [2019-09-10 09:04:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 09:04:55,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:55,834 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] [2019-09-10 09:04:55,834 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -715289729, now seen corresponding path program 1 times [2019-09-10 09:04:55,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:55,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:55,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:55,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:03,724 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 09:05:03,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:03,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:05:03,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:03,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:05:03,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:05:03,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:05:03,728 INFO L87 Difference]: Start difference. First operand 490720 states and 803112 transitions. Second operand 8 states. [2019-09-10 09:05:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:22,897 INFO L93 Difference]: Finished difference Result 2228126 states and 3646535 transitions. [2019-09-10 09:05:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 09:05:22,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-10 09:05:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:26,350 INFO L225 Difference]: With dead ends: 2228126 [2019-09-10 09:05:26,351 INFO L226 Difference]: Without dead ends: 2228126 [2019-09-10 09:05:26,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-10 09:05:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228126 states. [2019-09-10 09:06:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228126 to 1350397. [2019-09-10 09:06:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350397 states. [2019-09-10 09:06:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350397 states to 1350397 states and 2201610 transitions. [2019-09-10 09:06:15,817 INFO L78 Accepts]: Start accepts. Automaton has 1350397 states and 2201610 transitions. Word has length 242 [2019-09-10 09:06:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:15,818 INFO L475 AbstractCegarLoop]: Abstraction has 1350397 states and 2201610 transitions. [2019-09-10 09:06:15,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:06:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1350397 states and 2201610 transitions. [2019-09-10 09:06:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 09:06:15,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:15,820 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] [2019-09-10 09:06:15,820 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1688280689, now seen corresponding path program 1 times [2019-09-10 09:06:15,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:15,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:15,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:28,304 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 09:06:28,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:28,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 09:06:28,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:28,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 09:06:28,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 09:06:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 09:06:28,306 INFO L87 Difference]: Start difference. First operand 1350397 states and 2201610 transitions. Second operand 7 states. [2019-09-10 09:06:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:44,700 INFO L93 Difference]: Finished difference Result 1916761 states and 3127035 transitions. [2019-09-10 09:06:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 09:06:44,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-09-10 09:06:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:48,731 INFO L225 Difference]: With dead ends: 1916761 [2019-09-10 09:06:48,732 INFO L226 Difference]: Without dead ends: 1916761 [2019-09-10 09:06:48,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:06:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916761 states.