/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 05:34:33,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 05:34:33,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 05:34:33,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 05:34:33,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 05:34:33,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 05:34:33,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 05:34:33,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 05:34:33,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 05:34:33,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 05:34:33,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 05:34:33,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 05:34:33,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 05:34:33,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 05:34:33,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 05:34:33,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 05:34:33,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 05:34:33,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 05:34:33,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 05:34:33,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 05:34:33,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 05:34:33,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 05:34:33,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 05:34:33,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 05:34:33,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 05:34:33,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 05:34:33,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 05:34:33,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 05:34:33,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 05:34:33,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 05:34:33,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 05:34:33,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 05:34:33,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 05:34:33,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 05:34:33,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 05:34:33,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 05:34:33,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 05:34:33,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 05:34:33,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 05:34:33,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 05:34:33,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 05:34:33,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 05:34:33,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 05:34:33,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 05:34:33,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 05:34:33,902 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 05:34:33,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 05:34:33,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 05:34:33,903 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 05:34:33,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 05:34:33,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 05:34:33,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 05:34:33,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 05:34:33,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 05:34:33,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 05:34:33,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 05:34:33,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:34:33,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 05:34:33,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 05:34:33,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 05:34:33,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 05:34:33,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 05:34:33,906 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 05:34:33,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 05:34:33,906 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 05:34:33,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 05:34:34,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 05:34:34,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 05:34:34,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 05:34:34,089 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 05:34:34,090 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 05:34:34,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-01-19 05:34:34,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d367794dc/fb470a0b28a44701a6a6d255b8e87f01/FLAG528731f18 [2022-01-19 05:34:34,510 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 05:34:34,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-01-19 05:34:34,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d367794dc/fb470a0b28a44701a6a6d255b8e87f01/FLAG528731f18 [2022-01-19 05:34:34,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d367794dc/fb470a0b28a44701a6a6d255b8e87f01 [2022-01-19 05:34:34,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 05:34:34,531 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 05:34:34,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 05:34:34,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 05:34:34,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 05:34:34,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1ba88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34, skipping insertion in model container [2022-01-19 05:34:34,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 05:34:34,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 05:34:34,715 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 05:34:34,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39095,39108] [2022-01-19 05:34:34,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39180,39193] [2022-01-19 05:34:34,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39232,39245] [2022-01-19 05:34:34,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:34:34,848 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 05:34:34,861 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-19 05:34:34,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39095,39108] [2022-01-19 05:34:34,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39180,39193] [2022-01-19 05:34:34,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i[39232,39245] [2022-01-19 05:34:34,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 05:34:34,931 INFO L208 MainTranslator]: Completed translation [2022-01-19 05:34:34,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34 WrapperNode [2022-01-19 05:34:34,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 05:34:34,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 05:34:34,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 05:34:34,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 05:34:34,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,985 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2022-01-19 05:34:34,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 05:34:34,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 05:34:34,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 05:34:34,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 05:34:34,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:34,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:35,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:35,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:35,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 05:34:35,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 05:34:35,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 05:34:35,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 05:34:35,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (1/1) ... [2022-01-19 05:34:35,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 05:34:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 05:34:35,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 05:34:35,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 05:34:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2022-01-19 05:34:35,083 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2022-01-19 05:34:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 05:34:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 05:34:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 05:34:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 05:34:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 05:34:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 05:34:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 05:34:35,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 05:34:35,085 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 05:34:35,158 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 05:34:35,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 05:34:35,321 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 05:34:35,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 05:34:35,326 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 05:34:35,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:34:35 BoogieIcfgContainer [2022-01-19 05:34:35,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 05:34:35,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 05:34:35,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 05:34:35,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 05:34:35,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 05:34:34" (1/3) ... [2022-01-19 05:34:35,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed0f0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:34:35, skipping insertion in model container [2022-01-19 05:34:35,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:34:34" (2/3) ... [2022-01-19 05:34:35,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed0f0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:34:35, skipping insertion in model container [2022-01-19 05:34:35,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:34:35" (3/3) ... [2022-01-19 05:34:35,333 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2022-01-19 05:34:35,336 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 05:34:35,337 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 05:34:35,337 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 05:34:35,371 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,372 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,372 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,372 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,372 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,372 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,372 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,372 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,373 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,374 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,374 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,374 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,374 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,374 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,374 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,375 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,375 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,375 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,375 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,376 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,376 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,376 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,376 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,376 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,377 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,378 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,379 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,384 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,385 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,386 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,387 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,388 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,388 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,388 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,388 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,388 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,388 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,388 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,389 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,389 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,389 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,389 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,389 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,389 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,390 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,390 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,390 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,391 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,391 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,391 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,391 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,391 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,391 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,391 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,392 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,392 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,392 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,392 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,392 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,392 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,392 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,393 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,394 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,394 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,394 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,394 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,394 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,394 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,395 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,395 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,395 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,395 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,395 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,396 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,396 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,396 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,396 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,396 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,396 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,397 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,397 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,397 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,397 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,397 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,397 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,397 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,398 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,399 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,400 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,401 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,402 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,402 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,402 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,402 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,402 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,402 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,403 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,404 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,405 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,405 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,405 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,406 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,406 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,406 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,406 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,406 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,406 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,407 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,407 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,407 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,407 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,407 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,408 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,408 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,408 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,408 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,408 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,409 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,409 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,409 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,409 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,409 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,409 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,409 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,410 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,410 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,410 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,410 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,410 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,410 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,410 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,411 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,411 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,411 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,411 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,411 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,411 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,412 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,412 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,412 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,412 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,414 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,414 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,414 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,415 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,416 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,417 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,417 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,417 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,417 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,417 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,417 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,417 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 05:34:35,420 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 05:34:35,450 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 05:34:35,455 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 05:34:35,455 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 05:34:35,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 158 transitions, 324 flow [2022-01-19 05:34:35,507 INFO L129 PetriNetUnfolder]: 10/157 cut-off events. [2022-01-19 05:34:35,507 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 05:34:35,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 157 events. 10/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 270 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-01-19 05:34:35,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 158 transitions, 324 flow [2022-01-19 05:34:35,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 148 transitions, 299 flow [2022-01-19 05:34:35,527 INFO L129 PetriNetUnfolder]: 2/51 cut-off events. [2022-01-19 05:34:35,527 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:34:35,528 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:35,528 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:35,528 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash 847621616, now seen corresponding path program 1 times [2022-01-19 05:34:35,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:35,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930883670] [2022-01-19 05:34:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:35,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:34:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:34:35,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:34:35,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930883670] [2022-01-19 05:34:35,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930883670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:34:35,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:34:35,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 05:34:35,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366905166] [2022-01-19 05:34:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:34:35,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 05:34:35,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:34:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 05:34:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 05:34:35,734 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 158 [2022-01-19 05:34:35,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 148 transitions, 299 flow. Second operand has 2 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:34:35,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 158 [2022-01-19 05:34:35,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:34:35,764 INFO L129 PetriNetUnfolder]: 4/142 cut-off events. [2022-01-19 05:34:35,764 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 05:34:35,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 4/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 213 event pairs, 0 based on Foata normal form. 6/141 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2022-01-19 05:34:35,766 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 1 selfloop transitions, 0 changer transitions 0/142 dead transitions. [2022-01-19 05:34:35,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 289 flow [2022-01-19 05:34:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 05:34:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 05:34:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-01-19 05:34:35,775 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9715189873417721 [2022-01-19 05:34:35,776 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-01-19 05:34:35,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-01-19 05:34:35,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:34:35,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-01-19 05:34:35,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,784 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,786 INFO L186 Difference]: Start difference. First operand has 142 places, 148 transitions, 299 flow. Second operand 2 states and 307 transitions. [2022-01-19 05:34:35,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 289 flow [2022-01-19 05:34:35,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 142 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 05:34:35,792 INFO L242 Difference]: Finished difference. Result has 142 places, 142 transitions, 286 flow [2022-01-19 05:34:35,793 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=286, PETRI_PLACES=142, PETRI_TRANSITIONS=142} [2022-01-19 05:34:35,795 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2022-01-19 05:34:35,795 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 286 flow [2022-01-19 05:34:35,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,796 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:35,796 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:35,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 05:34:35,796 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash 506434889, now seen corresponding path program 1 times [2022-01-19 05:34:35,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:35,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231092425] [2022-01-19 05:34:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:35,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:34:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:34:35,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:34:35,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231092425] [2022-01-19 05:34:35,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231092425] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:34:35,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:34:35,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 05:34:35,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143282921] [2022-01-19 05:34:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:34:35,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 05:34:35,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:34:35,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 05:34:35,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 05:34:35,852 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 158 [2022-01-19 05:34:35,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 142 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:34:35,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 158 [2022-01-19 05:34:35,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:34:35,888 INFO L129 PetriNetUnfolder]: 5/185 cut-off events. [2022-01-19 05:34:35,889 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 05:34:35,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 185 events. 5/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 196. Up to 7 conditions per place. [2022-01-19 05:34:35,891 INFO L132 encePairwiseOnDemand]: 155/158 looper letters, 7 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2022-01-19 05:34:35,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 145 transitions, 310 flow [2022-01-19 05:34:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 05:34:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 05:34:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-01-19 05:34:35,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9388185654008439 [2022-01-19 05:34:35,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2022-01-19 05:34:35,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2022-01-19 05:34:35,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:34:35,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2022-01-19 05:34:35,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,898 INFO L186 Difference]: Start difference. First operand has 142 places, 142 transitions, 286 flow. Second operand 3 states and 445 transitions. [2022-01-19 05:34:35,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 145 transitions, 310 flow [2022-01-19 05:34:35,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 145 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 05:34:35,901 INFO L242 Difference]: Finished difference. Result has 145 places, 143 transitions, 298 flow [2022-01-19 05:34:35,901 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2022-01-19 05:34:35,901 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2022-01-19 05:34:35,902 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 298 flow [2022-01-19 05:34:35,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:35,902 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:35,902 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:35,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 05:34:35,902 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash -654644372, now seen corresponding path program 1 times [2022-01-19 05:34:35,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:35,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88939583] [2022-01-19 05:34:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:35,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:34:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:34:36,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:34:36,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88939583] [2022-01-19 05:34:36,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88939583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:34:36,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:34:36,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-19 05:34:36,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118145587] [2022-01-19 05:34:36,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:34:36,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 05:34:36,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:34:36,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 05:34:36,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-19 05:34:36,408 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 158 [2022-01-19 05:34:36,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 298 flow. Second operand has 18 states, 18 states have (on average 88.27777777777777) internal successors, (1589), 18 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:36,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:34:36,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 158 [2022-01-19 05:34:36,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:34:37,947 INFO L129 PetriNetUnfolder]: 583/2004 cut-off events. [2022-01-19 05:34:37,947 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 05:34:37,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 2004 events. 583/2004 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 12792 event pairs, 252 based on Foata normal form. 0/1894 useless extension candidates. Maximal degree in co-relation 3127. Up to 766 conditions per place. [2022-01-19 05:34:37,957 INFO L132 encePairwiseOnDemand]: 137/158 looper letters, 129 selfloop transitions, 34 changer transitions 10/255 dead transitions. [2022-01-19 05:34:37,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 255 transitions, 868 flow [2022-01-19 05:34:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 05:34:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 05:34:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2067 transitions. [2022-01-19 05:34:37,962 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5946490218642118 [2022-01-19 05:34:37,962 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2067 transitions. [2022-01-19 05:34:37,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2067 transitions. [2022-01-19 05:34:37,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:34:37,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2067 transitions. [2022-01-19 05:34:37,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 93.95454545454545) internal successors, (2067), 22 states have internal predecessors, (2067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:37,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 158.0) internal successors, (3634), 23 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:37,972 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 158.0) internal successors, (3634), 23 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:37,972 INFO L186 Difference]: Start difference. First operand has 145 places, 143 transitions, 298 flow. Second operand 22 states and 2067 transitions. [2022-01-19 05:34:37,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 255 transitions, 868 flow [2022-01-19 05:34:37,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 255 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 05:34:37,977 INFO L242 Difference]: Finished difference. Result has 175 places, 174 transitions, 503 flow [2022-01-19 05:34:37,977 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=503, PETRI_PLACES=175, PETRI_TRANSITIONS=174} [2022-01-19 05:34:37,977 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 33 predicate places. [2022-01-19 05:34:37,978 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 174 transitions, 503 flow [2022-01-19 05:34:37,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 88.27777777777777) internal successors, (1589), 18 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:37,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:37,978 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:37,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 05:34:37,979 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2143908831, now seen corresponding path program 1 times [2022-01-19 05:34:37,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:37,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481743242] [2022-01-19 05:34:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:37,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:34:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:34:38,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:34:38,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481743242] [2022-01-19 05:34:38,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481743242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:34:38,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:34:38,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:34:38,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162575054] [2022-01-19 05:34:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:34:38,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:34:38,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:34:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:34:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:34:38,604 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:34:38,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 174 transitions, 503 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:38,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:34:38,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:34:38,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:34:42,536 INFO L129 PetriNetUnfolder]: 1897/5425 cut-off events. [2022-01-19 05:34:42,537 INFO L130 PetriNetUnfolder]: For 1621/1626 co-relation queries the response was YES. [2022-01-19 05:34:42,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11032 conditions, 5425 events. 1897/5425 cut-off events. For 1621/1626 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 38964 event pairs, 636 based on Foata normal form. 20/5207 useless extension candidates. Maximal degree in co-relation 11017. Up to 1877 conditions per place. [2022-01-19 05:34:42,567 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 337 selfloop transitions, 91 changer transitions 3/502 dead transitions. [2022-01-19 05:34:42,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 502 transitions, 2593 flow [2022-01-19 05:34:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 05:34:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 05:34:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3138 transitions. [2022-01-19 05:34:42,573 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5367772836127267 [2022-01-19 05:34:42,573 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3138 transitions. [2022-01-19 05:34:42,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3138 transitions. [2022-01-19 05:34:42,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:34:42,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3138 transitions. [2022-01-19 05:34:42,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 84.8108108108108) internal successors, (3138), 37 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:42,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:42,586 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:42,587 INFO L186 Difference]: Start difference. First operand has 175 places, 174 transitions, 503 flow. Second operand 37 states and 3138 transitions. [2022-01-19 05:34:42,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 502 transitions, 2593 flow [2022-01-19 05:34:42,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 502 transitions, 2582 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 05:34:42,602 INFO L242 Difference]: Finished difference. Result has 230 places, 255 transitions, 1245 flow [2022-01-19 05:34:42,602 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1245, PETRI_PLACES=230, PETRI_TRANSITIONS=255} [2022-01-19 05:34:42,603 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 88 predicate places. [2022-01-19 05:34:42,603 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 255 transitions, 1245 flow [2022-01-19 05:34:42,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:42,604 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:42,605 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:42,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 05:34:42,606 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1028678017, now seen corresponding path program 2 times [2022-01-19 05:34:42,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:42,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975836399] [2022-01-19 05:34:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:42,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:34:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:34:43,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:34:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975836399] [2022-01-19 05:34:43,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975836399] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:34:43,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:34:43,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:34:43,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078852137] [2022-01-19 05:34:43,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:34:43,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:34:43,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:34:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:34:43,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:34:43,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:34:43,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 255 transitions, 1245 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:43,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:34:43,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:34:43,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:34:47,099 INFO L129 PetriNetUnfolder]: 2297/6566 cut-off events. [2022-01-19 05:34:47,099 INFO L130 PetriNetUnfolder]: For 8292/8295 co-relation queries the response was YES. [2022-01-19 05:34:47,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16912 conditions, 6566 events. 2297/6566 cut-off events. For 8292/8295 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 50250 event pairs, 427 based on Foata normal form. 18/6302 useless extension candidates. Maximal degree in co-relation 16872. Up to 2347 conditions per place. [2022-01-19 05:34:47,157 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 367 selfloop transitions, 116 changer transitions 1/555 dead transitions. [2022-01-19 05:34:47,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 555 transitions, 3917 flow [2022-01-19 05:34:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 05:34:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 05:34:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3117 transitions. [2022-01-19 05:34:47,163 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5331850838179952 [2022-01-19 05:34:47,163 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3117 transitions. [2022-01-19 05:34:47,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3117 transitions. [2022-01-19 05:34:47,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:34:47,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3117 transitions. [2022-01-19 05:34:47,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 84.24324324324324) internal successors, (3117), 37 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:47,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:47,176 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:47,176 INFO L186 Difference]: Start difference. First operand has 230 places, 255 transitions, 1245 flow. Second operand 37 states and 3117 transitions. [2022-01-19 05:34:47,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 555 transitions, 3917 flow [2022-01-19 05:34:47,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 555 transitions, 3890 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-01-19 05:34:47,202 INFO L242 Difference]: Finished difference. Result has 283 places, 326 transitions, 2220 flow [2022-01-19 05:34:47,202 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=2220, PETRI_PLACES=283, PETRI_TRANSITIONS=326} [2022-01-19 05:34:47,203 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 141 predicate places. [2022-01-19 05:34:47,203 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 326 transitions, 2220 flow [2022-01-19 05:34:47,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:47,203 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:47,204 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:47,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 05:34:47,204 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1366726909, now seen corresponding path program 3 times [2022-01-19 05:34:47,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:47,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801503913] [2022-01-19 05:34:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:47,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:34:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:34:47,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:34:47,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801503913] [2022-01-19 05:34:47,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801503913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:34:47,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:34:47,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:34:47,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991250214] [2022-01-19 05:34:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:34:47,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:34:47,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:34:47,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:34:47,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:34:47,717 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:34:47,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 326 transitions, 2220 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:47,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:34:47,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:34:47,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:34:53,480 INFO L129 PetriNetUnfolder]: 3204/8725 cut-off events. [2022-01-19 05:34:53,480 INFO L130 PetriNetUnfolder]: For 27009/27024 co-relation queries the response was YES. [2022-01-19 05:34:53,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28865 conditions, 8725 events. 3204/8725 cut-off events. For 27009/27024 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 70156 event pairs, 762 based on Foata normal form. 25/8397 useless extension candidates. Maximal degree in co-relation 28802. Up to 3450 conditions per place. [2022-01-19 05:34:53,563 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 484 selfloop transitions, 160 changer transitions 14/729 dead transitions. [2022-01-19 05:34:53,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 729 transitions, 6309 flow [2022-01-19 05:34:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-19 05:34:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-01-19 05:34:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4127 transitions. [2022-01-19 05:34:53,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5330663911134074 [2022-01-19 05:34:53,569 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4127 transitions. [2022-01-19 05:34:53,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4127 transitions. [2022-01-19 05:34:53,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:34:53,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4127 transitions. [2022-01-19 05:34:53,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 84.22448979591837) internal successors, (4127), 49 states have internal predecessors, (4127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:53,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 158.0) internal successors, (7900), 50 states have internal predecessors, (7900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:53,584 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 158.0) internal successors, (7900), 50 states have internal predecessors, (7900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:53,584 INFO L186 Difference]: Start difference. First operand has 283 places, 326 transitions, 2220 flow. Second operand 49 states and 4127 transitions. [2022-01-19 05:34:53,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 729 transitions, 6309 flow [2022-01-19 05:34:53,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 729 transitions, 6043 flow, removed 104 selfloop flow, removed 8 redundant places. [2022-01-19 05:34:53,677 INFO L242 Difference]: Finished difference. Result has 360 places, 445 transitions, 3911 flow [2022-01-19 05:34:53,677 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=3911, PETRI_PLACES=360, PETRI_TRANSITIONS=445} [2022-01-19 05:34:53,679 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 218 predicate places. [2022-01-19 05:34:53,679 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 445 transitions, 3911 flow [2022-01-19 05:34:53,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:53,680 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:53,680 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:53,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 05:34:53,680 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1084924805, now seen corresponding path program 4 times [2022-01-19 05:34:53,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:53,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88223576] [2022-01-19 05:34:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:53,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:34:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:34:54,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:34:54,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88223576] [2022-01-19 05:34:54,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88223576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:34:54,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:34:54,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:34:54,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963647387] [2022-01-19 05:34:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:34:54,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:34:54,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:34:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:34:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:34:54,306 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:34:54,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 445 transitions, 3911 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:54,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:34:54,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:34:54,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:34:59,400 INFO L129 PetriNetUnfolder]: 3867/10439 cut-off events. [2022-01-19 05:34:59,400 INFO L130 PetriNetUnfolder]: For 57389/57405 co-relation queries the response was YES. [2022-01-19 05:34:59,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38945 conditions, 10439 events. 3867/10439 cut-off events. For 57389/57405 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 87607 event pairs, 1339 based on Foata normal form. 22/10027 useless extension candidates. Maximal degree in co-relation 38845. Up to 4209 conditions per place. [2022-01-19 05:34:59,511 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 567 selfloop transitions, 140 changer transitions 3/781 dead transitions. [2022-01-19 05:34:59,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 781 transitions, 8223 flow [2022-01-19 05:34:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 05:34:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 05:34:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3149 transitions. [2022-01-19 05:34:59,515 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5386589120766336 [2022-01-19 05:34:59,515 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3149 transitions. [2022-01-19 05:34:59,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3149 transitions. [2022-01-19 05:34:59,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:34:59,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3149 transitions. [2022-01-19 05:34:59,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 85.10810810810811) internal successors, (3149), 37 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:59,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:59,525 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:59,525 INFO L186 Difference]: Start difference. First operand has 360 places, 445 transitions, 3911 flow. Second operand 37 states and 3149 transitions. [2022-01-19 05:34:59,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 781 transitions, 8223 flow [2022-01-19 05:34:59,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 781 transitions, 7895 flow, removed 148 selfloop flow, removed 7 redundant places. [2022-01-19 05:34:59,799 INFO L242 Difference]: Finished difference. Result has 418 places, 518 transitions, 5075 flow [2022-01-19 05:34:59,799 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=3594, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5075, PETRI_PLACES=418, PETRI_TRANSITIONS=518} [2022-01-19 05:34:59,800 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 276 predicate places. [2022-01-19 05:34:59,800 INFO L470 AbstractCegarLoop]: Abstraction has has 418 places, 518 transitions, 5075 flow [2022-01-19 05:34:59,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:34:59,800 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:34:59,800 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:34:59,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 05:34:59,801 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:34:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:34:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1419731227, now seen corresponding path program 5 times [2022-01-19 05:34:59,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:34:59,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901434595] [2022-01-19 05:34:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:34:59,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:34:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:35:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:35:00,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:35:00,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901434595] [2022-01-19 05:35:00,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901434595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:35:00,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:35:00,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:35:00,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848718415] [2022-01-19 05:35:00,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:35:00,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:35:00,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:35:00,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:35:00,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:35:00,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:35:00,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 518 transitions, 5075 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:00,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:35:00,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:35:00,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:35:07,472 INFO L129 PetriNetUnfolder]: 4098/10904 cut-off events. [2022-01-19 05:35:07,473 INFO L130 PetriNetUnfolder]: For 81686/81704 co-relation queries the response was YES. [2022-01-19 05:35:07,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44392 conditions, 10904 events. 4098/10904 cut-off events. For 81686/81704 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 92694 event pairs, 951 based on Foata normal form. 26/10515 useless extension candidates. Maximal degree in co-relation 44263. Up to 3416 conditions per place. [2022-01-19 05:35:07,614 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 631 selfloop transitions, 299 changer transitions 13/1014 dead transitions. [2022-01-19 05:35:07,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 1014 transitions, 11506 flow [2022-01-19 05:35:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-19 05:35:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-01-19 05:35:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 4255 transitions. [2022-01-19 05:35:07,617 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5280466617026558 [2022-01-19 05:35:07,617 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 4255 transitions. [2022-01-19 05:35:07,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 4255 transitions. [2022-01-19 05:35:07,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:35:07,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 4255 transitions. [2022-01-19 05:35:07,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 83.43137254901961) internal successors, (4255), 51 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:07,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 158.0) internal successors, (8216), 52 states have internal predecessors, (8216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:07,629 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 158.0) internal successors, (8216), 52 states have internal predecessors, (8216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:07,629 INFO L186 Difference]: Start difference. First operand has 418 places, 518 transitions, 5075 flow. Second operand 51 states and 4255 transitions. [2022-01-19 05:35:07,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 1014 transitions, 11506 flow [2022-01-19 05:35:07,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1014 transitions, 10966 flow, removed 260 selfloop flow, removed 6 redundant places. [2022-01-19 05:35:07,951 INFO L242 Difference]: Finished difference. Result has 496 places, 604 transitions, 6902 flow [2022-01-19 05:35:07,952 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=4714, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=6902, PETRI_PLACES=496, PETRI_TRANSITIONS=604} [2022-01-19 05:35:07,952 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 354 predicate places. [2022-01-19 05:35:07,952 INFO L470 AbstractCegarLoop]: Abstraction has has 496 places, 604 transitions, 6902 flow [2022-01-19 05:35:07,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:07,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:35:07,953 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:35:07,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 05:35:07,953 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:35:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:35:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1657952229, now seen corresponding path program 6 times [2022-01-19 05:35:07,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:35:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817084836] [2022-01-19 05:35:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:35:07,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:35:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:35:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:35:08,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:35:08,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817084836] [2022-01-19 05:35:08,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817084836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:35:08,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:35:08,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:35:08,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043273236] [2022-01-19 05:35:08,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:35:08,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:35:08,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:35:08,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:35:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:35:08,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:35:08,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 604 transitions, 6902 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:08,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:35:08,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:35:08,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:35:14,979 INFO L129 PetriNetUnfolder]: 4921/13140 cut-off events. [2022-01-19 05:35:14,980 INFO L130 PetriNetUnfolder]: For 155630/155644 co-relation queries the response was YES. [2022-01-19 05:35:15,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60423 conditions, 13140 events. 4921/13140 cut-off events. For 155630/155644 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 117068 event pairs, 1485 based on Foata normal form. 23/12633 useless extension candidates. Maximal degree in co-relation 60260. Up to 5463 conditions per place. [2022-01-19 05:35:15,206 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 723 selfloop transitions, 193 changer transitions 4/991 dead transitions. [2022-01-19 05:35:15,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 991 transitions, 13410 flow [2022-01-19 05:35:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 05:35:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 05:35:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3165 transitions. [2022-01-19 05:35:15,209 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5413958262059528 [2022-01-19 05:35:15,209 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3165 transitions. [2022-01-19 05:35:15,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3165 transitions. [2022-01-19 05:35:15,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:35:15,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3165 transitions. [2022-01-19 05:35:15,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 85.54054054054055) internal successors, (3165), 37 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:15,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:15,219 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:15,219 INFO L186 Difference]: Start difference. First operand has 496 places, 604 transitions, 6902 flow. Second operand 37 states and 3165 transitions. [2022-01-19 05:35:15,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 991 transitions, 13410 flow [2022-01-19 05:35:15,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 991 transitions, 12423 flow, removed 219 selfloop flow, removed 15 redundant places. [2022-01-19 05:35:15,805 INFO L242 Difference]: Finished difference. Result has 543 places, 691 transitions, 8480 flow [2022-01-19 05:35:15,806 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=6180, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=8480, PETRI_PLACES=543, PETRI_TRANSITIONS=691} [2022-01-19 05:35:15,807 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 401 predicate places. [2022-01-19 05:35:15,807 INFO L470 AbstractCegarLoop]: Abstraction has has 543 places, 691 transitions, 8480 flow [2022-01-19 05:35:15,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:15,808 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:35:15,808 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:35:15,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 05:35:15,808 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:35:15,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:35:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1633184395, now seen corresponding path program 7 times [2022-01-19 05:35:15,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:35:15,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598419302] [2022-01-19 05:35:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:35:15,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:35:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:35:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:35:16,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:35:16,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598419302] [2022-01-19 05:35:16,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598419302] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:35:16,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:35:16,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:35:16,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563010197] [2022-01-19 05:35:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:35:16,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:35:16,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:35:16,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:35:16,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:35:16,404 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:35:16,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 691 transitions, 8480 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:16,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:35:16,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:35:16,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:35:25,484 INFO L129 PetriNetUnfolder]: 5344/13898 cut-off events. [2022-01-19 05:35:25,484 INFO L130 PetriNetUnfolder]: For 219532/219548 co-relation queries the response was YES. [2022-01-19 05:35:25,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70045 conditions, 13898 events. 5344/13898 cut-off events. For 219532/219548 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 123204 event pairs, 1829 based on Foata normal form. 30/13370 useless extension candidates. Maximal degree in co-relation 69856. Up to 5523 conditions per place. [2022-01-19 05:35:25,723 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 748 selfloop transitions, 302 changer transitions 20/1141 dead transitions. [2022-01-19 05:35:25,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 1141 transitions, 16235 flow [2022-01-19 05:35:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 05:35:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 05:35:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4435 transitions. [2022-01-19 05:35:25,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5398003894839338 [2022-01-19 05:35:25,726 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4435 transitions. [2022-01-19 05:35:25,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4435 transitions. [2022-01-19 05:35:25,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:35:25,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4435 transitions. [2022-01-19 05:35:25,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 85.28846153846153) internal successors, (4435), 52 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:25,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 158.0) internal successors, (8374), 53 states have internal predecessors, (8374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:25,738 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 158.0) internal successors, (8374), 53 states have internal predecessors, (8374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:25,738 INFO L186 Difference]: Start difference. First operand has 543 places, 691 transitions, 8480 flow. Second operand 52 states and 4435 transitions. [2022-01-19 05:35:25,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 1141 transitions, 16235 flow [2022-01-19 05:35:26,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 1141 transitions, 15545 flow, removed 290 selfloop flow, removed 9 redundant places. [2022-01-19 05:35:26,616 INFO L242 Difference]: Finished difference. Result has 616 places, 782 transitions, 10516 flow [2022-01-19 05:35:26,617 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=7817, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=10516, PETRI_PLACES=616, PETRI_TRANSITIONS=782} [2022-01-19 05:35:26,617 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 474 predicate places. [2022-01-19 05:35:26,617 INFO L470 AbstractCegarLoop]: Abstraction has has 616 places, 782 transitions, 10516 flow [2022-01-19 05:35:26,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:26,618 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:35:26,618 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:35:26,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 05:35:26,618 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:35:26,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:35:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1827845697, now seen corresponding path program 8 times [2022-01-19 05:35:26,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:35:26,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843021267] [2022-01-19 05:35:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:35:26,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:35:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:35:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:35:27,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:35:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843021267] [2022-01-19 05:35:27,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843021267] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:35:27,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:35:27,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:35:27,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51484494] [2022-01-19 05:35:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:35:27,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:35:27,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:35:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:35:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:35:27,137 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:35:27,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 782 transitions, 10516 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:27,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:35:27,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:35:27,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:35:35,464 INFO L129 PetriNetUnfolder]: 5731/15210 cut-off events. [2022-01-19 05:35:35,464 INFO L130 PetriNetUnfolder]: For 292360/292393 co-relation queries the response was YES. [2022-01-19 05:35:35,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80087 conditions, 15210 events. 5731/15210 cut-off events. For 292360/292393 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 139529 event pairs, 1661 based on Foata normal form. 35/14640 useless extension candidates. Maximal degree in co-relation 79867. Up to 6107 conditions per place. [2022-01-19 05:35:35,776 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 849 selfloop transitions, 307 changer transitions 4/1231 dead transitions. [2022-01-19 05:35:35,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 1231 transitions, 18663 flow [2022-01-19 05:35:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 05:35:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 05:35:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3144 transitions. [2022-01-19 05:35:35,780 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378036264112214 [2022-01-19 05:35:35,780 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3144 transitions. [2022-01-19 05:35:35,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3144 transitions. [2022-01-19 05:35:35,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:35:35,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3144 transitions. [2022-01-19 05:35:35,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 84.97297297297297) internal successors, (3144), 37 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:35,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:35,789 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 158.0) internal successors, (6004), 38 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:35,789 INFO L186 Difference]: Start difference. First operand has 616 places, 782 transitions, 10516 flow. Second operand 37 states and 3144 transitions. [2022-01-19 05:35:35,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 1231 transitions, 18663 flow [2022-01-19 05:35:37,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 1231 transitions, 17692 flow, removed 313 selfloop flow, removed 13 redundant places. [2022-01-19 05:35:37,060 INFO L242 Difference]: Finished difference. Result has 666 places, 859 transitions, 12491 flow [2022-01-19 05:35:37,061 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=9721, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=12491, PETRI_PLACES=666, PETRI_TRANSITIONS=859} [2022-01-19 05:35:37,061 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 524 predicate places. [2022-01-19 05:35:37,061 INFO L470 AbstractCegarLoop]: Abstraction has has 666 places, 859 transitions, 12491 flow [2022-01-19 05:35:37,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:37,062 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:35:37,062 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:35:37,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 05:35:37,062 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:35:37,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:35:37,062 INFO L85 PathProgramCache]: Analyzing trace with hash 109563799, now seen corresponding path program 9 times [2022-01-19 05:35:37,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:35:37,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105220462] [2022-01-19 05:35:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:35:37,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:35:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:35:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:35:37,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:35:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105220462] [2022-01-19 05:35:37,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105220462] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:35:37,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:35:37,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:35:37,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930665618] [2022-01-19 05:35:37,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:35:37,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:35:37,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:35:37,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:35:37,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:35:37,558 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:35:37,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 859 transitions, 12491 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:37,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:35:37,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:35:37,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:35:47,871 INFO L129 PetriNetUnfolder]: 6663/17422 cut-off events. [2022-01-19 05:35:47,871 INFO L130 PetriNetUnfolder]: For 432985/433005 co-relation queries the response was YES. [2022-01-19 05:35:48,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100780 conditions, 17422 events. 6663/17422 cut-off events. For 432985/433005 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 163734 event pairs, 1971 based on Foata normal form. 28/16739 useless extension candidates. Maximal degree in co-relation 100533. Up to 7501 conditions per place. [2022-01-19 05:35:48,314 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 947 selfloop transitions, 256 changer transitions 6/1280 dead transitions. [2022-01-19 05:35:48,314 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 1280 transitions, 21435 flow [2022-01-19 05:35:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 05:35:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 05:35:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3678 transitions. [2022-01-19 05:35:48,317 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5413600235501913 [2022-01-19 05:35:48,317 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3678 transitions. [2022-01-19 05:35:48,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3678 transitions. [2022-01-19 05:35:48,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:35:48,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3678 transitions. [2022-01-19 05:35:48,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 85.53488372093024) internal successors, (3678), 43 states have internal predecessors, (3678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:48,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:48,328 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:48,328 INFO L186 Difference]: Start difference. First operand has 666 places, 859 transitions, 12491 flow. Second operand 43 states and 3678 transitions. [2022-01-19 05:35:48,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 1280 transitions, 21435 flow [2022-01-19 05:35:50,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 1280 transitions, 19461 flow, removed 919 selfloop flow, removed 8 redundant places. [2022-01-19 05:35:50,339 INFO L242 Difference]: Finished difference. Result has 733 places, 962 transitions, 14912 flow [2022-01-19 05:35:50,340 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=11747, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=14912, PETRI_PLACES=733, PETRI_TRANSITIONS=962} [2022-01-19 05:35:50,342 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 591 predicate places. [2022-01-19 05:35:50,342 INFO L470 AbstractCegarLoop]: Abstraction has has 733 places, 962 transitions, 14912 flow [2022-01-19 05:35:50,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:50,342 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:35:50,342 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:35:50,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 05:35:50,343 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:35:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:35:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -680050159, now seen corresponding path program 10 times [2022-01-19 05:35:50,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:35:50,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932640369] [2022-01-19 05:35:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:35:50,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:35:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:35:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:35:50,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:35:50,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932640369] [2022-01-19 05:35:50,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932640369] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:35:50,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:35:50,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:35:50,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009280185] [2022-01-19 05:35:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:35:50,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:35:50,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:35:50,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:35:50,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:35:50,815 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:35:50,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 962 transitions, 14912 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:35:50,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:35:50,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:35:50,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:36:02,821 INFO L129 PetriNetUnfolder]: 7029/18191 cut-off events. [2022-01-19 05:36:02,822 INFO L130 PetriNetUnfolder]: For 446209/446253 co-relation queries the response was YES. [2022-01-19 05:36:03,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107446 conditions, 18191 events. 7029/18191 cut-off events. For 446209/446253 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 172617 event pairs, 1406 based on Foata normal form. 42/17549 useless extension candidates. Maximal degree in co-relation 107166. Up to 5206 conditions per place. [2022-01-19 05:36:03,357 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1000 selfloop transitions, 580 changer transitions 19/1670 dead transitions. [2022-01-19 05:36:03,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1670 transitions, 28105 flow [2022-01-19 05:36:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-19 05:36:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-01-19 05:36:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4572 transitions. [2022-01-19 05:36:03,361 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5358649789029536 [2022-01-19 05:36:03,361 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4572 transitions. [2022-01-19 05:36:03,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4572 transitions. [2022-01-19 05:36:03,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:36:03,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4572 transitions. [2022-01-19 05:36:03,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 84.66666666666667) internal successors, (4572), 54 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:03,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 158.0) internal successors, (8690), 55 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:03,371 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 158.0) internal successors, (8690), 55 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:03,371 INFO L186 Difference]: Start difference. First operand has 733 places, 962 transitions, 14912 flow. Second operand 54 states and 4572 transitions. [2022-01-19 05:36:03,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1670 transitions, 28105 flow [2022-01-19 05:36:05,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 1670 transitions, 26905 flow, removed 549 selfloop flow, removed 8 redundant places. [2022-01-19 05:36:05,725 INFO L242 Difference]: Finished difference. Result has 809 places, 1064 transitions, 18097 flow [2022-01-19 05:36:05,726 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=13897, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=18097, PETRI_PLACES=809, PETRI_TRANSITIONS=1064} [2022-01-19 05:36:05,727 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 667 predicate places. [2022-01-19 05:36:05,727 INFO L470 AbstractCegarLoop]: Abstraction has has 809 places, 1064 transitions, 18097 flow [2022-01-19 05:36:05,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:05,727 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:36:05,727 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:36:05,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 05:36:05,728 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:36:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:36:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1742405489, now seen corresponding path program 11 times [2022-01-19 05:36:05,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:36:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070749351] [2022-01-19 05:36:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:36:05,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:36:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:36:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:36:06,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:36:06,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070749351] [2022-01-19 05:36:06,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070749351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:36:06,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:36:06,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:36:06,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197526064] [2022-01-19 05:36:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:36:06,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:36:06,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:36:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:36:06,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:36:06,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:36:06,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 1064 transitions, 18097 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:06,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:36:06,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:36:06,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:36:19,317 INFO L129 PetriNetUnfolder]: 8010/20991 cut-off events. [2022-01-19 05:36:19,317 INFO L130 PetriNetUnfolder]: For 622280/622314 co-relation queries the response was YES. [2022-01-19 05:36:19,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129937 conditions, 20991 events. 8010/20991 cut-off events. For 622280/622314 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 204553 event pairs, 2572 based on Foata normal form. 33/20197 useless extension candidates. Maximal degree in co-relation 129626. Up to 8759 conditions per place. [2022-01-19 05:36:19,999 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1140 selfloop transitions, 419 changer transitions 4/1634 dead transitions. [2022-01-19 05:36:19,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 1634 transitions, 30399 flow [2022-01-19 05:36:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-19 05:36:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-19 05:36:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3248 transitions. [2022-01-19 05:36:20,002 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5409726848767489 [2022-01-19 05:36:20,002 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3248 transitions. [2022-01-19 05:36:20,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3248 transitions. [2022-01-19 05:36:20,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:36:20,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3248 transitions. [2022-01-19 05:36:20,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.47368421052632) internal successors, (3248), 38 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:20,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 158.0) internal successors, (6162), 39 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:20,008 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 158.0) internal successors, (6162), 39 states have internal predecessors, (6162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:20,008 INFO L186 Difference]: Start difference. First operand has 809 places, 1064 transitions, 18097 flow. Second operand 38 states and 3248 transitions. [2022-01-19 05:36:20,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 1634 transitions, 30399 flow [2022-01-19 05:36:23,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 831 places, 1634 transitions, 28060 flow, removed 663 selfloop flow, removed 15 redundant places. [2022-01-19 05:36:23,450 INFO L242 Difference]: Finished difference. Result has 854 places, 1206 transitions, 21541 flow [2022-01-19 05:36:23,451 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=16660, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=282, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=21541, PETRI_PLACES=854, PETRI_TRANSITIONS=1206} [2022-01-19 05:36:23,451 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 712 predicate places. [2022-01-19 05:36:23,451 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 1206 transitions, 21541 flow [2022-01-19 05:36:23,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:23,452 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:36:23,452 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:36:23,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 05:36:23,452 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:36:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:36:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -410028145, now seen corresponding path program 12 times [2022-01-19 05:36:23,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:36:23,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154068198] [2022-01-19 05:36:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:36:23,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:36:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:36:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:36:23,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:36:23,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154068198] [2022-01-19 05:36:23,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154068198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:36:23,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:36:23,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:36:23,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389054771] [2022-01-19 05:36:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:36:23,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:36:23,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:36:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:36:23,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:36:23,937 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:36:23,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 1206 transitions, 21541 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:23,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:36:23,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:36:23,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:36:39,765 INFO L129 PetriNetUnfolder]: 9263/24071 cut-off events. [2022-01-19 05:36:39,765 INFO L130 PetriNetUnfolder]: For 858735/858808 co-relation queries the response was YES. [2022-01-19 05:36:40,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159313 conditions, 24071 events. 9263/24071 cut-off events. For 858735/858808 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 238553 event pairs, 2939 based on Foata normal form. 57/23195 useless extension candidates. Maximal degree in co-relation 158982. Up to 10180 conditions per place. [2022-01-19 05:36:40,887 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1246 selfloop transitions, 426 changer transitions 15/1758 dead transitions. [2022-01-19 05:36:40,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 1758 transitions, 36274 flow [2022-01-19 05:36:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 05:36:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 05:36:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3993 transitions. [2022-01-19 05:36:40,890 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5377053595475357 [2022-01-19 05:36:40,890 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3993 transitions. [2022-01-19 05:36:40,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3993 transitions. [2022-01-19 05:36:40,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:36:40,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3993 transitions. [2022-01-19 05:36:40,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 84.95744680851064) internal successors, (3993), 47 states have internal predecessors, (3993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:40,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 158.0) internal successors, (7584), 48 states have internal predecessors, (7584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:40,900 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 158.0) internal successors, (7584), 48 states have internal predecessors, (7584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:40,900 INFO L186 Difference]: Start difference. First operand has 854 places, 1206 transitions, 21541 flow. Second operand 47 states and 3993 transitions. [2022-01-19 05:36:40,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 1758 transitions, 36274 flow [2022-01-19 05:36:46,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 1758 transitions, 33946 flow, removed 972 selfloop flow, removed 13 redundant places. [2022-01-19 05:36:46,067 INFO L242 Difference]: Finished difference. Result has 920 places, 1404 transitions, 27750 flow [2022-01-19 05:36:46,068 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=20540, PETRI_DIFFERENCE_MINUEND_PLACES=841, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=876, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=27750, PETRI_PLACES=920, PETRI_TRANSITIONS=1404} [2022-01-19 05:36:46,069 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 778 predicate places. [2022-01-19 05:36:46,069 INFO L470 AbstractCegarLoop]: Abstraction has has 920 places, 1404 transitions, 27750 flow [2022-01-19 05:36:46,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:46,069 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:36:46,069 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:36:46,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 05:36:46,069 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:36:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:36:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash -982693187, now seen corresponding path program 13 times [2022-01-19 05:36:46,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:36:46,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637848467] [2022-01-19 05:36:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:36:46,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:36:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:36:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:36:46,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:36:46,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637848467] [2022-01-19 05:36:46,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637848467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:36:46,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:36:46,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:36:46,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546292984] [2022-01-19 05:36:46,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:36:46,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:36:46,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:36:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:36:46,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:36:46,568 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:36:46,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 1404 transitions, 27750 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:36:46,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:36:46,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:36:46,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:37:04,833 INFO L129 PetriNetUnfolder]: 10305/26728 cut-off events. [2022-01-19 05:37:04,834 INFO L130 PetriNetUnfolder]: For 977480/977564 co-relation queries the response was YES. [2022-01-19 05:37:05,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181324 conditions, 26728 events. 10305/26728 cut-off events. For 977480/977564 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 269422 event pairs, 2725 based on Foata normal form. 56/25740 useless extension candidates. Maximal degree in co-relation 180960. Up to 10101 conditions per place. [2022-01-19 05:37:06,026 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1305 selfloop transitions, 590 changer transitions 4/1970 dead transitions. [2022-01-19 05:37:06,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1970 transitions, 41859 flow [2022-01-19 05:37:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 05:37:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 05:37:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3654 transitions. [2022-01-19 05:37:06,029 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378274948483956 [2022-01-19 05:37:06,029 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3654 transitions. [2022-01-19 05:37:06,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3654 transitions. [2022-01-19 05:37:06,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:37:06,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3654 transitions. [2022-01-19 05:37:06,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 84.97674418604652) internal successors, (3654), 43 states have internal predecessors, (3654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:06,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:06,036 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:06,036 INFO L186 Difference]: Start difference. First operand has 920 places, 1404 transitions, 27750 flow. Second operand 43 states and 3654 transitions. [2022-01-19 05:37:06,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 1970 transitions, 41859 flow [2022-01-19 05:37:12,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 1970 transitions, 40723 flow, removed 478 selfloop flow, removed 9 redundant places. [2022-01-19 05:37:12,782 INFO L242 Difference]: Finished difference. Result has 983 places, 1561 transitions, 33598 flow [2022-01-19 05:37:12,783 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=26620, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=453, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=33598, PETRI_PLACES=983, PETRI_TRANSITIONS=1561} [2022-01-19 05:37:12,783 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 841 predicate places. [2022-01-19 05:37:12,783 INFO L470 AbstractCegarLoop]: Abstraction has has 983 places, 1561 transitions, 33598 flow [2022-01-19 05:37:12,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:12,784 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:37:12,784 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:37:12,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 05:37:12,784 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:37:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:37:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -737988387, now seen corresponding path program 14 times [2022-01-19 05:37:12,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:37:12,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718800163] [2022-01-19 05:37:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:37:12,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:37:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:37:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:37:13,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:37:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718800163] [2022-01-19 05:37:13,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718800163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:37:13,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:37:13,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-19 05:37:13,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365539785] [2022-01-19 05:37:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:37:13,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 05:37:13,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:37:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 05:37:13,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2022-01-19 05:37:13,217 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 158 [2022-01-19 05:37:13,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1561 transitions, 33598 flow. Second operand has 25 states, 25 states have (on average 81.08) internal successors, (2027), 25 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:13,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:37:13,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 158 [2022-01-19 05:37:13,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:37:32,367 INFO L129 PetriNetUnfolder]: 8905/25562 cut-off events. [2022-01-19 05:37:32,368 INFO L130 PetriNetUnfolder]: For 1156805/1157515 co-relation queries the response was YES. [2022-01-19 05:37:34,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183235 conditions, 25562 events. 8905/25562 cut-off events. For 1156805/1157515 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 273876 event pairs, 2445 based on Foata normal form. 273/24895 useless extension candidates. Maximal degree in co-relation 182841. Up to 8658 conditions per place. [2022-01-19 05:37:34,811 INFO L132 encePairwiseOnDemand]: 129/158 looper letters, 1159 selfloop transitions, 708 changer transitions 14/2010 dead transitions. [2022-01-19 05:37:34,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 2010 transitions, 46940 flow [2022-01-19 05:37:34,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 05:37:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 05:37:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3190 transitions. [2022-01-19 05:37:34,814 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5608298171589311 [2022-01-19 05:37:34,814 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3190 transitions. [2022-01-19 05:37:34,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3190 transitions. [2022-01-19 05:37:34,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:37:34,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3190 transitions. [2022-01-19 05:37:34,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 88.61111111111111) internal successors, (3190), 36 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:34,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 158.0) internal successors, (5846), 37 states have internal predecessors, (5846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:34,820 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 158.0) internal successors, (5846), 37 states have internal predecessors, (5846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:34,820 INFO L186 Difference]: Start difference. First operand has 983 places, 1561 transitions, 33598 flow. Second operand 36 states and 3190 transitions. [2022-01-19 05:37:34,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 2010 transitions, 46940 flow [2022-01-19 05:37:42,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 2010 transitions, 45409 flow, removed 649 selfloop flow, removed 10 redundant places. [2022-01-19 05:37:42,698 INFO L242 Difference]: Finished difference. Result has 1032 places, 1764 transitions, 40613 flow [2022-01-19 05:37:42,700 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=32262, PETRI_DIFFERENCE_MINUEND_PLACES=973, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=40613, PETRI_PLACES=1032, PETRI_TRANSITIONS=1764} [2022-01-19 05:37:42,700 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 890 predicate places. [2022-01-19 05:37:42,700 INFO L470 AbstractCegarLoop]: Abstraction has has 1032 places, 1764 transitions, 40613 flow [2022-01-19 05:37:42,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 81.08) internal successors, (2027), 25 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:42,700 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:37:42,700 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:37:42,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 05:37:42,701 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:37:42,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:37:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 929706661, now seen corresponding path program 15 times [2022-01-19 05:37:42,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:37:42,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719705872] [2022-01-19 05:37:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:37:42,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:37:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:37:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:37:43,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:37:43,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719705872] [2022-01-19 05:37:43,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719705872] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:37:43,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:37:43,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:37:43,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807252580] [2022-01-19 05:37:43,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:37:43,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:37:43,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:37:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:37:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:37:43,182 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:37:43,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1764 transitions, 40613 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:37:43,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:37:43,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:37:43,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:38:08,433 INFO L129 PetriNetUnfolder]: 12061/30819 cut-off events. [2022-01-19 05:38:08,433 INFO L130 PetriNetUnfolder]: For 1574618/1574772 co-relation queries the response was YES. [2022-01-19 05:38:10,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237654 conditions, 30819 events. 12061/30819 cut-off events. For 1574618/1574772 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 317254 event pairs, 4082 based on Foata normal form. 124/29705 useless extension candidates. Maximal degree in co-relation 237236. Up to 14383 conditions per place. [2022-01-19 05:38:10,359 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1666 selfloop transitions, 419 changer transitions 6/2162 dead transitions. [2022-01-19 05:38:10,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1074 places, 2162 transitions, 51490 flow [2022-01-19 05:38:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 05:38:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 05:38:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3682 transitions. [2022-01-19 05:38:10,362 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5419487783338239 [2022-01-19 05:38:10,362 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3682 transitions. [2022-01-19 05:38:10,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3682 transitions. [2022-01-19 05:38:10,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:38:10,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3682 transitions. [2022-01-19 05:38:10,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 85.62790697674419) internal successors, (3682), 43 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:38:10,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:38:10,368 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:38:10,368 INFO L186 Difference]: Start difference. First operand has 1032 places, 1764 transitions, 40613 flow. Second operand 43 states and 3682 transitions. [2022-01-19 05:38:10,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1074 places, 2162 transitions, 51490 flow [2022-01-19 05:38:21,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1063 places, 2162 transitions, 50210 flow, removed 539 selfloop flow, removed 11 redundant places. [2022-01-19 05:38:21,415 INFO L242 Difference]: Finished difference. Result has 1097 places, 1860 transitions, 43624 flow [2022-01-19 05:38:21,416 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=39357, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=43624, PETRI_PLACES=1097, PETRI_TRANSITIONS=1860} [2022-01-19 05:38:21,417 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 955 predicate places. [2022-01-19 05:38:21,417 INFO L470 AbstractCegarLoop]: Abstraction has has 1097 places, 1860 transitions, 43624 flow [2022-01-19 05:38:21,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:38:21,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:38:21,417 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:38:21,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 05:38:21,417 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:38:21,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:38:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1429447959, now seen corresponding path program 16 times [2022-01-19 05:38:21,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:38:21,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178155093] [2022-01-19 05:38:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:38:21,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:38:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:38:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:38:21,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:38:21,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178155093] [2022-01-19 05:38:21,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178155093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:38:21,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:38:21,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:38:21,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471177128] [2022-01-19 05:38:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:38:21,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:38:21,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:38:21,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:38:21,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:38:21,890 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:38:21,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1097 places, 1860 transitions, 43624 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:38:21,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:38:21,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:38:21,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:38:58,092 INFO L129 PetriNetUnfolder]: 15552/39520 cut-off events. [2022-01-19 05:38:58,092 INFO L130 PetriNetUnfolder]: For 2348333/2348526 co-relation queries the response was YES. [2022-01-19 05:39:01,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331612 conditions, 39520 events. 15552/39520 cut-off events. For 2348333/2348526 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 417037 event pairs, 4680 based on Foata normal form. 155/38105 useless extension candidates. Maximal degree in co-relation 331160. Up to 15461 conditions per place. [2022-01-19 05:39:02,016 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1875 selfloop transitions, 941 changer transitions 6/2893 dead transitions. [2022-01-19 05:39:02,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1141 places, 2893 transitions, 78638 flow [2022-01-19 05:39:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-19 05:39:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-19 05:39:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3824 transitions. [2022-01-19 05:39:02,019 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378340365682138 [2022-01-19 05:39:02,019 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3824 transitions. [2022-01-19 05:39:02,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3824 transitions. [2022-01-19 05:39:02,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:39:02,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3824 transitions. [2022-01-19 05:39:02,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 84.97777777777777) internal successors, (3824), 45 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:39:02,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 158.0) internal successors, (7268), 46 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:39:02,026 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 158.0) internal successors, (7268), 46 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:39:02,026 INFO L186 Difference]: Start difference. First operand has 1097 places, 1860 transitions, 43624 flow. Second operand 45 states and 3824 transitions. [2022-01-19 05:39:02,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1141 places, 2893 transitions, 78638 flow [2022-01-19 05:39:22,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1134 places, 2893 transitions, 77029 flow, removed 774 selfloop flow, removed 7 redundant places. [2022-01-19 05:39:22,140 INFO L242 Difference]: Finished difference. Result has 1167 places, 2418 transitions, 67225 flow [2022-01-19 05:39:22,142 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=42015, PETRI_DIFFERENCE_MINUEND_PLACES=1090, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=414, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=67225, PETRI_PLACES=1167, PETRI_TRANSITIONS=2418} [2022-01-19 05:39:22,142 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1025 predicate places. [2022-01-19 05:39:22,142 INFO L470 AbstractCegarLoop]: Abstraction has has 1167 places, 2418 transitions, 67225 flow [2022-01-19 05:39:22,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:39:22,143 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:39:22,143 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:39:22,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 05:39:22,143 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:39:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:39:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash -622515957, now seen corresponding path program 17 times [2022-01-19 05:39:22,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:39:22,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184097023] [2022-01-19 05:39:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:39:22,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:39:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:39:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:39:22,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:39:22,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184097023] [2022-01-19 05:39:22,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184097023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:39:22,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:39:22,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:39:22,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692699325] [2022-01-19 05:39:22,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:39:22,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:39:22,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:39:22,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:39:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:39:22,586 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:39:22,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1167 places, 2418 transitions, 67225 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:39:22,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:39:22,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:39:22,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:40:19,760 INFO L129 PetriNetUnfolder]: 21875/54810 cut-off events. [2022-01-19 05:40:19,760 INFO L130 PetriNetUnfolder]: For 3853740/3854002 co-relation queries the response was YES. [2022-01-19 05:40:26,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 509659 conditions, 54810 events. 21875/54810 cut-off events. For 3853740/3854002 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 593290 event pairs, 5727 based on Foata normal form. 196/52835 useless extension candidates. Maximal degree in co-relation 509174. Up to 19812 conditions per place. [2022-01-19 05:40:26,999 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 2325 selfloop transitions, 1522 changer transitions 5/3923 dead transitions. [2022-01-19 05:40:26,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1209 places, 3923 transitions, 126616 flow [2022-01-19 05:40:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 05:40:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 05:40:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3675 transitions. [2022-01-19 05:40:27,002 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5409184574624669 [2022-01-19 05:40:27,002 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3675 transitions. [2022-01-19 05:40:27,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3675 transitions. [2022-01-19 05:40:27,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:40:27,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3675 transitions. [2022-01-19 05:40:27,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 85.46511627906976) internal successors, (3675), 43 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:40:27,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:40:27,008 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 158.0) internal successors, (6952), 44 states have internal predecessors, (6952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:40:27,008 INFO L186 Difference]: Start difference. First operand has 1167 places, 2418 transitions, 67225 flow. Second operand 43 states and 3675 transitions. [2022-01-19 05:40:27,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1209 places, 3923 transitions, 126616 flow [2022-01-19 05:41:21,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1199 places, 3923 transitions, 122314 flow, removed 2023 selfloop flow, removed 10 redundant places. [2022-01-19 05:41:21,695 INFO L242 Difference]: Finished difference. Result has 1230 places, 3377 transitions, 111124 flow [2022-01-19 05:41:21,698 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=65184, PETRI_DIFFERENCE_MINUEND_PLACES=1157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=580, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=111124, PETRI_PLACES=1230, PETRI_TRANSITIONS=3377} [2022-01-19 05:41:21,698 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1088 predicate places. [2022-01-19 05:41:21,698 INFO L470 AbstractCegarLoop]: Abstraction has has 1230 places, 3377 transitions, 111124 flow [2022-01-19 05:41:21,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:41:21,699 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:41:21,699 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:41:21,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 05:41:21,699 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:41:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:41:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1600645409, now seen corresponding path program 18 times [2022-01-19 05:41:21,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:41:21,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772549464] [2022-01-19 05:41:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:41:21,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:41:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:41:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:41:22,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:41:22,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772549464] [2022-01-19 05:41:22,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772549464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:41:22,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:41:22,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:41:22,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048400537] [2022-01-19 05:41:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:41:22,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:41:22,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:41:22,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:41:22,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:41:22,169 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:41:22,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1230 places, 3377 transitions, 111124 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:41:22,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:41:22,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:41:22,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 05:42:41,246 INFO L129 PetriNetUnfolder]: 22619/56361 cut-off events. [2022-01-19 05:42:41,246 INFO L130 PetriNetUnfolder]: For 4381825/4382118 co-relation queries the response was YES. [2022-01-19 05:42:48,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 547580 conditions, 56361 events. 22619/56361 cut-off events. For 4381825/4382118 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 610529 event pairs, 4672 based on Foata normal form. 271/54483 useless extension candidates. Maximal degree in co-relation 547064. Up to 13878 conditions per place. [2022-01-19 05:42:48,760 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1716 selfloop transitions, 2177 changer transitions 17/3981 dead transitions. [2022-01-19 05:42:48,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1282 places, 3981 transitions, 134526 flow [2022-01-19 05:42:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-19 05:42:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-01-19 05:42:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 4495 transitions. [2022-01-19 05:42:48,763 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5367805111058037 [2022-01-19 05:42:48,763 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 4495 transitions. [2022-01-19 05:42:48,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 4495 transitions. [2022-01-19 05:42:48,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 05:42:48,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 4495 transitions. [2022-01-19 05:42:48,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 84.81132075471699) internal successors, (4495), 53 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:42:48,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 158.0) internal successors, (8532), 54 states have internal predecessors, (8532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:42:48,860 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 158.0) internal successors, (8532), 54 states have internal predecessors, (8532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:42:48,861 INFO L186 Difference]: Start difference. First operand has 1230 places, 3377 transitions, 111124 flow. Second operand 53 states and 4495 transitions. [2022-01-19 05:42:48,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1282 places, 3981 transitions, 134526 flow [2022-01-19 05:43:55,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1272 places, 3981 transitions, 132192 flow, removed 1058 selfloop flow, removed 10 redundant places. [2022-01-19 05:43:55,682 INFO L242 Difference]: Finished difference. Result has 1300 places, 3542 transitions, 122447 flow [2022-01-19 05:43:55,685 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=109199, PETRI_DIFFERENCE_MINUEND_PLACES=1220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2014, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=122447, PETRI_PLACES=1300, PETRI_TRANSITIONS=3542} [2022-01-19 05:43:55,685 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1158 predicate places. [2022-01-19 05:43:55,685 INFO L470 AbstractCegarLoop]: Abstraction has has 1300 places, 3542 transitions, 122447 flow [2022-01-19 05:43:55,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:43:55,685 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 05:43:55,685 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 05:43:55,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 05:43:55,686 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-01-19 05:43:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 05:43:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1149428207, now seen corresponding path program 19 times [2022-01-19 05:43:55,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 05:43:55,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215322125] [2022-01-19 05:43:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 05:43:55,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 05:43:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 05:43:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 05:43:56,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 05:43:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215322125] [2022-01-19 05:43:56,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215322125] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 05:43:56,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 05:43:56,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-19 05:43:56,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551310115] [2022-01-19 05:43:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 05:43:56,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 05:43:56,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 05:43:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 05:43:56,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-19 05:43:56,176 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-19 05:43:56,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1300 places, 3542 transitions, 122447 flow. Second operand has 27 states, 27 states have (on average 77.0) internal successors, (2079), 27 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 05:43:56,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 05:43:56,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-19 05:43:56,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand