/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.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-18 23:19:42,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 23:19:42,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 23:19:42,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 23:19:42,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 23:19:42,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 23:19:42,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 23:19:42,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 23:19:42,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 23:19:42,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 23:19:42,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 23:19:42,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 23:19:42,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 23:19:42,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 23:19:42,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 23:19:42,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 23:19:42,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 23:19:42,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 23:19:42,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 23:19:42,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 23:19:42,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 23:19:42,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 23:19:42,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 23:19:42,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 23:19:42,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 23:19:42,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 23:19:42,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 23:19:42,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 23:19:42,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 23:19:42,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 23:19:42,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 23:19:42,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 23:19:42,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 23:19:42,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 23:19:42,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 23:19:42,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 23:19:42,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 23:19:42,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 23:19:42,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 23:19:42,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 23:19:42,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 23:19:42,947 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.epf [2022-01-18 23:19:42,960 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 23:19:42,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 23:19:42,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 23:19:42,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 23:19:42,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 23:19:42,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 23:19:42,961 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 23:19:42,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 23:19:42,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 23:19:42,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 23:19:42,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 23:19:42,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 23:19:42,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 23:19:42,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 23:19:42,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 23:19:42,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 23:19:42,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 23:19:42,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 23:19:42,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 23:19:42,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 23:19:42,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 23:19:42,964 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 23:19:42,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 23:19:42,964 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-18 23:19:43,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 23:19:43,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 23:19:43,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 23:19:43,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 23:19:43,146 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 23:19:43,147 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-18 23:19:43,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1060a7a1/a2ac9ce52a89473381b64374da27a1ba/FLAG090d9768f [2022-01-18 23:19:43,665 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 23:19:43,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2022-01-18 23:19:43,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1060a7a1/a2ac9ce52a89473381b64374da27a1ba/FLAG090d9768f [2022-01-18 23:19:43,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1060a7a1/a2ac9ce52a89473381b64374da27a1ba [2022-01-18 23:19:43,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 23:19:43,695 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 23:19:43,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 23:19:43,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 23:19:43,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 23:19:43,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:19:43" (1/1) ... [2022-01-18 23:19:43,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fc7b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:43, skipping insertion in model container [2022-01-18 23:19:43,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 11:19:43" (1/1) ... [2022-01-18 23:19:43,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 23:19:43,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 23:19:43,877 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 23:19:44,034 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-18 23:19:44,037 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-18 23:19:44,038 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-18 23:19:44,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 23:19:44,050 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 23:19:44,061 WARN L610 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-01-18 23:19:44,082 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-18 23:19:44,082 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-18 23:19:44,083 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-18 23:19:44,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 23:19:44,128 INFO L208 MainTranslator]: Completed translation [2022-01-18 23:19:44,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44 WrapperNode [2022-01-18 23:19:44,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 23:19:44,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 23:19:44,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 23:19:44,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 23:19:44,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,165 INFO L137 Inliner]: procedures = 224, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2022-01-18 23:19:44,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 23:19:44,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 23:19:44,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 23:19:44,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 23:19:44,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 23:19:44,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 23:19:44,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 23:19:44,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 23:19:44,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (1/1) ... [2022-01-18 23:19:44,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 23:19:44,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 23:19:44,207 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-18 23:19:44,208 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-18 23:19:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2022-01-18 23:19:44,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2022-01-18 23:19:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 23:19:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 23:19:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 23:19:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 23:19:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 23:19:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 23:19:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 23:19:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 23:19:44,234 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 23:19:44,302 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 23:19:44,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 23:19:44,480 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 23:19:44,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 23:19:44,486 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-18 23:19:44,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:19:44 BoogieIcfgContainer [2022-01-18 23:19:44,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 23:19:44,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 23:19:44,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 23:19:44,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 23:19:44,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 11:19:43" (1/3) ... [2022-01-18 23:19:44,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bd883c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:19:44, skipping insertion in model container [2022-01-18 23:19:44,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 11:19:44" (2/3) ... [2022-01-18 23:19:44,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bd883c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 11:19:44, skipping insertion in model container [2022-01-18 23:19:44,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 11:19:44" (3/3) ... [2022-01-18 23:19:44,492 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2022-01-18 23:19:44,495 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 23:19:44,495 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-18 23:19:44,495 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 23:19:44,523 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,524 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,524 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,524 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,524 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,524 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,524 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,524 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,525 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,526 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,526 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,526 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,526 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,526 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,526 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,527 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,527 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,527 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,527 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,527 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,527 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,528 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,528 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,528 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,528 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-18 23:19:44,528 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-18 23:19:44,528 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,528 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,528 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-18 23:19:44,529 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-18 23:19:44,529 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,529 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,529 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-18 23:19:44,529 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-18 23:19:44,529 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,529 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,529 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-18 23:19:44,529 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-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,530 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,531 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,532 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,532 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-18 23:19:44,532 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-18 23:19:44,532 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,532 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,532 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-18 23:19:44,532 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-18 23:19:44,532 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,532 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,533 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-18 23:19:44,533 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-18 23:19:44,533 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,533 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,533 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-18 23:19:44,533 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-18 23:19:44,533 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,533 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,534 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,535 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,535 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,535 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,535 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,535 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,535 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,536 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,537 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,537 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,537 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,537 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,537 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,537 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,537 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,538 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,539 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,540 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,541 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,542 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,543 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,543 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,543 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,543 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,543 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,543 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,543 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-18 23:19:44,543 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-18 23:19:44,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,544 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-18 23:19:44,544 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-18 23:19:44,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,544 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,545 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,546 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-18 23:19:44,546 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-18 23:19:44,546 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,546 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,546 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-18 23:19:44,546 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-18 23:19:44,546 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,546 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,546 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,547 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,548 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,549 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,550 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,551 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,552 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,553 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,554 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,555 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,556 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,558 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~val~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,559 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~last~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~r~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 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-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,560 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-18 23:19:44,560 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 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-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 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-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,561 WARN L322 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 23:19:44,564 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-18 23:19:44,591 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 23:19:44,595 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-18 23:19:44,595 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-18 23:19:44,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 158 transitions, 324 flow [2022-01-18 23:19:44,648 INFO L129 PetriNetUnfolder]: 10/157 cut-off events. [2022-01-18 23:19:44,648 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-18 23:19:44,653 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-18 23:19:44,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 158 transitions, 324 flow [2022-01-18 23:19:44,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 148 transitions, 299 flow [2022-01-18 23:19:44,668 INFO L129 PetriNetUnfolder]: 2/51 cut-off events. [2022-01-18 23:19:44,669 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 23:19:44,669 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:19:44,669 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-18 23:19:44,670 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-18 23:19:44,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:19:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash 847621616, now seen corresponding path program 1 times [2022-01-18 23:19:44,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:19:44,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092936161] [2022-01-18 23:19:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:19:44,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:19:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:19:44,881 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-18 23:19:44,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:19:44,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092936161] [2022-01-18 23:19:44,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092936161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:19:44,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:19:44,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 23:19:44,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220191302] [2022-01-18 23:19:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:19:44,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 23:19:44,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:19:44,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 23:19:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 23:19:44,916 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 158 [2022-01-18 23:19:44,920 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-18 23:19:44,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:19:44,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 158 [2022-01-18 23:19:44,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:19:44,967 INFO L129 PetriNetUnfolder]: 4/142 cut-off events. [2022-01-18 23:19:44,968 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-18 23:19:44,970 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-18 23:19:44,971 INFO L132 encePairwiseOnDemand]: 152/158 looper letters, 1 selfloop transitions, 0 changer transitions 0/142 dead transitions. [2022-01-18 23:19:44,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 289 flow [2022-01-18 23:19:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 23:19:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-18 23:19:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-01-18 23:19:44,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9715189873417721 [2022-01-18 23:19:44,986 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-01-18 23:19:44,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-01-18 23:19:44,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:19:44,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-01-18 23:19:44,994 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-18 23:19:44,998 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-18 23:19:44,999 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-18 23:19:45,000 INFO L186 Difference]: Start difference. First operand has 142 places, 148 transitions, 299 flow. Second operand 2 states and 307 transitions. [2022-01-18 23:19:45,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 289 flow [2022-01-18 23:19:45,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 142 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 23:19:45,010 INFO L242 Difference]: Finished difference. Result has 142 places, 142 transitions, 286 flow [2022-01-18 23:19:45,012 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-18 23:19:45,014 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 0 predicate places. [2022-01-18 23:19:45,015 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 142 transitions, 286 flow [2022-01-18 23:19:45,017 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-18 23:19:45,021 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:19:45,021 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-18 23:19:45,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 23:19:45,022 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-18 23:19:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:19:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 506434889, now seen corresponding path program 1 times [2022-01-18 23:19:45,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:19:45,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41398501] [2022-01-18 23:19:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:19:45,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:19:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:19:45,098 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-18 23:19:45,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:19:45,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41398501] [2022-01-18 23:19:45,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41398501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:19:45,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:19:45,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-18 23:19:45,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873808732] [2022-01-18 23:19:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:19:45,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 23:19:45,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:19:45,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 23:19:45,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 23:19:45,103 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 158 [2022-01-18 23:19:45,104 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-18 23:19:45,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:19:45,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 158 [2022-01-18 23:19:45,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:19:45,160 INFO L129 PetriNetUnfolder]: 5/185 cut-off events. [2022-01-18 23:19:45,161 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 23:19:45,163 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-18 23:19:45,164 INFO L132 encePairwiseOnDemand]: 155/158 looper letters, 7 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2022-01-18 23:19:45,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 145 transitions, 310 flow [2022-01-18 23:19:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 23:19:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 23:19:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-01-18 23:19:45,167 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9388185654008439 [2022-01-18 23:19:45,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2022-01-18 23:19:45,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2022-01-18 23:19:45,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:19:45,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2022-01-18 23:19:45,168 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-18 23:19:45,170 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-18 23:19:45,170 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-18 23:19:45,170 INFO L186 Difference]: Start difference. First operand has 142 places, 142 transitions, 286 flow. Second operand 3 states and 445 transitions. [2022-01-18 23:19:45,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 145 transitions, 310 flow [2022-01-18 23:19:45,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 145 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-18 23:19:45,173 INFO L242 Difference]: Finished difference. Result has 145 places, 143 transitions, 298 flow [2022-01-18 23:19:45,173 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-18 23:19:45,173 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2022-01-18 23:19:45,173 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 298 flow [2022-01-18 23:19:45,174 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-18 23:19:45,174 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:19:45,174 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-18 23:19:45,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 23:19:45,175 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-18 23:19:45,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:19:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash -654644372, now seen corresponding path program 1 times [2022-01-18 23:19:45,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:19:45,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612811716] [2022-01-18 23:19:45,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:19:45,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:19:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:19:45,505 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-18 23:19:45,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:19:45,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612811716] [2022-01-18 23:19:45,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612811716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:19:45,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:19:45,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-18 23:19:45,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044063161] [2022-01-18 23:19:45,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:19:45,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-18 23:19:45,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:19:45,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-18 23:19:45,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-01-18 23:19:45,511 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 158 [2022-01-18 23:19:45,513 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-18 23:19:45,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:19:45,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 158 [2022-01-18 23:19:45,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:19:47,276 INFO L129 PetriNetUnfolder]: 583/2004 cut-off events. [2022-01-18 23:19:47,276 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-18 23:19:47,279 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-18 23:19:47,286 INFO L132 encePairwiseOnDemand]: 137/158 looper letters, 129 selfloop transitions, 34 changer transitions 10/255 dead transitions. [2022-01-18 23:19:47,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 255 transitions, 868 flow [2022-01-18 23:19:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 23:19:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-18 23:19:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2067 transitions. [2022-01-18 23:19:47,290 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5946490218642118 [2022-01-18 23:19:47,290 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2067 transitions. [2022-01-18 23:19:47,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2067 transitions. [2022-01-18 23:19:47,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:19:47,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2067 transitions. [2022-01-18 23:19:47,294 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-18 23:19:47,300 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-18 23:19:47,301 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-18 23:19:47,301 INFO L186 Difference]: Start difference. First operand has 145 places, 143 transitions, 298 flow. Second operand 22 states and 2067 transitions. [2022-01-18 23:19:47,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 255 transitions, 868 flow [2022-01-18 23:19:47,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 255 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-18 23:19:47,308 INFO L242 Difference]: Finished difference. Result has 175 places, 174 transitions, 503 flow [2022-01-18 23:19:47,309 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-18 23:19:47,310 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 33 predicate places. [2022-01-18 23:19:47,310 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 174 transitions, 503 flow [2022-01-18 23:19:47,312 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-18 23:19:47,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:19:47,312 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-18 23:19:47,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 23:19:47,313 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-18 23:19:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:19:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2143908831, now seen corresponding path program 1 times [2022-01-18 23:19:47,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:19:47,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654296168] [2022-01-18 23:19:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:19:47,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:19:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:19:47,958 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-18 23:19:47,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:19:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654296168] [2022-01-18 23:19:47,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654296168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:19:47,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:19:47,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:19:47,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053769111] [2022-01-18 23:19:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:19:47,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:19:47,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:19:47,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:19:47,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:19:47,962 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:19:47,963 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-18 23:19:47,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:19:47,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:19:47,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:19:51,950 INFO L129 PetriNetUnfolder]: 1897/5425 cut-off events. [2022-01-18 23:19:51,951 INFO L130 PetriNetUnfolder]: For 1621/1626 co-relation queries the response was YES. [2022-01-18 23:19:51,960 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-18 23:19:51,973 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 337 selfloop transitions, 91 changer transitions 3/502 dead transitions. [2022-01-18 23:19:51,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 502 transitions, 2593 flow [2022-01-18 23:19:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 23:19:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-18 23:19:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3138 transitions. [2022-01-18 23:19:51,979 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5367772836127267 [2022-01-18 23:19:51,979 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3138 transitions. [2022-01-18 23:19:51,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3138 transitions. [2022-01-18 23:19:51,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:19:51,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3138 transitions. [2022-01-18 23:19:51,984 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-18 23:19:51,991 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-18 23:19:51,992 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-18 23:19:51,992 INFO L186 Difference]: Start difference. First operand has 175 places, 174 transitions, 503 flow. Second operand 37 states and 3138 transitions. [2022-01-18 23:19:51,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 502 transitions, 2593 flow [2022-01-18 23:19:52,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 502 transitions, 2582 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-18 23:19:52,009 INFO L242 Difference]: Finished difference. Result has 230 places, 255 transitions, 1245 flow [2022-01-18 23:19:52,009 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-18 23:19:52,010 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 88 predicate places. [2022-01-18 23:19:52,011 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 255 transitions, 1245 flow [2022-01-18 23:19:52,011 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-18 23:19:52,011 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:19:52,012 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-18 23:19:52,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 23:19:52,012 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-18 23:19:52,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:19:52,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1028678017, now seen corresponding path program 2 times [2022-01-18 23:19:52,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:19:52,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176344392] [2022-01-18 23:19:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:19:52,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:19:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:19:52,588 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-18 23:19:52,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:19:52,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176344392] [2022-01-18 23:19:52,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176344392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:19:52,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:19:52,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:19:52,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026803795] [2022-01-18 23:19:52,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:19:52,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:19:52,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:19:52,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:19:52,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:19:52,591 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:19:52,593 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-18 23:19:52,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:19:52,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:19:52,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:19:56,730 INFO L129 PetriNetUnfolder]: 2297/6566 cut-off events. [2022-01-18 23:19:56,730 INFO L130 PetriNetUnfolder]: For 8292/8295 co-relation queries the response was YES. [2022-01-18 23:19:56,752 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-18 23:19:56,769 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 367 selfloop transitions, 116 changer transitions 1/555 dead transitions. [2022-01-18 23:19:56,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 555 transitions, 3917 flow [2022-01-18 23:19:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 23:19:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-18 23:19:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3117 transitions. [2022-01-18 23:19:56,775 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5331850838179952 [2022-01-18 23:19:56,775 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3117 transitions. [2022-01-18 23:19:56,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3117 transitions. [2022-01-18 23:19:56,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:19:56,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3117 transitions. [2022-01-18 23:19:56,780 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-18 23:19:56,785 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-18 23:19:56,786 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-18 23:19:56,786 INFO L186 Difference]: Start difference. First operand has 230 places, 255 transitions, 1245 flow. Second operand 37 states and 3117 transitions. [2022-01-18 23:19:56,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 555 transitions, 3917 flow [2022-01-18 23:19:56,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 555 transitions, 3890 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-01-18 23:19:56,809 INFO L242 Difference]: Finished difference. Result has 283 places, 326 transitions, 2220 flow [2022-01-18 23:19:56,809 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-18 23:19:56,810 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 141 predicate places. [2022-01-18 23:19:56,810 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 326 transitions, 2220 flow [2022-01-18 23:19:56,811 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-18 23:19:56,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:19:56,811 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-18 23:19:56,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 23:19:56,811 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-18 23:19:56,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:19:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1366726909, now seen corresponding path program 3 times [2022-01-18 23:19:56,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:19:56,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284015862] [2022-01-18 23:19:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:19:56,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:19:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:19:57,461 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-18 23:19:57,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:19:57,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284015862] [2022-01-18 23:19:57,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284015862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:19:57,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:19:57,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:19:57,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915720395] [2022-01-18 23:19:57,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:19:57,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:19:57,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:19:57,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:19:57,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:19:57,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:19:57,465 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-18 23:19:57,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:19:57,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:19:57,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:03,352 INFO L129 PetriNetUnfolder]: 3204/8725 cut-off events. [2022-01-18 23:20:03,352 INFO L130 PetriNetUnfolder]: For 27009/27024 co-relation queries the response was YES. [2022-01-18 23:20:03,394 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-18 23:20:03,418 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 484 selfloop transitions, 160 changer transitions 14/729 dead transitions. [2022-01-18 23:20:03,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 729 transitions, 6309 flow [2022-01-18 23:20:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 23:20:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-01-18 23:20:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 4127 transitions. [2022-01-18 23:20:03,424 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5330663911134074 [2022-01-18 23:20:03,424 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 4127 transitions. [2022-01-18 23:20:03,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 4127 transitions. [2022-01-18 23:20:03,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:03,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 4127 transitions. [2022-01-18 23:20:03,429 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-18 23:20:03,435 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-18 23:20:03,436 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-18 23:20:03,436 INFO L186 Difference]: Start difference. First operand has 283 places, 326 transitions, 2220 flow. Second operand 49 states and 4127 transitions. [2022-01-18 23:20:03,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 729 transitions, 6309 flow [2022-01-18 23:20:03,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 729 transitions, 6043 flow, removed 104 selfloop flow, removed 8 redundant places. [2022-01-18 23:20:03,521 INFO L242 Difference]: Finished difference. Result has 360 places, 445 transitions, 3911 flow [2022-01-18 23:20:03,521 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-18 23:20:03,523 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 218 predicate places. [2022-01-18 23:20:03,523 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 445 transitions, 3911 flow [2022-01-18 23:20:03,523 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-18 23:20:03,523 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:03,523 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-18 23:20:03,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 23:20:03,524 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-18 23:20:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1084924805, now seen corresponding path program 4 times [2022-01-18 23:20:03,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:03,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210688280] [2022-01-18 23:20:03,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:03,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:04,108 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-18 23:20:04,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:04,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210688280] [2022-01-18 23:20:04,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210688280] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:20:04,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:20:04,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:20:04,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300011778] [2022-01-18 23:20:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:20:04,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:20:04,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:04,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:20:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:20:04,111 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:20:04,112 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-18 23:20:04,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:04,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:20:04,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:08,976 INFO L129 PetriNetUnfolder]: 3867/10439 cut-off events. [2022-01-18 23:20:08,976 INFO L130 PetriNetUnfolder]: For 57389/57405 co-relation queries the response was YES. [2022-01-18 23:20:09,065 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-18 23:20:09,110 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 567 selfloop transitions, 140 changer transitions 3/781 dead transitions. [2022-01-18 23:20:09,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 781 transitions, 8223 flow [2022-01-18 23:20:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 23:20:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-18 23:20:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3149 transitions. [2022-01-18 23:20:09,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5386589120766336 [2022-01-18 23:20:09,113 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3149 transitions. [2022-01-18 23:20:09,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3149 transitions. [2022-01-18 23:20:09,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:09,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3149 transitions. [2022-01-18 23:20:09,117 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-18 23:20:09,121 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-18 23:20:09,122 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-18 23:20:09,122 INFO L186 Difference]: Start difference. First operand has 360 places, 445 transitions, 3911 flow. Second operand 37 states and 3149 transitions. [2022-01-18 23:20:09,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 781 transitions, 8223 flow [2022-01-18 23:20:09,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 781 transitions, 7895 flow, removed 148 selfloop flow, removed 7 redundant places. [2022-01-18 23:20:09,304 INFO L242 Difference]: Finished difference. Result has 418 places, 518 transitions, 5075 flow [2022-01-18 23:20:09,304 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-18 23:20:09,305 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 276 predicate places. [2022-01-18 23:20:09,306 INFO L470 AbstractCegarLoop]: Abstraction has has 418 places, 518 transitions, 5075 flow [2022-01-18 23:20:09,306 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-18 23:20:09,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:09,306 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-18 23:20:09,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 23:20:09,306 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-18 23:20:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1419731227, now seen corresponding path program 5 times [2022-01-18 23:20:09,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:09,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956083282] [2022-01-18 23:20:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:09,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:09,798 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-18 23:20:09,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:09,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956083282] [2022-01-18 23:20:09,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956083282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:20:09,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:20:09,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:20:09,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416279500] [2022-01-18 23:20:09,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:20:09,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:20:09,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:09,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:20:09,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:20:09,801 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:20:09,802 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-18 23:20:09,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:09,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:20:09,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:16,464 INFO L129 PetriNetUnfolder]: 4098/10904 cut-off events. [2022-01-18 23:20:16,464 INFO L130 PetriNetUnfolder]: For 81686/81704 co-relation queries the response was YES. [2022-01-18 23:20:16,548 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-18 23:20:16,767 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 631 selfloop transitions, 299 changer transitions 13/1014 dead transitions. [2022-01-18 23:20:16,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 1014 transitions, 11506 flow [2022-01-18 23:20:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-18 23:20:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-01-18 23:20:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 4255 transitions. [2022-01-18 23:20:16,778 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5280466617026558 [2022-01-18 23:20:16,778 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 4255 transitions. [2022-01-18 23:20:16,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 4255 transitions. [2022-01-18 23:20:16,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:16,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 4255 transitions. [2022-01-18 23:20:16,788 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-18 23:20:16,796 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-18 23:20:16,798 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-18 23:20:16,798 INFO L186 Difference]: Start difference. First operand has 418 places, 518 transitions, 5075 flow. Second operand 51 states and 4255 transitions. [2022-01-18 23:20:16,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 1014 transitions, 11506 flow [2022-01-18 23:20:17,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1014 transitions, 10966 flow, removed 260 selfloop flow, removed 6 redundant places. [2022-01-18 23:20:17,201 INFO L242 Difference]: Finished difference. Result has 496 places, 604 transitions, 6902 flow [2022-01-18 23:20:17,202 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-18 23:20:17,202 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 354 predicate places. [2022-01-18 23:20:17,203 INFO L470 AbstractCegarLoop]: Abstraction has has 496 places, 604 transitions, 6902 flow [2022-01-18 23:20:17,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-18 23:20:17,203 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:17,203 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-18 23:20:17,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 23:20:17,203 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-18 23:20:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1657952229, now seen corresponding path program 6 times [2022-01-18 23:20:17,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:17,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915045935] [2022-01-18 23:20:17,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:17,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:17,772 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-18 23:20:17,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:17,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915045935] [2022-01-18 23:20:17,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915045935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:20:17,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:20:17,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:20:17,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658818452] [2022-01-18 23:20:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:20:17,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:20:17,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:20:17,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:20:17,775 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:20:17,776 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-18 23:20:17,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:17,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:20:17,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:24,117 INFO L129 PetriNetUnfolder]: 4921/13140 cut-off events. [2022-01-18 23:20:24,117 INFO L130 PetriNetUnfolder]: For 155630/155644 co-relation queries the response was YES. [2022-01-18 23:20:24,251 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-18 23:20:24,284 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 723 selfloop transitions, 193 changer transitions 4/991 dead transitions. [2022-01-18 23:20:24,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 991 transitions, 13410 flow [2022-01-18 23:20:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 23:20:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-18 23:20:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3165 transitions. [2022-01-18 23:20:24,287 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5413958262059528 [2022-01-18 23:20:24,287 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3165 transitions. [2022-01-18 23:20:24,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3165 transitions. [2022-01-18 23:20:24,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:24,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3165 transitions. [2022-01-18 23:20:24,291 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-18 23:20:24,295 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-18 23:20:24,296 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-18 23:20:24,296 INFO L186 Difference]: Start difference. First operand has 496 places, 604 transitions, 6902 flow. Second operand 37 states and 3165 transitions. [2022-01-18 23:20:24,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 991 transitions, 13410 flow [2022-01-18 23:20:24,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 991 transitions, 12423 flow, removed 219 selfloop flow, removed 15 redundant places. [2022-01-18 23:20:24,801 INFO L242 Difference]: Finished difference. Result has 543 places, 691 transitions, 8480 flow [2022-01-18 23:20:24,802 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-18 23:20:24,802 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 401 predicate places. [2022-01-18 23:20:24,802 INFO L470 AbstractCegarLoop]: Abstraction has has 543 places, 691 transitions, 8480 flow [2022-01-18 23:20:24,803 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-18 23:20:24,803 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:24,803 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-18 23:20:24,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 23:20:24,803 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-18 23:20:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:24,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1633184395, now seen corresponding path program 7 times [2022-01-18 23:20:24,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:24,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284600792] [2022-01-18 23:20:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:24,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:25,312 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-18 23:20:25,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:25,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284600792] [2022-01-18 23:20:25,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284600792] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:20:25,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:20:25,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:20:25,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986016340] [2022-01-18 23:20:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:20:25,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:20:25,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:25,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:20:25,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:20:25,315 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:20:25,316 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-18 23:20:25,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:25,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:20:25,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:34,592 INFO L129 PetriNetUnfolder]: 5344/13898 cut-off events. [2022-01-18 23:20:34,592 INFO L130 PetriNetUnfolder]: For 219532/219548 co-relation queries the response was YES. [2022-01-18 23:20:34,821 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-18 23:20:34,867 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 748 selfloop transitions, 302 changer transitions 20/1141 dead transitions. [2022-01-18 23:20:34,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 1141 transitions, 16235 flow [2022-01-18 23:20:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-18 23:20:34,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-18 23:20:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4435 transitions. [2022-01-18 23:20:34,872 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5398003894839338 [2022-01-18 23:20:34,872 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4435 transitions. [2022-01-18 23:20:34,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4435 transitions. [2022-01-18 23:20:34,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:34,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4435 transitions. [2022-01-18 23:20:34,878 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-18 23:20:34,883 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-18 23:20:34,884 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-18 23:20:34,884 INFO L186 Difference]: Start difference. First operand has 543 places, 691 transitions, 8480 flow. Second operand 52 states and 4435 transitions. [2022-01-18 23:20:34,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 1141 transitions, 16235 flow [2022-01-18 23:20:35,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 1141 transitions, 15545 flow, removed 290 selfloop flow, removed 9 redundant places. [2022-01-18 23:20:35,677 INFO L242 Difference]: Finished difference. Result has 616 places, 782 transitions, 10516 flow [2022-01-18 23:20:35,678 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-18 23:20:35,679 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 474 predicate places. [2022-01-18 23:20:35,679 INFO L470 AbstractCegarLoop]: Abstraction has has 616 places, 782 transitions, 10516 flow [2022-01-18 23:20:35,679 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-18 23:20:35,679 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:35,679 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-18 23:20:35,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 23:20:35,680 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-18 23:20:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1827845697, now seen corresponding path program 8 times [2022-01-18 23:20:35,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415719524] [2022-01-18 23:20:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:35,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:36,153 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-18 23:20:36,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:36,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415719524] [2022-01-18 23:20:36,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415719524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:20:36,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:20:36,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:20:36,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412220174] [2022-01-18 23:20:36,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:20:36,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:20:36,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:36,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:20:36,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:20:36,156 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:20:36,157 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-18 23:20:36,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:36,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:20:36,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:43,935 INFO L129 PetriNetUnfolder]: 5731/15210 cut-off events. [2022-01-18 23:20:43,935 INFO L130 PetriNetUnfolder]: For 292360/292393 co-relation queries the response was YES. [2022-01-18 23:20:44,151 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-18 23:20:44,189 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 849 selfloop transitions, 307 changer transitions 4/1231 dead transitions. [2022-01-18 23:20:44,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 1231 transitions, 18663 flow [2022-01-18 23:20:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-18 23:20:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-18 23:20:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3144 transitions. [2022-01-18 23:20:44,192 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378036264112214 [2022-01-18 23:20:44,192 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3144 transitions. [2022-01-18 23:20:44,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3144 transitions. [2022-01-18 23:20:44,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:44,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3144 transitions. [2022-01-18 23:20:44,205 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-18 23:20:44,210 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-18 23:20:44,211 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-18 23:20:44,211 INFO L186 Difference]: Start difference. First operand has 616 places, 782 transitions, 10516 flow. Second operand 37 states and 3144 transitions. [2022-01-18 23:20:44,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 1231 transitions, 18663 flow [2022-01-18 23:20:45,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 1231 transitions, 17692 flow, removed 313 selfloop flow, removed 13 redundant places. [2022-01-18 23:20:45,395 INFO L242 Difference]: Finished difference. Result has 666 places, 859 transitions, 12491 flow [2022-01-18 23:20:45,395 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-18 23:20:45,396 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 524 predicate places. [2022-01-18 23:20:45,396 INFO L470 AbstractCegarLoop]: Abstraction has has 666 places, 859 transitions, 12491 flow [2022-01-18 23:20:45,396 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-18 23:20:45,396 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:45,396 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-18 23:20:45,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 23:20:45,397 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-18 23:20:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:45,397 INFO L85 PathProgramCache]: Analyzing trace with hash 109563799, now seen corresponding path program 9 times [2022-01-18 23:20:45,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:45,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432170058] [2022-01-18 23:20:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:45,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:45,936 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-18 23:20:45,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:45,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432170058] [2022-01-18 23:20:45,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432170058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:20:45,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:20:45,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:20:45,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442291413] [2022-01-18 23:20:45,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:20:45,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:20:45,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:45,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:20:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:20:45,939 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:20:45,940 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-18 23:20:45,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:45,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:20:45,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:20:56,185 INFO L129 PetriNetUnfolder]: 6663/17422 cut-off events. [2022-01-18 23:20:56,186 INFO L130 PetriNetUnfolder]: For 432985/433005 co-relation queries the response was YES. [2022-01-18 23:20:56,479 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-18 23:20:56,531 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 947 selfloop transitions, 256 changer transitions 6/1280 dead transitions. [2022-01-18 23:20:56,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 1280 transitions, 21435 flow [2022-01-18 23:20:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-18 23:20:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-18 23:20:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3678 transitions. [2022-01-18 23:20:56,537 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5413600235501913 [2022-01-18 23:20:56,537 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3678 transitions. [2022-01-18 23:20:56,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3678 transitions. [2022-01-18 23:20:56,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:20:56,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3678 transitions. [2022-01-18 23:20:56,541 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-18 23:20:56,545 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-18 23:20:56,546 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-18 23:20:56,546 INFO L186 Difference]: Start difference. First operand has 666 places, 859 transitions, 12491 flow. Second operand 43 states and 3678 transitions. [2022-01-18 23:20:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 1280 transitions, 21435 flow [2022-01-18 23:20:58,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 1280 transitions, 19461 flow, removed 919 selfloop flow, removed 8 redundant places. [2022-01-18 23:20:58,571 INFO L242 Difference]: Finished difference. Result has 733 places, 962 transitions, 14912 flow [2022-01-18 23:20:58,572 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-18 23:20:58,573 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 591 predicate places. [2022-01-18 23:20:58,573 INFO L470 AbstractCegarLoop]: Abstraction has has 733 places, 962 transitions, 14912 flow [2022-01-18 23:20:58,574 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-18 23:20:58,574 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:20:58,574 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-18 23:20:58,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-18 23:20:58,574 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-18 23:20:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:20:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -680050159, now seen corresponding path program 10 times [2022-01-18 23:20:58,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:20:58,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489138077] [2022-01-18 23:20:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:20:58,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:20:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:20:59,157 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-18 23:20:59,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:20:59,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489138077] [2022-01-18 23:20:59,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489138077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:20:59,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:20:59,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:20:59,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278341574] [2022-01-18 23:20:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:20:59,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:20:59,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:20:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:20:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:20:59,160 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:20:59,162 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-18 23:20:59,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:20:59,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:20:59,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:21:10,734 INFO L129 PetriNetUnfolder]: 7029/18191 cut-off events. [2022-01-18 23:21:10,734 INFO L130 PetriNetUnfolder]: For 446209/446253 co-relation queries the response was YES. [2022-01-18 23:21:11,163 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-18 23:21:11,227 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1000 selfloop transitions, 580 changer transitions 19/1670 dead transitions. [2022-01-18 23:21:11,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 1670 transitions, 28105 flow [2022-01-18 23:21:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-01-18 23:21:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-01-18 23:21:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4572 transitions. [2022-01-18 23:21:11,231 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5358649789029536 [2022-01-18 23:21:11,231 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4572 transitions. [2022-01-18 23:21:11,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4572 transitions. [2022-01-18 23:21:11,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:21:11,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4572 transitions. [2022-01-18 23:21:11,236 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-18 23:21:11,241 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-18 23:21:11,241 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-18 23:21:11,241 INFO L186 Difference]: Start difference. First operand has 733 places, 962 transitions, 14912 flow. Second operand 54 states and 4572 transitions. [2022-01-18 23:21:11,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 1670 transitions, 28105 flow [2022-01-18 23:21:13,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 778 places, 1670 transitions, 26905 flow, removed 549 selfloop flow, removed 8 redundant places. [2022-01-18 23:21:13,668 INFO L242 Difference]: Finished difference. Result has 809 places, 1064 transitions, 18097 flow [2022-01-18 23:21:13,669 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-18 23:21:13,670 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 667 predicate places. [2022-01-18 23:21:13,670 INFO L470 AbstractCegarLoop]: Abstraction has has 809 places, 1064 transitions, 18097 flow [2022-01-18 23:21:13,670 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-18 23:21:13,671 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:21:13,671 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-18 23:21:13,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-18 23:21:13,671 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-18 23:21:13,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:21:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1742405489, now seen corresponding path program 11 times [2022-01-18 23:21:13,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:21:13,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243869092] [2022-01-18 23:21:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:21:13,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:21:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:21:14,259 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-18 23:21:14,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:21:14,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243869092] [2022-01-18 23:21:14,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243869092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:21:14,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:21:14,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:21:14,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899440034] [2022-01-18 23:21:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:21:14,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:21:14,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:21:14,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:21:14,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:21:14,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:21:14,262 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-18 23:21:14,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:21:14,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:21:14,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:21:26,740 INFO L129 PetriNetUnfolder]: 8010/20991 cut-off events. [2022-01-18 23:21:26,741 INFO L130 PetriNetUnfolder]: For 622280/622314 co-relation queries the response was YES. [2022-01-18 23:21:27,303 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-18 23:21:27,366 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1140 selfloop transitions, 419 changer transitions 4/1634 dead transitions. [2022-01-18 23:21:27,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 846 places, 1634 transitions, 30399 flow [2022-01-18 23:21:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-18 23:21:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-18 23:21:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3248 transitions. [2022-01-18 23:21:27,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5409726848767489 [2022-01-18 23:21:27,369 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3248 transitions. [2022-01-18 23:21:27,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3248 transitions. [2022-01-18 23:21:27,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:21:27,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3248 transitions. [2022-01-18 23:21:27,392 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-18 23:21:27,395 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-18 23:21:27,395 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-18 23:21:27,395 INFO L186 Difference]: Start difference. First operand has 809 places, 1064 transitions, 18097 flow. Second operand 38 states and 3248 transitions. [2022-01-18 23:21:27,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 846 places, 1634 transitions, 30399 flow [2022-01-18 23:21:30,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 831 places, 1634 transitions, 28060 flow, removed 663 selfloop flow, removed 15 redundant places. [2022-01-18 23:21:30,780 INFO L242 Difference]: Finished difference. Result has 854 places, 1206 transitions, 21541 flow [2022-01-18 23:21:30,781 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-18 23:21:30,782 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 712 predicate places. [2022-01-18 23:21:30,782 INFO L470 AbstractCegarLoop]: Abstraction has has 854 places, 1206 transitions, 21541 flow [2022-01-18 23:21:30,782 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-18 23:21:30,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:21:30,782 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-18 23:21:30,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-18 23:21:30,782 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-18 23:21:30,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:21:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash -410028145, now seen corresponding path program 12 times [2022-01-18 23:21:30,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:21:30,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134325182] [2022-01-18 23:21:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:21:30,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:21:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:21:31,309 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-18 23:21:31,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:21:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134325182] [2022-01-18 23:21:31,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134325182] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:21:31,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:21:31,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:21:31,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318986289] [2022-01-18 23:21:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:21:31,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:21:31,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:21:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:21:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:21:31,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:21:31,312 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-18 23:21:31,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:21:31,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:21:31,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:21:47,342 INFO L129 PetriNetUnfolder]: 9263/24071 cut-off events. [2022-01-18 23:21:47,342 INFO L130 PetriNetUnfolder]: For 858735/858808 co-relation queries the response was YES. [2022-01-18 23:21:48,006 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-18 23:21:48,093 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1246 selfloop transitions, 426 changer transitions 15/1758 dead transitions. [2022-01-18 23:21:48,093 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 900 places, 1758 transitions, 36274 flow [2022-01-18 23:21:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-18 23:21:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-18 23:21:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3993 transitions. [2022-01-18 23:21:48,098 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5377053595475357 [2022-01-18 23:21:48,098 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3993 transitions. [2022-01-18 23:21:48,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3993 transitions. [2022-01-18 23:21:48,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:21:48,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3993 transitions. [2022-01-18 23:21:48,129 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-18 23:21:48,135 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-18 23:21:48,135 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-18 23:21:48,135 INFO L186 Difference]: Start difference. First operand has 854 places, 1206 transitions, 21541 flow. Second operand 47 states and 3993 transitions. [2022-01-18 23:21:48,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 900 places, 1758 transitions, 36274 flow [2022-01-18 23:21:53,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 1758 transitions, 33946 flow, removed 972 selfloop flow, removed 13 redundant places. [2022-01-18 23:21:53,118 INFO L242 Difference]: Finished difference. Result has 920 places, 1404 transitions, 27750 flow [2022-01-18 23:21:53,119 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-18 23:21:53,119 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 778 predicate places. [2022-01-18 23:21:53,119 INFO L470 AbstractCegarLoop]: Abstraction has has 920 places, 1404 transitions, 27750 flow [2022-01-18 23:21:53,120 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-18 23:21:53,120 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:21:53,120 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-18 23:21:53,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-18 23:21:53,120 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-18 23:21:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:21:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash -982693187, now seen corresponding path program 13 times [2022-01-18 23:21:53,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:21:53,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008815853] [2022-01-18 23:21:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:21:53,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:21:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:21:53,610 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-18 23:21:53,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:21:53,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008815853] [2022-01-18 23:21:53,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008815853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:21:53,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:21:53,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:21:53,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500419790] [2022-01-18 23:21:53,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:21:53,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:21:53,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:21:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:21:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:21:53,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:21:53,613 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-18 23:21:53,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:21:53,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:21:53,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:22:11,776 INFO L129 PetriNetUnfolder]: 10305/26728 cut-off events. [2022-01-18 23:22:11,776 INFO L130 PetriNetUnfolder]: For 977480/977564 co-relation queries the response was YES. [2022-01-18 23:22:12,818 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-18 23:22:12,910 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1305 selfloop transitions, 590 changer transitions 4/1970 dead transitions. [2022-01-18 23:22:12,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 1970 transitions, 41859 flow [2022-01-18 23:22:12,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-18 23:22:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-18 23:22:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3654 transitions. [2022-01-18 23:22:12,913 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378274948483956 [2022-01-18 23:22:12,913 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3654 transitions. [2022-01-18 23:22:12,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3654 transitions. [2022-01-18 23:22:12,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:22:12,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3654 transitions. [2022-01-18 23:22:12,917 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-18 23:22:12,920 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-18 23:22:12,920 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-18 23:22:12,921 INFO L186 Difference]: Start difference. First operand has 920 places, 1404 transitions, 27750 flow. Second operand 43 states and 3654 transitions. [2022-01-18 23:22:12,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 1970 transitions, 41859 flow [2022-01-18 23:22:19,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 1970 transitions, 40723 flow, removed 478 selfloop flow, removed 9 redundant places. [2022-01-18 23:22:19,971 INFO L242 Difference]: Finished difference. Result has 983 places, 1561 transitions, 33598 flow [2022-01-18 23:22:19,972 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-18 23:22:19,973 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 841 predicate places. [2022-01-18 23:22:19,973 INFO L470 AbstractCegarLoop]: Abstraction has has 983 places, 1561 transitions, 33598 flow [2022-01-18 23:22:19,974 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-18 23:22:19,974 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:22:19,974 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-18 23:22:19,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-18 23:22:19,974 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-18 23:22:19,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:22:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash -737988387, now seen corresponding path program 14 times [2022-01-18 23:22:19,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:22:19,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553717394] [2022-01-18 23:22:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:22:19,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:22:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:22:20,418 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-18 23:22:20,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:22:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553717394] [2022-01-18 23:22:20,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553717394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:22:20,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:22:20,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-18 23:22:20,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242487996] [2022-01-18 23:22:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:22:20,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-18 23:22:20,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:22:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-18 23:22:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2022-01-18 23:22:20,420 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 158 [2022-01-18 23:22:20,421 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-18 23:22:20,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:22:20,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 158 [2022-01-18 23:22:20,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:22:38,710 INFO L129 PetriNetUnfolder]: 8905/25562 cut-off events. [2022-01-18 23:22:38,712 INFO L130 PetriNetUnfolder]: For 1156805/1157515 co-relation queries the response was YES. [2022-01-18 23:22:39,838 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-18 23:22:39,928 INFO L132 encePairwiseOnDemand]: 129/158 looper letters, 1159 selfloop transitions, 708 changer transitions 14/2010 dead transitions. [2022-01-18 23:22:39,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 2010 transitions, 46940 flow [2022-01-18 23:22:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-18 23:22:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-18 23:22:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3190 transitions. [2022-01-18 23:22:39,943 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5608298171589311 [2022-01-18 23:22:39,944 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3190 transitions. [2022-01-18 23:22:39,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3190 transitions. [2022-01-18 23:22:39,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:22:39,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3190 transitions. [2022-01-18 23:22:39,947 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-18 23:22:39,960 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-18 23:22:39,961 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-18 23:22:39,961 INFO L186 Difference]: Start difference. First operand has 983 places, 1561 transitions, 33598 flow. Second operand 36 states and 3190 transitions. [2022-01-18 23:22:39,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 2010 transitions, 46940 flow [2022-01-18 23:22:46,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1008 places, 2010 transitions, 45409 flow, removed 649 selfloop flow, removed 10 redundant places. [2022-01-18 23:22:46,949 INFO L242 Difference]: Finished difference. Result has 1032 places, 1764 transitions, 40613 flow [2022-01-18 23:22:46,950 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-18 23:22:46,950 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 890 predicate places. [2022-01-18 23:22:46,950 INFO L470 AbstractCegarLoop]: Abstraction has has 1032 places, 1764 transitions, 40613 flow [2022-01-18 23:22:46,951 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-18 23:22:46,951 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:22:46,951 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-18 23:22:46,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-18 23:22:46,951 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-18 23:22:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:22:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash 929706661, now seen corresponding path program 15 times [2022-01-18 23:22:46,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:22:46,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547512821] [2022-01-18 23:22:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:22:46,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:22:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:22:47,447 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-18 23:22:47,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:22:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547512821] [2022-01-18 23:22:47,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547512821] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:22:47,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:22:47,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:22:47,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875034936] [2022-01-18 23:22:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:22:47,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:22:47,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:22:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:22:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:22:47,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:22:47,450 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-18 23:22:47,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:22:47,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:22:47,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:23:13,218 INFO L129 PetriNetUnfolder]: 12061/30819 cut-off events. [2022-01-18 23:23:13,218 INFO L130 PetriNetUnfolder]: For 1574618/1574772 co-relation queries the response was YES. [2022-01-18 23:23:14,932 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-18 23:23:15,049 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1666 selfloop transitions, 419 changer transitions 6/2162 dead transitions. [2022-01-18 23:23:15,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1074 places, 2162 transitions, 51490 flow [2022-01-18 23:23:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-18 23:23:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-18 23:23:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3682 transitions. [2022-01-18 23:23:15,052 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5419487783338239 [2022-01-18 23:23:15,052 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3682 transitions. [2022-01-18 23:23:15,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3682 transitions. [2022-01-18 23:23:15,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:23:15,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3682 transitions. [2022-01-18 23:23:15,056 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-18 23:23:15,059 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-18 23:23:15,059 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-18 23:23:15,059 INFO L186 Difference]: Start difference. First operand has 1032 places, 1764 transitions, 40613 flow. Second operand 43 states and 3682 transitions. [2022-01-18 23:23:15,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1074 places, 2162 transitions, 51490 flow [2022-01-18 23:23:26,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1063 places, 2162 transitions, 50210 flow, removed 539 selfloop flow, removed 11 redundant places. [2022-01-18 23:23:26,139 INFO L242 Difference]: Finished difference. Result has 1097 places, 1860 transitions, 43624 flow [2022-01-18 23:23:26,140 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-18 23:23:26,141 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 955 predicate places. [2022-01-18 23:23:26,141 INFO L470 AbstractCegarLoop]: Abstraction has has 1097 places, 1860 transitions, 43624 flow [2022-01-18 23:23:26,142 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-18 23:23:26,142 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:23:26,142 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-18 23:23:26,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-18 23:23:26,142 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-18 23:23:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:23:26,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1429447959, now seen corresponding path program 16 times [2022-01-18 23:23:26,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:23:26,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906423546] [2022-01-18 23:23:26,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:23:26,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:23:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:23:26,664 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-18 23:23:26,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:23:26,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906423546] [2022-01-18 23:23:26,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906423546] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:23:26,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:23:26,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:23:26,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444785158] [2022-01-18 23:23:26,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:23:26,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:23:26,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:23:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:23:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:23:26,666 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:23:26,667 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-18 23:23:26,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:23:26,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:23:26,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:24:01,134 INFO L129 PetriNetUnfolder]: 15552/39520 cut-off events. [2022-01-18 23:24:01,134 INFO L130 PetriNetUnfolder]: For 2348333/2348526 co-relation queries the response was YES. [2022-01-18 23:24:04,438 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-18 23:24:04,591 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 1875 selfloop transitions, 941 changer transitions 6/2893 dead transitions. [2022-01-18 23:24:04,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1141 places, 2893 transitions, 78638 flow [2022-01-18 23:24:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-18 23:24:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-01-18 23:24:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3824 transitions. [2022-01-18 23:24:04,622 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5378340365682138 [2022-01-18 23:24:04,622 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3824 transitions. [2022-01-18 23:24:04,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3824 transitions. [2022-01-18 23:24:04,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:24:04,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3824 transitions. [2022-01-18 23:24:04,632 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-18 23:24:04,635 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-18 23:24:04,635 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-18 23:24:04,635 INFO L186 Difference]: Start difference. First operand has 1097 places, 1860 transitions, 43624 flow. Second operand 45 states and 3824 transitions. [2022-01-18 23:24:04,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1141 places, 2893 transitions, 78638 flow [2022-01-18 23:24:24,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1134 places, 2893 transitions, 77029 flow, removed 774 selfloop flow, removed 7 redundant places. [2022-01-18 23:24:24,086 INFO L242 Difference]: Finished difference. Result has 1167 places, 2418 transitions, 67225 flow [2022-01-18 23:24:24,088 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-18 23:24:24,088 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1025 predicate places. [2022-01-18 23:24:24,088 INFO L470 AbstractCegarLoop]: Abstraction has has 1167 places, 2418 transitions, 67225 flow [2022-01-18 23:24:24,088 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-18 23:24:24,088 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:24:24,088 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-18 23:24:24,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-18 23:24:24,089 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-18 23:24:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:24:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash -622515957, now seen corresponding path program 17 times [2022-01-18 23:24:24,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:24:24,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030266625] [2022-01-18 23:24:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:24:24,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:24:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:24:24,585 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-18 23:24:24,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:24:24,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030266625] [2022-01-18 23:24:24,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030266625] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:24:24,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:24:24,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:24:24,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405670943] [2022-01-18 23:24:24,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:24:24,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:24:24,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:24:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:24:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:24:24,588 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:24:24,588 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-18 23:24:24,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:24:24,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:24:24,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 23:25:21,243 INFO L129 PetriNetUnfolder]: 21875/54810 cut-off events. [2022-01-18 23:25:21,243 INFO L130 PetriNetUnfolder]: For 3853740/3854002 co-relation queries the response was YES. [2022-01-18 23:25:27,530 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-18 23:25:27,753 INFO L132 encePairwiseOnDemand]: 125/158 looper letters, 2325 selfloop transitions, 1522 changer transitions 5/3923 dead transitions. [2022-01-18 23:25:27,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1209 places, 3923 transitions, 126616 flow [2022-01-18 23:25:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-18 23:25:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-18 23:25:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3675 transitions. [2022-01-18 23:25:27,755 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5409184574624669 [2022-01-18 23:25:27,760 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3675 transitions. [2022-01-18 23:25:27,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3675 transitions. [2022-01-18 23:25:27,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 23:25:27,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3675 transitions. [2022-01-18 23:25:27,763 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-18 23:25:27,777 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-18 23:25:27,777 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-18 23:25:27,778 INFO L186 Difference]: Start difference. First operand has 1167 places, 2418 transitions, 67225 flow. Second operand 43 states and 3675 transitions. [2022-01-18 23:25:27,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1209 places, 3923 transitions, 126616 flow [2022-01-18 23:26:22,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1199 places, 3923 transitions, 122314 flow, removed 2023 selfloop flow, removed 10 redundant places. [2022-01-18 23:26:22,827 INFO L242 Difference]: Finished difference. Result has 1230 places, 3377 transitions, 111124 flow [2022-01-18 23:26:22,829 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-18 23:26:22,830 INFO L334 CegarLoopForPetriNet]: 142 programPoint places, 1088 predicate places. [2022-01-18 23:26:22,830 INFO L470 AbstractCegarLoop]: Abstraction has has 1230 places, 3377 transitions, 111124 flow [2022-01-18 23:26:22,830 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-18 23:26:22,830 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 23:26:22,830 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-18 23:26:22,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-18 23:26:22,831 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-18 23:26:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 23:26:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1600645409, now seen corresponding path program 18 times [2022-01-18 23:26:22,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 23:26:22,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834555138] [2022-01-18 23:26:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 23:26:22,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 23:26:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 23:26:23,282 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-18 23:26:23,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 23:26:23,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834555138] [2022-01-18 23:26:23,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834555138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 23:26:23,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 23:26:23,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-01-18 23:26:23,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109964855] [2022-01-18 23:26:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 23:26:23,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-18 23:26:23,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 23:26:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-18 23:26:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-01-18 23:26:23,285 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 158 [2022-01-18 23:26:23,287 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-18 23:26:23,287 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 23:26:23,287 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 158 [2022-01-18 23:26:23,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand