/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/weaver/chl-file-item-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:38:35,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:38:35,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:38:35,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:38:35,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:38:35,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:38:35,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:38:35,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:38:35,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:38:35,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:38:35,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:38:35,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:38:35,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:38:35,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:38:35,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:38:35,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:38:35,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:38:35,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:38:35,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:38:35,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:38:35,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:38:35,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:38:35,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:38:35,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:38:35,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:38:35,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:38:35,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:38:35,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:38:35,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:38:35,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:38:35,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:38:35,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:38:35,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:38:35,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:38:35,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:38:35,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:38:35,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:38:35,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:38:35,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:38:35,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:38:35,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:38:35,693 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-19 00:38:35,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:38:35,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:38:35,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:38:35,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:38:35,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:38:35,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:38:35,731 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:38:35,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:38:35,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:38:35,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:38:35,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:38:35,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:38:35,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:38:35,734 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:38:35,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:38:35,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:38:35,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:38:35,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:38:35,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:38:35,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:38:35,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:38:35,735 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:38:35,735 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:38:35,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 00:38:35,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:38:35,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:38:35,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:38:35,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:38:35,945 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:38:35,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-01-19 00:38:36,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a3d24d/15ccae19d7c143fabdd9533057fc689e/FLAG19ffe8334 [2022-01-19 00:38:36,308 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:38:36,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-01-19 00:38:36,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a3d24d/15ccae19d7c143fabdd9533057fc689e/FLAG19ffe8334 [2022-01-19 00:38:36,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95a3d24d/15ccae19d7c143fabdd9533057fc689e [2022-01-19 00:38:36,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:38:36,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:38:36,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:38:36,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:38:36,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:38:36,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:36,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7106bc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36, skipping insertion in model container [2022-01-19 00:38:36,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:36,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:38:36,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:38:36,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-01-19 00:38:36,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:38:36,931 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:38:36,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-01-19 00:38:36,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:38:36,962 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:38:36,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36 WrapperNode [2022-01-19 00:38:36,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:38:36,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:38:36,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:38:36,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:38:36,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:36,976 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,000 INFO L137 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 217 [2022-01-19 00:38:37,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:38:37,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:38:37,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:38:37,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:38:37,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:38:37,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:38:37,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:38:37,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:38:37,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (1/1) ... [2022-01-19 00:38:37,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:38:37,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:38:37,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 00:38:37,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 00:38:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:38:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:38:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:38:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:38:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:38:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 00:38:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 00:38:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:38:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:38:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:38:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:38:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:38:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:38:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:38:37,093 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 00:38:37,194 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:38:37,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:38:37,474 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:38:37,487 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:38:37,487 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 00:38:37,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:38:37 BoogieIcfgContainer [2022-01-19 00:38:37,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:38:37,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:38:37,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:38:37,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:38:37,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:38:36" (1/3) ... [2022-01-19 00:38:37,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40def266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:38:37, skipping insertion in model container [2022-01-19 00:38:37,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:36" (2/3) ... [2022-01-19 00:38:37,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40def266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:38:37, skipping insertion in model container [2022-01-19 00:38:37,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:38:37" (3/3) ... [2022-01-19 00:38:37,495 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2022-01-19 00:38:37,498 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:38:37,499 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:38:37,499 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:38:37,549 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,549 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,549 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,549 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,554 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,554 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,554 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,554 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,554 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,554 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,555 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,555 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,555 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,555 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,555 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,555 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,557 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,558 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,559 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,560 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,571 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,591 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,592 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,593 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,598 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,601 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,602 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,603 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,604 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,605 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,606 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,607 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,610 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,611 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,612 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,613 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,614 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,615 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,616 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,617 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,618 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,619 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,620 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,621 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,621 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,621 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,621 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,627 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,628 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,633 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,639 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,640 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,641 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,642 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,643 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,644 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,645 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:38:37,654 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 00:38:37,702 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:38:37,716 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 00:38:37,716 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 00:38:37,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 263 places, 278 transitions, 580 flow [2022-01-19 00:38:37,867 INFO L129 PetriNetUnfolder]: 25/275 cut-off events. [2022-01-19 00:38:37,868 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:38:37,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 275 events. 25/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 746 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 199. Up to 2 conditions per place. [2022-01-19 00:38:37,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 278 transitions, 580 flow [2022-01-19 00:38:37,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 264 transitions, 546 flow [2022-01-19 00:38:37,946 INFO L129 PetriNetUnfolder]: 25/263 cut-off events. [2022-01-19 00:38:37,946 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:38:37,946 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:37,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:37,947 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash -802081389, now seen corresponding path program 1 times [2022-01-19 00:38:37,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:37,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772031598] [2022-01-19 00:38:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:37,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:38,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:38,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772031598] [2022-01-19 00:38:38,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772031598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:38,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:38,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:38,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362684819] [2022-01-19 00:38:38,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:38,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:38,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:38,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:38,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:38,259 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 00:38:38,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 264 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:38,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:38,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 00:38:38,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:38,495 INFO L129 PetriNetUnfolder]: 113/997 cut-off events. [2022-01-19 00:38:38,495 INFO L130 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-01-19 00:38:38,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 997 events. 113/997 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6897 event pairs, 26 based on Foata normal form. 55/939 useless extension candidates. Maximal degree in co-relation 963. Up to 74 conditions per place. [2022-01-19 00:38:38,515 INFO L132 encePairwiseOnDemand]: 261/278 looper letters, 18 selfloop transitions, 6 changer transitions 1/265 dead transitions. [2022-01-19 00:38:38,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 265 transitions, 608 flow [2022-01-19 00:38:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:38,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2022-01-19 00:38:38,534 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9592326139088729 [2022-01-19 00:38:38,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 800 transitions. [2022-01-19 00:38:38,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 800 transitions. [2022-01-19 00:38:38,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:38,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 800 transitions. [2022-01-19 00:38:38,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:38,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:38,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:38,560 INFO L186 Difference]: Start difference. First operand has 249 places, 264 transitions, 546 flow. Second operand 3 states and 800 transitions. [2022-01-19 00:38:38,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 265 transitions, 608 flow [2022-01-19 00:38:38,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 265 transitions, 588 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 00:38:38,575 INFO L242 Difference]: Finished difference. Result has 247 places, 260 transitions, 566 flow [2022-01-19 00:38:38,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=247, PETRI_TRANSITIONS=260} [2022-01-19 00:38:38,582 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, -2 predicate places. [2022-01-19 00:38:38,582 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 260 transitions, 566 flow [2022-01-19 00:38:38,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:38,583 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:38,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:38,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:38:38,583 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1464503203, now seen corresponding path program 1 times [2022-01-19 00:38:38,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:38,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79147136] [2022-01-19 00:38:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:38,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:38,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:38,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79147136] [2022-01-19 00:38:38,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79147136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:38,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:38,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:38,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519349512] [2022-01-19 00:38:38,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:38,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:38,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:38,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:38,754 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 00:38:38,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 260 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:38,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:38,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 00:38:38,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:39,121 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([843] thread3EXIT-->L80-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][257], [17#L80-2true, 268#(= 0 (+ ~isNull_6~0 (* (- 256) (div ~isNull_6~0 256)))), 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), Black: 266#true]) [2022-01-19 00:38:39,122 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is not cut-off event [2022-01-19 00:38:39,122 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is not cut-off event [2022-01-19 00:38:39,122 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is not cut-off event [2022-01-19 00:38:39,122 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is not cut-off event [2022-01-19 00:38:39,123 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([843] thread3EXIT-->L80-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem39#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][257], [17#L80-2true, 268#(= 0 (+ ~isNull_6~0 (* (- 256) (div ~isNull_6~0 256)))), 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), Black: 266#true]) [2022-01-19 00:38:39,124 INFO L384 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-01-19 00:38:39,124 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 00:38:39,124 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 00:38:39,124 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 00:38:39,124 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-01-19 00:38:39,132 INFO L129 PetriNetUnfolder]: 173/2319 cut-off events. [2022-01-19 00:38:39,133 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-01-19 00:38:39,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 2319 events. 173/2319 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 21879 event pairs, 25 based on Foata normal form. 0/2095 useless extension candidates. Maximal degree in co-relation 1196. Up to 72 conditions per place. [2022-01-19 00:38:39,156 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 15 selfloop transitions, 4 changer transitions 0/267 dead transitions. [2022-01-19 00:38:39,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 267 transitions, 623 flow [2022-01-19 00:38:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 00:38:39,159 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 00:38:39,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 00:38:39,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 00:38:39,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:39,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 00:38:39,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:39,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:39,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:39,164 INFO L186 Difference]: Start difference. First operand has 247 places, 260 transitions, 566 flow. Second operand 3 states and 795 transitions. [2022-01-19 00:38:39,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 267 transitions, 623 flow [2022-01-19 00:38:39,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 267 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:39,173 INFO L242 Difference]: Finished difference. Result has 248 places, 262 transitions, 582 flow [2022-01-19 00:38:39,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=248, PETRI_TRANSITIONS=262} [2022-01-19 00:38:39,174 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, -1 predicate places. [2022-01-19 00:38:39,174 INFO L470 AbstractCegarLoop]: Abstraction has has 248 places, 262 transitions, 582 flow [2022-01-19 00:38:39,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:39,176 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:39,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:39,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:38:39,177 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 584730219, now seen corresponding path program 1 times [2022-01-19 00:38:39,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:39,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933674144] [2022-01-19 00:38:39,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:39,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:39,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933674144] [2022-01-19 00:38:39,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933674144] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:39,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:39,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:38:39,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200163479] [2022-01-19 00:38:39,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:39,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:38:39,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:39,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:38:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:38:39,312 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 00:38:39,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 262 transitions, 582 flow. Second operand has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:39,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:39,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 00:38:39,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:39,531 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,531 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,531 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,531 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,531 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,536 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,536 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,536 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,536 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,536 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,536 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,537 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,537 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 00:38:39,537 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 00:38:39,537 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 00:38:39,541 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,541 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,541 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,541 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,541 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,541 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,541 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,542 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,542 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,542 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,542 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,542 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,549 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,549 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,549 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 00:38:39,549 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,549 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,550 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,550 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,550 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,551 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,551 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,551 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,554 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,555 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,560 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,560 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,560 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,561 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,561 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,563 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,563 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,563 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,563 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,563 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,573 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,573 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [278#true, 69#L56-30true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 237#L50-30true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,574 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,574 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,575 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,575 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,575 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,575 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 00:38:39,575 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,575 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 00:38:39,578 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,578 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,578 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,578 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,578 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,578 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,581 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,581 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,581 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,582 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,582 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,582 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,582 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,597 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,597 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,597 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,597 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,597 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,605 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,605 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,606 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,606 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,606 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,606 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,606 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,606 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,606 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,606 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,607 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,607 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,607 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,607 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 00:38:39,607 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,607 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,607 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 00:38:39,609 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,609 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,609 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,609 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,609 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,609 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,612 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, Black: 266#true, 94#L44-30true]) [2022-01-19 00:38:39,612 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,612 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,612 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,612 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,612 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,612 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,644 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,644 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,644 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,644 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,644 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,644 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,644 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,644 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 89#L77-4true, 94#L44-30true, Black: 266#true]) [2022-01-19 00:38:39,645 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 00:38:39,645 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 00:38:39,820 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,820 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,820 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,820 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,820 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,826 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,826 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,826 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,826 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,827 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,827 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,827 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,827 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 00:38:39,827 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,827 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,827 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 00:38:39,828 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 3#L50-4true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,828 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 00:38:39,828 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,828 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,828 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 00:38:39,828 INFO L387 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-01-19 00:38:39,831 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,831 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,831 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,833 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,834 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,834 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,834 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,841 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 00:38:39,841 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,841 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,841 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,841 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,848 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 00:38:39,849 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,849 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,849 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,849 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,849 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,849 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,849 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,849 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 51#L50-29true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,850 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,850 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,851 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 00:38:39,851 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,851 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-01-19 00:38:39,853 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 00:38:39,853 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,853 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,853 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,853 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,853 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,853 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,860 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,861 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,861 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,861 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,861 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,867 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,868 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,868 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,868 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,868 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,868 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 00:38:39,869 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,869 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, 237#L50-30true, Black: 266#true]) [2022-01-19 00:38:39,870 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,870 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,870 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,870 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,870 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,870 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,870 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-01-19 00:38:39,870 INFO L387 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-01-19 00:38:39,872 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,873 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,873 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,873 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,873 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,873 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,873 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,881 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,881 INFO L384 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,881 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,881 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,881 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,886 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,886 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,886 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,886 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,886 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,886 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,887 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,887 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,887 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,887 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,887 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,887 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,887 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,887 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 107#L50-31true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,888 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 00:38:39,888 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-01-19 00:38:39,891 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,891 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,891 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,891 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,891 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,891 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,891 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,903 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,904 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, 27#L50-32true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 159#L78-2true, Black: 266#true]) [2022-01-19 00:38:39,904 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,904 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,905 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,905 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,905 INFO L387 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-01-19 00:38:39,905 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:39,905 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-01-19 00:38:40,043 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 00:38:40,043 INFO L384 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,044 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,044 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,044 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,045 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 00:38:40,045 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,045 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,045 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,045 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,045 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,048 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 00:38:40,048 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,048 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,048 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,048 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,048 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,048 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 00:38:40,049 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,049 INFO L382 tUnfolder$Statistics]: inserting event number 8 for the transition-marking pair ([792] L56-29-->L56-30: Formula: (= v_~result_11~0_1 |v_thread3Thread1of1ForFork1_#t~ite21#1_5|) InVars {thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ite21#1=|v_thread3Thread1of1ForFork1_#t~ite21#1_5|, ~result_11~0=v_~result_11~0_1} AuxVars[] AssignedVars[~result_11~0][187], [69#L56-30true, 278#true, Black: 272#true, 274#(= (+ ~isNull_0~0 (* (- 256) (div ~isNull_0~0 256))) 0), 148#L79-2true, Black: 266#true]) [2022-01-19 00:38:40,050 INFO L384 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,050 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,050 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,050 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,050 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,050 INFO L387 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-01-19 00:38:40,050 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,050 INFO L387 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-01-19 00:38:40,124 INFO L129 PetriNetUnfolder]: 1007/4694 cut-off events. [2022-01-19 00:38:40,124 INFO L130 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-01-19 00:38:40,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 4694 events. 1007/4694 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 51165 event pairs, 316 based on Foata normal form. 4/4187 useless extension candidates. Maximal degree in co-relation 4096. Up to 1022 conditions per place. [2022-01-19 00:38:40,171 INFO L132 encePairwiseOnDemand]: 266/278 looper letters, 34 selfloop transitions, 15 changer transitions 4/293 dead transitions. [2022-01-19 00:38:40,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 293 transitions, 762 flow [2022-01-19 00:38:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:38:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:38:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2277 transitions. [2022-01-19 00:38:40,176 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9100719424460432 [2022-01-19 00:38:40,176 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2277 transitions. [2022-01-19 00:38:40,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2277 transitions. [2022-01-19 00:38:40,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:40,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2277 transitions. [2022-01-19 00:38:40,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 253.0) internal successors, (2277), 9 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,187 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,187 INFO L186 Difference]: Start difference. First operand has 248 places, 262 transitions, 582 flow. Second operand 9 states and 2277 transitions. [2022-01-19 00:38:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 293 transitions, 762 flow [2022-01-19 00:38:40,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 293 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:40,193 INFO L242 Difference]: Finished difference. Result has 261 places, 274 transitions, 678 flow [2022-01-19 00:38:40,193 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=678, PETRI_PLACES=261, PETRI_TRANSITIONS=274} [2022-01-19 00:38:40,195 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 12 predicate places. [2022-01-19 00:38:40,195 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 274 transitions, 678 flow [2022-01-19 00:38:40,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,196 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:40,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:40,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:38:40,197 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash 353464671, now seen corresponding path program 1 times [2022-01-19 00:38:40,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:40,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739001376] [2022-01-19 00:38:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:40,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:40,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:40,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739001376] [2022-01-19 00:38:40,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739001376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:40,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:40,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:40,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421834503] [2022-01-19 00:38:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:40,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:40,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:40,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:40,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:40,291 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 00:38:40,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 274 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:40,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 00:38:40,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:40,610 INFO L129 PetriNetUnfolder]: 327/2667 cut-off events. [2022-01-19 00:38:40,610 INFO L130 PetriNetUnfolder]: For 516/698 co-relation queries the response was YES. [2022-01-19 00:38:40,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 2667 events. 327/2667 cut-off events. For 516/698 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 26314 event pairs, 70 based on Foata normal form. 0/2404 useless extension candidates. Maximal degree in co-relation 3702. Up to 155 conditions per place. [2022-01-19 00:38:40,643 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 24 selfloop transitions, 4 changer transitions 0/282 dead transitions. [2022-01-19 00:38:40,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 282 transitions, 762 flow [2022-01-19 00:38:40,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-01-19 00:38:40,646 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.947242206235012 [2022-01-19 00:38:40,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2022-01-19 00:38:40,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2022-01-19 00:38:40,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:40,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2022-01-19 00:38:40,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,650 INFO L186 Difference]: Start difference. First operand has 261 places, 274 transitions, 678 flow. Second operand 3 states and 790 transitions. [2022-01-19 00:38:40,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 282 transitions, 762 flow [2022-01-19 00:38:40,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 282 transitions, 758 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:40,661 INFO L242 Difference]: Finished difference. Result has 261 places, 278 transitions, 722 flow [2022-01-19 00:38:40,661 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=261, PETRI_TRANSITIONS=278} [2022-01-19 00:38:40,662 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 12 predicate places. [2022-01-19 00:38:40,662 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 278 transitions, 722 flow [2022-01-19 00:38:40,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,663 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:40,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:40,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:38:40,664 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 541551261, now seen corresponding path program 1 times [2022-01-19 00:38:40,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134924977] [2022-01-19 00:38:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:40,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:40,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:40,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134924977] [2022-01-19 00:38:40,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134924977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:40,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:40,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:38:40,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963147660] [2022-01-19 00:38:40,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:40,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:38:40,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:38:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:38:40,797 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 00:38:40,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 278 transitions, 722 flow. Second operand has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:40,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:40,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 00:38:40,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:41,366 INFO L129 PetriNetUnfolder]: 723/3800 cut-off events. [2022-01-19 00:38:41,367 INFO L130 PetriNetUnfolder]: For 1877/2027 co-relation queries the response was YES. [2022-01-19 00:38:41,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6763 conditions, 3800 events. 723/3800 cut-off events. For 1877/2027 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 40871 event pairs, 307 based on Foata normal form. 49/3492 useless extension candidates. Maximal degree in co-relation 4511. Up to 1007 conditions per place. [2022-01-19 00:38:41,414 INFO L132 encePairwiseOnDemand]: 266/278 looper letters, 37 selfloop transitions, 15 changer transitions 7/308 dead transitions. [2022-01-19 00:38:41,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 308 transitions, 959 flow [2022-01-19 00:38:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:38:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:38:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2276 transitions. [2022-01-19 00:38:41,419 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9096722621902478 [2022-01-19 00:38:41,419 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2276 transitions. [2022-01-19 00:38:41,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2276 transitions. [2022-01-19 00:38:41,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:41,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2276 transitions. [2022-01-19 00:38:41,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 252.88888888888889) internal successors, (2276), 9 states have internal predecessors, (2276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:41,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:41,430 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:41,430 INFO L186 Difference]: Start difference. First operand has 261 places, 278 transitions, 722 flow. Second operand 9 states and 2276 transitions. [2022-01-19 00:38:41,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 308 transitions, 959 flow [2022-01-19 00:38:41,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 308 transitions, 947 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-01-19 00:38:41,439 INFO L242 Difference]: Finished difference. Result has 275 places, 290 transitions, 844 flow [2022-01-19 00:38:41,439 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=844, PETRI_PLACES=275, PETRI_TRANSITIONS=290} [2022-01-19 00:38:41,441 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 26 predicate places. [2022-01-19 00:38:41,442 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 290 transitions, 844 flow [2022-01-19 00:38:41,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:41,443 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:41,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:41,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:38:41,443 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:41,443 INFO L85 PathProgramCache]: Analyzing trace with hash 5342983, now seen corresponding path program 2 times [2022-01-19 00:38:41,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:41,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011955798] [2022-01-19 00:38:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:41,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:41,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:41,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011955798] [2022-01-19 00:38:41,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011955798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:41,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:41,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:38:41,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826217494] [2022-01-19 00:38:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:41,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:38:41,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:38:41,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:38:41,563 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 00:38:41,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 290 transitions, 844 flow. Second operand has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:41,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:41,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 00:38:41,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:42,165 INFO L129 PetriNetUnfolder]: 721/3951 cut-off events. [2022-01-19 00:38:42,165 INFO L130 PetriNetUnfolder]: For 5276/5394 co-relation queries the response was YES. [2022-01-19 00:38:42,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8407 conditions, 3951 events. 721/3951 cut-off events. For 5276/5394 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 43204 event pairs, 314 based on Foata normal form. 49/3634 useless extension candidates. Maximal degree in co-relation 8373. Up to 961 conditions per place. [2022-01-19 00:38:42,218 INFO L132 encePairwiseOnDemand]: 268/278 looper letters, 41 selfloop transitions, 9 changer transitions 15/314 dead transitions. [2022-01-19 00:38:42,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 314 transitions, 1139 flow [2022-01-19 00:38:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 00:38:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 00:38:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2521 transitions. [2022-01-19 00:38:42,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9068345323741007 [2022-01-19 00:38:42,224 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2521 transitions. [2022-01-19 00:38:42,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2521 transitions. [2022-01-19 00:38:42,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:42,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2521 transitions. [2022-01-19 00:38:42,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 252.1) internal successors, (2521), 10 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,235 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,235 INFO L186 Difference]: Start difference. First operand has 275 places, 290 transitions, 844 flow. Second operand 10 states and 2521 transitions. [2022-01-19 00:38:42,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 314 transitions, 1139 flow [2022-01-19 00:38:42,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 314 transitions, 1111 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:42,253 INFO L242 Difference]: Finished difference. Result has 283 places, 290 transitions, 844 flow [2022-01-19 00:38:42,253 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=844, PETRI_PLACES=283, PETRI_TRANSITIONS=290} [2022-01-19 00:38:42,254 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2022-01-19 00:38:42,254 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 290 transitions, 844 flow [2022-01-19 00:38:42,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,255 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:42,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:42,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 00:38:42,255 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash -478362955, now seen corresponding path program 1 times [2022-01-19 00:38:42,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:42,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972067807] [2022-01-19 00:38:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:42,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:42,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:42,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972067807] [2022-01-19 00:38:42,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972067807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:42,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:42,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:42,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936120664] [2022-01-19 00:38:42,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:42,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:42,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:42,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:42,291 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 00:38:42,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 290 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:42,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 00:38:42,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:42,597 INFO L129 PetriNetUnfolder]: 196/2433 cut-off events. [2022-01-19 00:38:42,597 INFO L130 PetriNetUnfolder]: For 1066/1271 co-relation queries the response was YES. [2022-01-19 00:38:42,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 2433 events. 196/2433 cut-off events. For 1066/1271 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 24124 event pairs, 55 based on Foata normal form. 2/2285 useless extension candidates. Maximal degree in co-relation 3854. Up to 127 conditions per place. [2022-01-19 00:38:42,626 INFO L132 encePairwiseOnDemand]: 274/278 looper letters, 19 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-01-19 00:38:42,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 297 transitions, 909 flow [2022-01-19 00:38:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 00:38:42,628 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 00:38:42,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 00:38:42,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 00:38:42,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:42,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 00:38:42,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,632 INFO L186 Difference]: Start difference. First operand has 283 places, 290 transitions, 844 flow. Second operand 3 states and 795 transitions. [2022-01-19 00:38:42,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 297 transitions, 909 flow [2022-01-19 00:38:42,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 297 transitions, 900 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-01-19 00:38:42,641 INFO L242 Difference]: Finished difference. Result has 281 places, 292 transitions, 859 flow [2022-01-19 00:38:42,642 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=281, PETRI_TRANSITIONS=292} [2022-01-19 00:38:42,642 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 32 predicate places. [2022-01-19 00:38:42,642 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 292 transitions, 859 flow [2022-01-19 00:38:42,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,643 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:42,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:42,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 00:38:42,643 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash 701178951, now seen corresponding path program 1 times [2022-01-19 00:38:42,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:42,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773487782] [2022-01-19 00:38:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:42,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:42,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:42,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773487782] [2022-01-19 00:38:42,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773487782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:42,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:42,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:38:42,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009611220] [2022-01-19 00:38:42,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:42,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:38:42,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:38:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:38:42,724 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 278 [2022-01-19 00:38:42,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 292 transitions, 859 flow. Second operand has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:42,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:42,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 278 [2022-01-19 00:38:42,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:43,356 INFO L129 PetriNetUnfolder]: 738/5704 cut-off events. [2022-01-19 00:38:43,356 INFO L130 PetriNetUnfolder]: For 4967/5505 co-relation queries the response was YES. [2022-01-19 00:38:43,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10634 conditions, 5704 events. 738/5704 cut-off events. For 4967/5505 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 70658 event pairs, 300 based on Foata normal form. 37/5409 useless extension candidates. Maximal degree in co-relation 9644. Up to 510 conditions per place. [2022-01-19 00:38:43,411 INFO L132 encePairwiseOnDemand]: 269/278 looper letters, 36 selfloop transitions, 9 changer transitions 43/344 dead transitions. [2022-01-19 00:38:43,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 344 transitions, 1352 flow [2022-01-19 00:38:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:38:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:38:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1774 transitions. [2022-01-19 00:38:43,418 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9116135662898253 [2022-01-19 00:38:43,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1774 transitions. [2022-01-19 00:38:43,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1774 transitions. [2022-01-19 00:38:43,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:43,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1774 transitions. [2022-01-19 00:38:43,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 253.42857142857142) internal successors, (1774), 7 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,426 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,426 INFO L186 Difference]: Start difference. First operand has 281 places, 292 transitions, 859 flow. Second operand 7 states and 1774 transitions. [2022-01-19 00:38:43,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 344 transitions, 1352 flow [2022-01-19 00:38:43,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 344 transitions, 1346 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 00:38:43,447 INFO L242 Difference]: Finished difference. Result has 291 places, 292 transitions, 893 flow [2022-01-19 00:38:43,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-01-19 00:38:43,449 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 42 predicate places. [2022-01-19 00:38:43,449 INFO L470 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 893 flow [2022-01-19 00:38:43,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 249.5) internal successors, (1996), 8 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:43,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:43,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 00:38:43,462 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash 828163827, now seen corresponding path program 2 times [2022-01-19 00:38:43,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:43,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598580917] [2022-01-19 00:38:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:43,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:43,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598580917] [2022-01-19 00:38:43,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598580917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:43,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:43,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:38:43,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965446298] [2022-01-19 00:38:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:43,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:38:43,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:38:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:38:43,535 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 278 [2022-01-19 00:38:43,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 893 flow. Second operand has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:43,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 278 [2022-01-19 00:38:43,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:43,823 INFO L129 PetriNetUnfolder]: 232/2187 cut-off events. [2022-01-19 00:38:43,823 INFO L130 PetriNetUnfolder]: For 1375/1604 co-relation queries the response was YES. [2022-01-19 00:38:43,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 2187 events. 232/2187 cut-off events. For 1375/1604 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22109 event pairs, 62 based on Foata normal form. 21/2057 useless extension candidates. Maximal degree in co-relation 3966. Up to 150 conditions per place. [2022-01-19 00:38:43,850 INFO L132 encePairwiseOnDemand]: 269/278 looper letters, 23 selfloop transitions, 11 changer transitions 4/303 dead transitions. [2022-01-19 00:38:43,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 303 transitions, 1009 flow [2022-01-19 00:38:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:38:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:38:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1791 transitions. [2022-01-19 00:38:43,854 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.920349434737924 [2022-01-19 00:38:43,854 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1791 transitions. [2022-01-19 00:38:43,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1791 transitions. [2022-01-19 00:38:43,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:43,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1791 transitions. [2022-01-19 00:38:43,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 255.85714285714286) internal successors, (1791), 7 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,861 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 278.0) internal successors, (2224), 8 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,861 INFO L186 Difference]: Start difference. First operand has 291 places, 292 transitions, 893 flow. Second operand 7 states and 1791 transitions. [2022-01-19 00:38:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 303 transitions, 1009 flow [2022-01-19 00:38:43,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 303 transitions, 969 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-01-19 00:38:43,873 INFO L242 Difference]: Finished difference. Result has 291 places, 292 transitions, 893 flow [2022-01-19 00:38:43,873 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=291, PETRI_TRANSITIONS=292} [2022-01-19 00:38:43,874 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 42 predicate places. [2022-01-19 00:38:43,874 INFO L470 AbstractCegarLoop]: Abstraction has has 291 places, 292 transitions, 893 flow [2022-01-19 00:38:43,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,875 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:43,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:43,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 00:38:43,875 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash -724671635, now seen corresponding path program 1 times [2022-01-19 00:38:43,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:43,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236971584] [2022-01-19 00:38:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:43,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:43,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:43,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236971584] [2022-01-19 00:38:43,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236971584] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:43,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:43,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:43,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821062749] [2022-01-19 00:38:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:43,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:43,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:43,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:43,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 00:38:43,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 292 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:43,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:43,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 00:38:43,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:44,384 INFO L129 PetriNetUnfolder]: 338/4472 cut-off events. [2022-01-19 00:38:44,384 INFO L130 PetriNetUnfolder]: For 2331/2676 co-relation queries the response was YES. [2022-01-19 00:38:44,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7369 conditions, 4472 events. 338/4472 cut-off events. For 2331/2676 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 53922 event pairs, 87 based on Foata normal form. 5/4186 useless extension candidates. Maximal degree in co-relation 7325. Up to 214 conditions per place. [2022-01-19 00:38:44,432 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 18 selfloop transitions, 3 changer transitions 1/300 dead transitions. [2022-01-19 00:38:44,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 300 transitions, 958 flow [2022-01-19 00:38:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 00:38:44,434 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 00:38:44,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 00:38:44,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 00:38:44,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:44,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 00:38:44,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,439 INFO L186 Difference]: Start difference. First operand has 291 places, 292 transitions, 893 flow. Second operand 3 states and 793 transitions. [2022-01-19 00:38:44,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 300 transitions, 958 flow [2022-01-19 00:38:44,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 300 transitions, 933 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-01-19 00:38:44,459 INFO L242 Difference]: Finished difference. Result has 287 places, 294 transitions, 894 flow [2022-01-19 00:38:44,460 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2022-01-19 00:38:44,461 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 38 predicate places. [2022-01-19 00:38:44,461 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 894 flow [2022-01-19 00:38:44,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:44,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:44,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 00:38:44,462 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash -613985965, now seen corresponding path program 2 times [2022-01-19 00:38:44,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:44,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201685520] [2022-01-19 00:38:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:44,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:44,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201685520] [2022-01-19 00:38:44,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201685520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:44,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:44,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:44,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511472522] [2022-01-19 00:38:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:44,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:44,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:44,495 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 00:38:44,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:44,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 00:38:44,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:44,836 INFO L129 PetriNetUnfolder]: 232/3236 cut-off events. [2022-01-19 00:38:44,836 INFO L130 PetriNetUnfolder]: For 1387/1555 co-relation queries the response was YES. [2022-01-19 00:38:44,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5170 conditions, 3236 events. 232/3236 cut-off events. For 1387/1555 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 36092 event pairs, 70 based on Foata normal form. 18/3056 useless extension candidates. Maximal degree in co-relation 4665. Up to 140 conditions per place. [2022-01-19 00:38:44,869 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 18 selfloop transitions, 5 changer transitions 2/302 dead transitions. [2022-01-19 00:38:44,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 302 transitions, 969 flow [2022-01-19 00:38:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 00:38:44,872 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 00:38:44,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 00:38:44,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 00:38:44,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:44,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 00:38:44,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,876 INFO L186 Difference]: Start difference. First operand has 287 places, 294 transitions, 894 flow. Second operand 3 states and 793 transitions. [2022-01-19 00:38:44,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 302 transitions, 969 flow [2022-01-19 00:38:44,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 302 transitions, 966 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:38:44,888 INFO L242 Difference]: Finished difference. Result has 290 places, 295 transitions, 924 flow [2022-01-19 00:38:44,888 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=924, PETRI_PLACES=290, PETRI_TRANSITIONS=295} [2022-01-19 00:38:44,888 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 41 predicate places. [2022-01-19 00:38:44,888 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 295 transitions, 924 flow [2022-01-19 00:38:44,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,889 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:44,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:44,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 00:38:44,889 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1342359111, now seen corresponding path program 1 times [2022-01-19 00:38:44,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:44,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029621416] [2022-01-19 00:38:44,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:44,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:44,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029621416] [2022-01-19 00:38:44,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029621416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:44,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:44,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:38:44,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120330551] [2022-01-19 00:38:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:44,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:38:44,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:38:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:38:44,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 278 [2022-01-19 00:38:44,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 295 transitions, 924 flow. Second operand has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:44,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:44,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 278 [2022-01-19 00:38:44,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:45,316 INFO L129 PetriNetUnfolder]: 280/3039 cut-off events. [2022-01-19 00:38:45,316 INFO L130 PetriNetUnfolder]: For 1529/1836 co-relation queries the response was YES. [2022-01-19 00:38:45,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5176 conditions, 3039 events. 280/3039 cut-off events. For 1529/1836 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 33785 event pairs, 122 based on Foata normal form. 11/2852 useless extension candidates. Maximal degree in co-relation 4642. Up to 347 conditions per place. [2022-01-19 00:38:45,348 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 30 selfloop transitions, 5 changer transitions 18/314 dead transitions. [2022-01-19 00:38:45,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 314 transitions, 1080 flow [2022-01-19 00:38:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:38:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:38:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2297 transitions. [2022-01-19 00:38:45,353 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9180655475619505 [2022-01-19 00:38:45,353 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2297 transitions. [2022-01-19 00:38:45,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2297 transitions. [2022-01-19 00:38:45,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:45,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2297 transitions. [2022-01-19 00:38:45,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 255.22222222222223) internal successors, (2297), 9 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,361 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,361 INFO L186 Difference]: Start difference. First operand has 290 places, 295 transitions, 924 flow. Second operand 9 states and 2297 transitions. [2022-01-19 00:38:45,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 314 transitions, 1080 flow [2022-01-19 00:38:45,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 314 transitions, 1062 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-01-19 00:38:45,373 INFO L242 Difference]: Finished difference. Result has 300 places, 290 transitions, 912 flow [2022-01-19 00:38:45,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=300, PETRI_TRANSITIONS=290} [2022-01-19 00:38:45,374 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 51 predicate places. [2022-01-19 00:38:45,374 INFO L470 AbstractCegarLoop]: Abstraction has has 300 places, 290 transitions, 912 flow [2022-01-19 00:38:45,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,375 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:45,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:45,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 00:38:45,375 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1200197174, now seen corresponding path program 1 times [2022-01-19 00:38:45,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:45,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567063544] [2022-01-19 00:38:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:45,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:45,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:45,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567063544] [2022-01-19 00:38:45,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567063544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:45,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:45,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:38:45,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531180368] [2022-01-19 00:38:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:45,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:38:45,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:45,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:38:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:38:45,454 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 278 [2022-01-19 00:38:45,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 290 transitions, 912 flow. Second operand has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:45,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 278 [2022-01-19 00:38:45,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:45,789 INFO L129 PetriNetUnfolder]: 164/2472 cut-off events. [2022-01-19 00:38:45,789 INFO L130 PetriNetUnfolder]: For 1117/1286 co-relation queries the response was YES. [2022-01-19 00:38:45,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 2472 events. 164/2472 cut-off events. For 1117/1286 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 26376 event pairs, 28 based on Foata normal form. 10/2325 useless extension candidates. Maximal degree in co-relation 3901. Up to 138 conditions per place. [2022-01-19 00:38:45,816 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 16 selfloop transitions, 1 changer transitions 20/310 dead transitions. [2022-01-19 00:38:45,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 310 transitions, 1063 flow [2022-01-19 00:38:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:38:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:38:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2297 transitions. [2022-01-19 00:38:45,821 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9180655475619505 [2022-01-19 00:38:45,821 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2297 transitions. [2022-01-19 00:38:45,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2297 transitions. [2022-01-19 00:38:45,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:45,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2297 transitions. [2022-01-19 00:38:45,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 255.22222222222223) internal successors, (2297), 9 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,830 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 278.0) internal successors, (2780), 10 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,830 INFO L186 Difference]: Start difference. First operand has 300 places, 290 transitions, 912 flow. Second operand 9 states and 2297 transitions. [2022-01-19 00:38:45,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 310 transitions, 1063 flow [2022-01-19 00:38:45,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 310 transitions, 1038 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-01-19 00:38:45,841 INFO L242 Difference]: Finished difference. Result has 308 places, 290 transitions, 910 flow [2022-01-19 00:38:45,842 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=308, PETRI_TRANSITIONS=290} [2022-01-19 00:38:45,843 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 59 predicate places. [2022-01-19 00:38:45,843 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 290 transitions, 910 flow [2022-01-19 00:38:45,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.28571428571428) internal successors, (1773), 7 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,844 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:45,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:45,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:38:45,844 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash 844666116, now seen corresponding path program 1 times [2022-01-19 00:38:45,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:45,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895216723] [2022-01-19 00:38:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:45,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:45,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:45,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895216723] [2022-01-19 00:38:45,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895216723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:45,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:45,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:38:45,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010607231] [2022-01-19 00:38:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:45,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:38:45,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:45,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:38:45,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:38:45,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 278 [2022-01-19 00:38:45,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 290 transitions, 910 flow. Second operand has 9 states, 9 states have (on average 243.66666666666666) internal successors, (2193), 9 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:45,961 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:45,961 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 278 [2022-01-19 00:38:45,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:46,472 INFO L129 PetriNetUnfolder]: 597/3623 cut-off events. [2022-01-19 00:38:46,472 INFO L130 PetriNetUnfolder]: For 5474/5738 co-relation queries the response was YES. [2022-01-19 00:38:46,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7965 conditions, 3623 events. 597/3623 cut-off events. For 5474/5738 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 40601 event pairs, 316 based on Foata normal form. 22/3377 useless extension candidates. Maximal degree in co-relation 7930. Up to 839 conditions per place. [2022-01-19 00:38:46,516 INFO L132 encePairwiseOnDemand]: 262/278 looper letters, 67 selfloop transitions, 25 changer transitions 16/355 dead transitions. [2022-01-19 00:38:46,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 355 transitions, 1579 flow [2022-01-19 00:38:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 00:38:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 00:38:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3215 transitions. [2022-01-19 00:38:46,523 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8895960154952961 [2022-01-19 00:38:46,523 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3215 transitions. [2022-01-19 00:38:46,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3215 transitions. [2022-01-19 00:38:46,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:46,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3215 transitions. [2022-01-19 00:38:46,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 247.30769230769232) internal successors, (3215), 13 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:46,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:46,535 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:46,535 INFO L186 Difference]: Start difference. First operand has 308 places, 290 transitions, 910 flow. Second operand 13 states and 3215 transitions. [2022-01-19 00:38:46,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 355 transitions, 1579 flow [2022-01-19 00:38:46,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 355 transitions, 1523 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-01-19 00:38:46,554 INFO L242 Difference]: Finished difference. Result has 317 places, 312 transitions, 1203 flow [2022-01-19 00:38:46,554 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1203, PETRI_PLACES=317, PETRI_TRANSITIONS=312} [2022-01-19 00:38:46,555 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 68 predicate places. [2022-01-19 00:38:46,555 INFO L470 AbstractCegarLoop]: Abstraction has has 317 places, 312 transitions, 1203 flow [2022-01-19 00:38:46,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 243.66666666666666) internal successors, (2193), 9 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:46,556 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:46,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:46,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:38:46,556 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1973413174, now seen corresponding path program 2 times [2022-01-19 00:38:46,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:46,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467095566] [2022-01-19 00:38:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:46,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:46,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467095566] [2022-01-19 00:38:46,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467095566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:46,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:46,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:38:46,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689820278] [2022-01-19 00:38:46,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:46,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:38:46,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:46,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:38:46,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:38:46,655 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 278 [2022-01-19 00:38:46,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 312 transitions, 1203 flow. Second operand has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:46,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:46,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 278 [2022-01-19 00:38:46,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:47,218 INFO L129 PetriNetUnfolder]: 565/3254 cut-off events. [2022-01-19 00:38:47,218 INFO L130 PetriNetUnfolder]: For 17871/18379 co-relation queries the response was YES. [2022-01-19 00:38:47,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9365 conditions, 3254 events. 565/3254 cut-off events. For 17871/18379 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 35451 event pairs, 154 based on Foata normal form. 78/3106 useless extension candidates. Maximal degree in co-relation 9323. Up to 544 conditions per place. [2022-01-19 00:38:47,258 INFO L132 encePairwiseOnDemand]: 264/278 looper letters, 71 selfloop transitions, 20 changer transitions 4/342 dead transitions. [2022-01-19 00:38:47,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 342 transitions, 1751 flow [2022-01-19 00:38:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 00:38:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 00:38:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2472 transitions. [2022-01-19 00:38:47,266 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8892086330935252 [2022-01-19 00:38:47,266 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2472 transitions. [2022-01-19 00:38:47,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2472 transitions. [2022-01-19 00:38:47,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:47,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2472 transitions. [2022-01-19 00:38:47,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 247.2) internal successors, (2472), 10 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,279 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 278.0) internal successors, (3058), 11 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,279 INFO L186 Difference]: Start difference. First operand has 317 places, 312 transitions, 1203 flow. Second operand 10 states and 2472 transitions. [2022-01-19 00:38:47,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 342 transitions, 1751 flow [2022-01-19 00:38:47,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 342 transitions, 1645 flow, removed 53 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:47,318 INFO L242 Difference]: Finished difference. Result has 325 places, 312 transitions, 1155 flow [2022-01-19 00:38:47,319 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1155, PETRI_PLACES=325, PETRI_TRANSITIONS=312} [2022-01-19 00:38:47,320 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 76 predicate places. [2022-01-19 00:38:47,320 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 312 transitions, 1155 flow [2022-01-19 00:38:47,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,320 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:47,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:47,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:38:47,321 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash -575243458, now seen corresponding path program 1 times [2022-01-19 00:38:47,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:47,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698656202] [2022-01-19 00:38:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:47,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:47,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:47,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698656202] [2022-01-19 00:38:47,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698656202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:47,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:47,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:47,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292407258] [2022-01-19 00:38:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:47,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:47,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:47,364 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 00:38:47,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 312 transitions, 1155 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:47,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 00:38:47,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:47,842 INFO L129 PetriNetUnfolder]: 348/4048 cut-off events. [2022-01-19 00:38:47,842 INFO L130 PetriNetUnfolder]: For 6121/6527 co-relation queries the response was YES. [2022-01-19 00:38:47,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7956 conditions, 4048 events. 348/4048 cut-off events. For 6121/6527 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 46710 event pairs, 86 based on Foata normal form. 5/3797 useless extension candidates. Maximal degree in co-relation 7909. Up to 233 conditions per place. [2022-01-19 00:38:47,899 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 20 selfloop transitions, 4 changer transitions 0/320 dead transitions. [2022-01-19 00:38:47,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 320 transitions, 1223 flow [2022-01-19 00:38:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-01-19 00:38:47,902 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.947242206235012 [2022-01-19 00:38:47,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2022-01-19 00:38:47,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2022-01-19 00:38:47,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:47,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2022-01-19 00:38:47,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,906 INFO L186 Difference]: Start difference. First operand has 325 places, 312 transitions, 1155 flow. Second operand 3 states and 790 transitions. [2022-01-19 00:38:47,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 320 transitions, 1223 flow [2022-01-19 00:38:47,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 320 transitions, 1176 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-01-19 00:38:47,936 INFO L242 Difference]: Finished difference. Result has 318 places, 316 transitions, 1148 flow [2022-01-19 00:38:47,936 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2022-01-19 00:38:47,937 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 69 predicate places. [2022-01-19 00:38:47,937 INFO L470 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 1148 flow [2022-01-19 00:38:47,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,939 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:47,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:47,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:38:47,940 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1127052730, now seen corresponding path program 2 times [2022-01-19 00:38:47,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:47,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496907818] [2022-01-19 00:38:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:47,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:47,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:47,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496907818] [2022-01-19 00:38:47,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496907818] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:47,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:47,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:47,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236647599] [2022-01-19 00:38:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:47,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:47,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:47,974 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 278 [2022-01-19 00:38:47,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:47,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:47,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 278 [2022-01-19 00:38:47,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:48,326 INFO L129 PetriNetUnfolder]: 262/3245 cut-off events. [2022-01-19 00:38:48,326 INFO L130 PetriNetUnfolder]: For 4746/5159 co-relation queries the response was YES. [2022-01-19 00:38:48,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6195 conditions, 3245 events. 262/3245 cut-off events. For 4746/5159 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 35990 event pairs, 80 based on Foata normal form. 43/3130 useless extension candidates. Maximal degree in co-relation 6095. Up to 164 conditions per place. [2022-01-19 00:38:48,348 INFO L132 encePairwiseOnDemand]: 268/278 looper letters, 22 selfloop transitions, 6 changer transitions 0/324 dead transitions. [2022-01-19 00:38:48,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 324 transitions, 1232 flow [2022-01-19 00:38:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-01-19 00:38:48,350 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.947242206235012 [2022-01-19 00:38:48,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2022-01-19 00:38:48,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2022-01-19 00:38:48,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:48,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2022-01-19 00:38:48,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,353 INFO L186 Difference]: Start difference. First operand has 318 places, 316 transitions, 1148 flow. Second operand 3 states and 790 transitions. [2022-01-19 00:38:48,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 324 transitions, 1232 flow [2022-01-19 00:38:48,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 324 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:38:48,372 INFO L242 Difference]: Finished difference. Result has 321 places, 320 transitions, 1200 flow [2022-01-19 00:38:48,372 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=321, PETRI_TRANSITIONS=320} [2022-01-19 00:38:48,373 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 72 predicate places. [2022-01-19 00:38:48,373 INFO L470 AbstractCegarLoop]: Abstraction has has 321 places, 320 transitions, 1200 flow [2022-01-19 00:38:48,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,373 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:48,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:48,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:38:48,373 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1154758708, now seen corresponding path program 1 times [2022-01-19 00:38:48,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:48,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063767068] [2022-01-19 00:38:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:48,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:48,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:48,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063767068] [2022-01-19 00:38:48,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063767068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:48,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:48,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:48,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429157623] [2022-01-19 00:38:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:48,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:48,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:48,401 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 00:38:48,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 320 transitions, 1200 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:48,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 00:38:48,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:48,903 INFO L129 PetriNetUnfolder]: 372/4984 cut-off events. [2022-01-19 00:38:48,903 INFO L130 PetriNetUnfolder]: For 10463/11776 co-relation queries the response was YES. [2022-01-19 00:38:48,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10074 conditions, 4984 events. 372/4984 cut-off events. For 10463/11776 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 60439 event pairs, 67 based on Foata normal form. 9/4742 useless extension candidates. Maximal degree in co-relation 9906. Up to 364 conditions per place. [2022-01-19 00:38:48,972 INFO L132 encePairwiseOnDemand]: 274/278 looper letters, 17 selfloop transitions, 2 changer transitions 4/327 dead transitions. [2022-01-19 00:38:48,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 327 transitions, 1257 flow [2022-01-19 00:38:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 00:38:48,974 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 00:38:48,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 00:38:48,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 00:38:48,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:48,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 00:38:48,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:48,978 INFO L186 Difference]: Start difference. First operand has 321 places, 320 transitions, 1200 flow. Second operand 3 states and 795 transitions. [2022-01-19 00:38:48,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 327 transitions, 1257 flow [2022-01-19 00:38:49,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 327 transitions, 1237 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:49,009 INFO L242 Difference]: Finished difference. Result has 323 places, 318 transitions, 1181 flow [2022-01-19 00:38:49,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=323, PETRI_TRANSITIONS=318} [2022-01-19 00:38:49,010 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 74 predicate places. [2022-01-19 00:38:49,010 INFO L470 AbstractCegarLoop]: Abstraction has has 323 places, 318 transitions, 1181 flow [2022-01-19 00:38:49,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:49,010 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:49,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:49,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:38:49,011 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash -422431016, now seen corresponding path program 2 times [2022-01-19 00:38:49,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:49,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606712440] [2022-01-19 00:38:49,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:49,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:49,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:49,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606712440] [2022-01-19 00:38:49,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606712440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:49,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:49,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:49,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48835084] [2022-01-19 00:38:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:49,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:49,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:49,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:49,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:49,044 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 278 [2022-01-19 00:38:49,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 318 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:49,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:49,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 278 [2022-01-19 00:38:49,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:49,574 INFO L129 PetriNetUnfolder]: 279/4841 cut-off events. [2022-01-19 00:38:49,574 INFO L130 PetriNetUnfolder]: For 8640/9448 co-relation queries the response was YES. [2022-01-19 00:38:49,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9175 conditions, 4841 events. 279/4841 cut-off events. For 8640/9448 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 57719 event pairs, 88 based on Foata normal form. 23/4644 useless extension candidates. Maximal degree in co-relation 9006. Up to 372 conditions per place. [2022-01-19 00:38:49,617 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 17 selfloop transitions, 4 changer transitions 0/325 dead transitions. [2022-01-19 00:38:49,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 325 transitions, 1246 flow [2022-01-19 00:38:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2022-01-19 00:38:49,619 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9532374100719424 [2022-01-19 00:38:49,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 795 transitions. [2022-01-19 00:38:49,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 795 transitions. [2022-01-19 00:38:49,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:49,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 795 transitions. [2022-01-19 00:38:49,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:49,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:49,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:49,622 INFO L186 Difference]: Start difference. First operand has 323 places, 318 transitions, 1181 flow. Second operand 3 states and 795 transitions. [2022-01-19 00:38:49,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 325 transitions, 1246 flow [2022-01-19 00:38:49,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 325 transitions, 1242 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:49,645 INFO L242 Difference]: Finished difference. Result has 323 places, 320 transitions, 1209 flow [2022-01-19 00:38:49,645 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1209, PETRI_PLACES=323, PETRI_TRANSITIONS=320} [2022-01-19 00:38:49,646 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 74 predicate places. [2022-01-19 00:38:49,646 INFO L470 AbstractCegarLoop]: Abstraction has has 323 places, 320 transitions, 1209 flow [2022-01-19 00:38:49,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:49,646 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:49,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:49,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:38:49,647 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:49,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:49,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1002671030, now seen corresponding path program 1 times [2022-01-19 00:38:49,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:49,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47519263] [2022-01-19 00:38:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:49,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:49,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:49,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47519263] [2022-01-19 00:38:49,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47519263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:49,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:49,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:49,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76584437] [2022-01-19 00:38:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:49,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:49,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:49,678 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 00:38:49,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 320 transitions, 1209 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:49,679 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:49,679 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 00:38:49,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:50,372 INFO L129 PetriNetUnfolder]: 427/7268 cut-off events. [2022-01-19 00:38:50,373 INFO L130 PetriNetUnfolder]: For 13900/15894 co-relation queries the response was YES. [2022-01-19 00:38:50,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14303 conditions, 7268 events. 427/7268 cut-off events. For 13900/15894 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 94747 event pairs, 129 based on Foata normal form. 10/6931 useless extension candidates. Maximal degree in co-relation 14030. Up to 454 conditions per place. [2022-01-19 00:38:50,442 INFO L132 encePairwiseOnDemand]: 272/278 looper letters, 19 selfloop transitions, 3 changer transitions 0/328 dead transitions. [2022-01-19 00:38:50,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 328 transitions, 1274 flow [2022-01-19 00:38:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 00:38:50,443 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 00:38:50,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 00:38:50,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 00:38:50,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:50,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 00:38:50,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:50,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:50,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:50,446 INFO L186 Difference]: Start difference. First operand has 323 places, 320 transitions, 1209 flow. Second operand 3 states and 793 transitions. [2022-01-19 00:38:50,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 328 transitions, 1274 flow [2022-01-19 00:38:50,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 328 transitions, 1262 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:50,484 INFO L242 Difference]: Finished difference. Result has 325 places, 323 transitions, 1227 flow [2022-01-19 00:38:50,484 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=325, PETRI_TRANSITIONS=323} [2022-01-19 00:38:50,484 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 76 predicate places. [2022-01-19 00:38:50,485 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 323 transitions, 1227 flow [2022-01-19 00:38:50,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:50,485 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:50,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:50,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:38:50,485 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash -470959612, now seen corresponding path program 1 times [2022-01-19 00:38:50,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:50,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105258429] [2022-01-19 00:38:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:50,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:50,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:50,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105258429] [2022-01-19 00:38:50,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105258429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:50,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:50,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:38:50,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361533863] [2022-01-19 00:38:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:50,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:38:50,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:38:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:38:50,517 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 278 [2022-01-19 00:38:50,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 323 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:50,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:50,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 278 [2022-01-19 00:38:50,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:51,243 INFO L129 PetriNetUnfolder]: 329/6447 cut-off events. [2022-01-19 00:38:51,244 INFO L130 PetriNetUnfolder]: For 10943/12277 co-relation queries the response was YES. [2022-01-19 00:38:51,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12440 conditions, 6447 events. 329/6447 cut-off events. For 10943/12277 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 82319 event pairs, 119 based on Foata normal form. 23/6185 useless extension candidates. Maximal degree in co-relation 12182. Up to 428 conditions per place. [2022-01-19 00:38:51,293 INFO L132 encePairwiseOnDemand]: 270/278 looper letters, 20 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2022-01-19 00:38:51,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 331 transitions, 1304 flow [2022-01-19 00:38:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:38:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:38:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2022-01-19 00:38:51,294 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9508393285371702 [2022-01-19 00:38:51,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2022-01-19 00:38:51,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2022-01-19 00:38:51,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:51,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2022-01-19 00:38:51,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:51,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:51,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:51,298 INFO L186 Difference]: Start difference. First operand has 325 places, 323 transitions, 1227 flow. Second operand 3 states and 793 transitions. [2022-01-19 00:38:51,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 331 transitions, 1304 flow [2022-01-19 00:38:51,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 331 transitions, 1301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:38:51,333 INFO L242 Difference]: Finished difference. Result has 328 places, 326 transitions, 1268 flow [2022-01-19 00:38:51,334 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1268, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-01-19 00:38:51,334 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 79 predicate places. [2022-01-19 00:38:51,334 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 1268 flow [2022-01-19 00:38:51,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:51,335 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:51,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:51,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 00:38:51,335 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash -800047842, now seen corresponding path program 1 times [2022-01-19 00:38:51,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:51,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462398120] [2022-01-19 00:38:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:51,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:51,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:51,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462398120] [2022-01-19 00:38:51,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462398120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:51,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:51,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:38:51,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481867518] [2022-01-19 00:38:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:51,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:38:51,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:38:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:38:51,423 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 278 [2022-01-19 00:38:51,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 1268 flow. Second operand has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:51,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:51,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 278 [2022-01-19 00:38:51,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:52,312 INFO L129 PetriNetUnfolder]: 774/6182 cut-off events. [2022-01-19 00:38:52,313 INFO L130 PetriNetUnfolder]: For 11624/13682 co-relation queries the response was YES. [2022-01-19 00:38:52,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13710 conditions, 6182 events. 774/6182 cut-off events. For 11624/13682 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 77759 event pairs, 516 based on Foata normal form. 23/5689 useless extension candidates. Maximal degree in co-relation 13279. Up to 1997 conditions per place. [2022-01-19 00:38:52,386 INFO L132 encePairwiseOnDemand]: 266/278 looper letters, 39 selfloop transitions, 9 changer transitions 40/356 dead transitions. [2022-01-19 00:38:52,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 356 transitions, 1505 flow [2022-01-19 00:38:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 00:38:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 00:38:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3240 transitions. [2022-01-19 00:38:52,397 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.896513558384062 [2022-01-19 00:38:52,397 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3240 transitions. [2022-01-19 00:38:52,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3240 transitions. [2022-01-19 00:38:52,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:52,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3240 transitions. [2022-01-19 00:38:52,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 249.23076923076923) internal successors, (3240), 13 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:52,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:52,407 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 278.0) internal successors, (3892), 14 states have internal predecessors, (3892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:52,407 INFO L186 Difference]: Start difference. First operand has 328 places, 326 transitions, 1268 flow. Second operand 13 states and 3240 transitions. [2022-01-19 00:38:52,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 356 transitions, 1505 flow [2022-01-19 00:38:52,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 356 transitions, 1489 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 00:38:52,442 INFO L242 Difference]: Finished difference. Result has 349 places, 307 transitions, 1167 flow [2022-01-19 00:38:52,442 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1167, PETRI_PLACES=349, PETRI_TRANSITIONS=307} [2022-01-19 00:38:52,442 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 100 predicate places. [2022-01-19 00:38:52,442 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 307 transitions, 1167 flow [2022-01-19 00:38:52,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:52,443 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:52,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:52,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 00:38:52,443 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash -329941492, now seen corresponding path program 1 times [2022-01-19 00:38:52,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:52,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689782788] [2022-01-19 00:38:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:52,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:52,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:52,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689782788] [2022-01-19 00:38:52,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689782788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:52,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:52,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:38:52,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582664891] [2022-01-19 00:38:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:52,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:38:52,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:52,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:38:52,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:38:52,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 278 [2022-01-19 00:38:52,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 307 transitions, 1167 flow. Second operand has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:52,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:52,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 278 [2022-01-19 00:38:52,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:53,383 INFO L129 PetriNetUnfolder]: 600/6425 cut-off events. [2022-01-19 00:38:53,383 INFO L130 PetriNetUnfolder]: For 13589/15867 co-relation queries the response was YES. [2022-01-19 00:38:53,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14788 conditions, 6425 events. 600/6425 cut-off events. For 13589/15867 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 81144 event pairs, 318 based on Foata normal form. 27/6076 useless extension candidates. Maximal degree in co-relation 14736. Up to 782 conditions per place. [2022-01-19 00:38:53,451 INFO L132 encePairwiseOnDemand]: 265/278 looper letters, 51 selfloop transitions, 14 changer transitions 18/348 dead transitions. [2022-01-19 00:38:53,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 348 transitions, 1484 flow [2022-01-19 00:38:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:38:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:38:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4235 transitions. [2022-01-19 00:38:53,456 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8961066440964875 [2022-01-19 00:38:53,456 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4235 transitions. [2022-01-19 00:38:53,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4235 transitions. [2022-01-19 00:38:53,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:53,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4235 transitions. [2022-01-19 00:38:53,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 249.11764705882354) internal successors, (4235), 17 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:53,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 278.0) internal successors, (5004), 18 states have internal predecessors, (5004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:53,468 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 278.0) internal successors, (5004), 18 states have internal predecessors, (5004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:53,468 INFO L186 Difference]: Start difference. First operand has 349 places, 307 transitions, 1167 flow. Second operand 17 states and 4235 transitions. [2022-01-19 00:38:53,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 348 transitions, 1484 flow [2022-01-19 00:38:53,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 348 transitions, 1429 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-01-19 00:38:53,556 INFO L242 Difference]: Finished difference. Result has 348 places, 315 transitions, 1227 flow [2022-01-19 00:38:53,557 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1227, PETRI_PLACES=348, PETRI_TRANSITIONS=315} [2022-01-19 00:38:53,557 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 99 predicate places. [2022-01-19 00:38:53,557 INFO L470 AbstractCegarLoop]: Abstraction has has 348 places, 315 transitions, 1227 flow [2022-01-19 00:38:53,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:53,558 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:53,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:53,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:38:53,558 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1961496104, now seen corresponding path program 1 times [2022-01-19 00:38:53,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:53,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146372741] [2022-01-19 00:38:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:53,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:53,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146372741] [2022-01-19 00:38:53,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146372741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:53,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:53,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:38:53,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622032293] [2022-01-19 00:38:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:53,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:38:53,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:38:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:38:53,646 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 278 [2022-01-19 00:38:53,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 315 transitions, 1227 flow. Second operand has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:53,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:53,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 278 [2022-01-19 00:38:53,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:38:54,773 INFO L129 PetriNetUnfolder]: 1204/8429 cut-off events. [2022-01-19 00:38:54,773 INFO L130 PetriNetUnfolder]: For 39462/42870 co-relation queries the response was YES. [2022-01-19 00:38:54,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22450 conditions, 8429 events. 1204/8429 cut-off events. For 39462/42870 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 108385 event pairs, 779 based on Foata normal form. 174/8043 useless extension candidates. Maximal degree in co-relation 22394. Up to 1639 conditions per place. [2022-01-19 00:38:54,852 INFO L132 encePairwiseOnDemand]: 264/278 looper letters, 36 selfloop transitions, 3 changer transitions 114/428 dead transitions. [2022-01-19 00:38:54,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 428 transitions, 2384 flow [2022-01-19 00:38:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:38:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:38:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3451 transitions. [2022-01-19 00:38:54,855 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8866906474820144 [2022-01-19 00:38:54,856 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3451 transitions. [2022-01-19 00:38:54,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3451 transitions. [2022-01-19 00:38:54,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:38:54,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3451 transitions. [2022-01-19 00:38:54,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 246.5) internal successors, (3451), 14 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:54,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 278.0) internal successors, (4170), 15 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:54,864 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 278.0) internal successors, (4170), 15 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:54,864 INFO L186 Difference]: Start difference. First operand has 348 places, 315 transitions, 1227 flow. Second operand 14 states and 3451 transitions. [2022-01-19 00:38:54,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 428 transitions, 2384 flow [2022-01-19 00:38:54,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 428 transitions, 2325 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-01-19 00:38:54,948 INFO L242 Difference]: Finished difference. Result has 362 places, 314 transitions, 1215 flow [2022-01-19 00:38:54,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1215, PETRI_PLACES=362, PETRI_TRANSITIONS=314} [2022-01-19 00:38:54,949 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 113 predicate places. [2022-01-19 00:38:54,949 INFO L470 AbstractCegarLoop]: Abstraction has has 362 places, 314 transitions, 1215 flow [2022-01-19 00:38:54,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.4) internal successors, (2434), 10 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:54,950 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:38:54,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:38:54,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:38:54,950 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:38:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:38:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -66196892, now seen corresponding path program 1 times [2022-01-19 00:38:54,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:38:54,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402631079] [2022-01-19 00:38:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:38:54,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:38:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:38:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:38:55,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:38:55,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402631079] [2022-01-19 00:38:55,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402631079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:38:55,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:38:55,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-19 00:38:55,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396064485] [2022-01-19 00:38:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:38:55,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 00:38:55,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:38:55,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 00:38:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 00:38:55,481 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 278 [2022-01-19 00:38:55,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 314 transitions, 1215 flow. Second operand has 34 states, 34 states have (on average 180.3235294117647) internal successors, (6131), 34 states have internal predecessors, (6131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:38:55,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:38:55,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 278 [2022-01-19 00:38:55,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:39:46,319 INFO L129 PetriNetUnfolder]: 60880/129721 cut-off events. [2022-01-19 00:39:46,320 INFO L130 PetriNetUnfolder]: For 327604/328584 co-relation queries the response was YES. [2022-01-19 00:39:48,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360643 conditions, 129721 events. 60880/129721 cut-off events. For 327604/328584 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 1472333 event pairs, 23105 based on Foata normal form. 508/126545 useless extension candidates. Maximal degree in co-relation 360579. Up to 41710 conditions per place. [2022-01-19 00:39:48,839 INFO L132 encePairwiseOnDemand]: 230/278 looper letters, 1430 selfloop transitions, 293 changer transitions 827/2735 dead transitions. [2022-01-19 00:39:48,839 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 2735 transitions, 18821 flow [2022-01-19 00:39:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 369 states. [2022-01-19 00:39:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2022-01-19 00:39:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 68120 transitions. [2022-01-19 00:39:48,889 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.664054122555614 [2022-01-19 00:39:48,889 INFO L72 ComplementDD]: Start complementDD. Operand 369 states and 68120 transitions. [2022-01-19 00:39:48,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 68120 transitions. [2022-01-19 00:39:48,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:39:48,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 369 states and 68120 transitions. [2022-01-19 00:39:48,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 370 states, 369 states have (on average 184.6070460704607) internal successors, (68120), 369 states have internal predecessors, (68120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:39:49,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 370 states, 370 states have (on average 278.0) internal successors, (102860), 370 states have internal predecessors, (102860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:39:49,106 INFO L81 ComplementDD]: Finished complementDD. Result has 370 states, 370 states have (on average 278.0) internal successors, (102860), 370 states have internal predecessors, (102860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:39:49,107 INFO L186 Difference]: Start difference. First operand has 362 places, 314 transitions, 1215 flow. Second operand 369 states and 68120 transitions. [2022-01-19 00:39:49,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 2735 transitions, 18821 flow [2022-01-19 00:39:53,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 2735 transitions, 16804 flow, removed 1006 selfloop flow, removed 12 redundant places. [2022-01-19 00:39:53,951 INFO L242 Difference]: Finished difference. Result has 1065 places, 631 transitions, 4821 flow [2022-01-19 00:39:53,952 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=369, PETRI_FLOW=4821, PETRI_PLACES=1065, PETRI_TRANSITIONS=631} [2022-01-19 00:39:53,952 INFO L334 CegarLoopForPetriNet]: 249 programPoint places, 816 predicate places. [2022-01-19 00:39:53,952 INFO L470 AbstractCegarLoop]: Abstraction has has 1065 places, 631 transitions, 4821 flow [2022-01-19 00:39:53,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 180.3235294117647) internal successors, (6131), 34 states have internal predecessors, (6131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:39:53,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:39:53,953 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:39:53,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:39:53,954 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:39:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:39:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1582952148, now seen corresponding path program 2 times [2022-01-19 00:39:53,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:39:53,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946028870] [2022-01-19 00:39:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:39:53,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:39:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:39:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:39:54,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:39:54,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946028870] [2022-01-19 00:39:54,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946028870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:39:54,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:39:54,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-01-19 00:39:54,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540800864] [2022-01-19 00:39:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:39:54,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 00:39:54,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:39:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 00:39:54,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-01-19 00:39:54,489 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 278 [2022-01-19 00:39:54,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1065 places, 631 transitions, 4821 flow. Second operand has 34 states, 34 states have (on average 180.3235294117647) internal successors, (6131), 34 states have internal predecessors, (6131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:39:54,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:39:54,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 278 [2022-01-19 00:39:54,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand