/usr/bin/java -Xmx8000000000 -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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:20:16,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:20:16,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:20:16,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:20:16,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:20:16,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:20:16,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:20:16,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:20:16,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:20:16,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:20:16,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:20:16,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:20:16,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:20:16,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:20:16,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:20:16,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:20:16,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:20:16,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:20:16,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:20:16,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:20:16,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:20:16,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:20:16,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:20:16,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:20:16,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:20:16,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:20:16,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:20:16,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:20:16,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:20:16,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:20:16,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:20:16,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:20:16,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:20:16,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:20:16,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:20:16,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:20:16,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:20:16,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:20:16,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:20:16,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:20:16,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:20:16,797 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-12-06 17:20:16,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:20:16,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:20:16,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:20:16,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:20:16,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:20:16,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:20:16,821 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:20:16,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:20:16,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:20:16,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:20:16,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:20:16,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:20:16,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:20:16,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:20:16,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:20:16,822 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:20:16,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:20:16,822 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:20:16,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:20:16,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:20:16,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:20:16,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:20:16,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:20:16,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:20:16,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:20:16,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:20:16,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:20:16,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:20:16,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:20:16,829 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:20:16,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:20:16,829 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 17:20:17,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:20:17,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:20:17,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:20:17,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:20:17,153 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:20:17,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2022-12-06 17:20:18,228 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:20:18,459 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:20:18,459 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2022-12-06 17:20:18,473 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a809e86d3/67dca7518ebe4c1a898ddf0b2c957512/FLAGcb20c65d4 [2022-12-06 17:20:18,484 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a809e86d3/67dca7518ebe4c1a898ddf0b2c957512 [2022-12-06 17:20:18,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:20:18,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:20:18,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:20:18,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:20:18,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:20:18,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e648b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18, skipping insertion in model container [2022-12-06 17:20:18,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:20:18,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:20:18,636 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-12-06 17:20:18,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:20:18,651 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:20:18,687 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-12-06 17:20:18,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:20:18,704 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:20:18,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18 WrapperNode [2022-12-06 17:20:18,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:20:18,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:20:18,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:20:18,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:20:18,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,760 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 163 [2022-12-06 17:20:18,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:20:18,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:20:18,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:20:18,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:20:18,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:20:18,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:20:18,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:20:18,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:20:18,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (1/1) ... [2022-12-06 17:20:18,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:20:18,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:20:18,832 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-12-06 17:20:18,856 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-12-06 17:20:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:20:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:20:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:20:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:20:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:20:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 17:20:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 17:20:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:20:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:20:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:20:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:20:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:20:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:20:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:20:18,879 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:20:19,040 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:20:19,042 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:20:19,383 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:20:19,391 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:20:19,391 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 17:20:19,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:20:19 BoogieIcfgContainer [2022-12-06 17:20:19,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:20:19,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:20:19,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:20:19,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:20:19,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:20:18" (1/3) ... [2022-12-06 17:20:19,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724f91c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:20:19, skipping insertion in model container [2022-12-06 17:20:19,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:20:18" (2/3) ... [2022-12-06 17:20:19,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724f91c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:20:19, skipping insertion in model container [2022-12-06 17:20:19,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:20:19" (3/3) ... [2022-12-06 17:20:19,414 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2022-12-06 17:20:19,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:20:19,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:20:19,430 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:20:19,529 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 17:20:19,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 189 transitions, 402 flow [2022-12-06 17:20:19,683 INFO L130 PetriNetUnfolder]: 13/186 cut-off events. [2022-12-06 17:20:19,683 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:20:19,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 13/186 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 365 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-06 17:20:19,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 189 transitions, 402 flow [2022-12-06 17:20:19,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 176 transitions, 370 flow [2022-12-06 17:20:19,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:20:19,722 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@314edbe9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:20:19,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 17:20:19,774 INFO L130 PetriNetUnfolder]: 13/175 cut-off events. [2022-12-06 17:20:19,775 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:20:19,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:19,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:20:19,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:19,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash -298548948, now seen corresponding path program 1 times [2022-12-06 17:20:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:19,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353972080] [2022-12-06 17:20:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:20,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-12-06 17:20:20,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:20,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353972080] [2022-12-06 17:20:20,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353972080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:20,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:20,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 17:20:20,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395545579] [2022-12-06 17:20:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:20,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:20:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:20:20,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:20:20,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2022-12-06 17:20:20,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 176 transitions, 370 flow. Second operand has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:20,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:20,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2022-12-06 17:20:20,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:20,952 INFO L130 PetriNetUnfolder]: 240/1448 cut-off events. [2022-12-06 17:20:20,952 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-06 17:20:20,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 1448 events. 240/1448 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 12155 event pairs, 76 based on Foata normal form. 94/1374 useless extension candidates. Maximal degree in co-relation 1630. Up to 122 conditions per place. [2022-12-06 17:20:20,973 INFO L137 encePairwiseOnDemand]: 168/189 looper letters, 44 selfloop transitions, 9 changer transitions 14/210 dead transitions. [2022-12-06 17:20:20,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 210 transitions, 611 flow [2022-12-06 17:20:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:20:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:20:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1646 transitions. [2022-12-06 17:20:20,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.870899470899471 [2022-12-06 17:20:21,002 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 9 predicate places. [2022-12-06 17:20:21,003 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 210 transitions, 611 flow [2022-12-06 17:20:21,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:21,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:21,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:20:21,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:20:21,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -797321002, now seen corresponding path program 2 times [2022-12-06 17:20:21,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:21,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660566653] [2022-12-06 17:20:21,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:21,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:21,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:21,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660566653] [2022-12-06 17:20:21,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660566653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:21,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:21,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:20:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273088439] [2022-12-06 17:20:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:21,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:20:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:21,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:20:21,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:20:21,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2022-12-06 17:20:21,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 210 transitions, 611 flow. Second operand has 7 states, 7 states have (on average 161.42857142857142) internal successors, (1130), 7 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:21,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:21,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2022-12-06 17:20:21,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:21,819 INFO L130 PetriNetUnfolder]: 336/1850 cut-off events. [2022-12-06 17:20:21,819 INFO L131 PetriNetUnfolder]: For 619/1133 co-relation queries the response was YES. [2022-12-06 17:20:21,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 1850 events. 336/1850 cut-off events. For 619/1133 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 16504 event pairs, 58 based on Foata normal form. 38/1723 useless extension candidates. Maximal degree in co-relation 2415. Up to 188 conditions per place. [2022-12-06 17:20:21,834 INFO L137 encePairwiseOnDemand]: 176/189 looper letters, 81 selfloop transitions, 23 changer transitions 24/281 dead transitions. [2022-12-06 17:20:21,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 281 transitions, 1240 flow [2022-12-06 17:20:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 17:20:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 17:20:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2146 transitions. [2022-12-06 17:20:21,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8734228734228734 [2022-12-06 17:20:21,839 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 21 predicate places. [2022-12-06 17:20:21,840 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 281 transitions, 1240 flow [2022-12-06 17:20:21,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 161.42857142857142) internal successors, (1130), 7 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:21,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:21,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:20:21,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 17:20:21,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1533599096, now seen corresponding path program 3 times [2022-12-06 17:20:21,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:21,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056541768] [2022-12-06 17:20:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:21,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056541768] [2022-12-06 17:20:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056541768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:22,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:22,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:20:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618860920] [2022-12-06 17:20:22,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:22,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:20:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:22,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:20:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:20:22,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2022-12-06 17:20:22,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 281 transitions, 1240 flow. Second operand has 7 states, 7 states have (on average 161.42857142857142) internal successors, (1130), 7 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:22,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:22,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2022-12-06 17:20:22,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:22,385 INFO L130 PetriNetUnfolder]: 330/1805 cut-off events. [2022-12-06 17:20:22,385 INFO L131 PetriNetUnfolder]: For 1203/3432 co-relation queries the response was YES. [2022-12-06 17:20:22,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 1805 events. 330/1805 cut-off events. For 1203/3432 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15838 event pairs, 55 based on Foata normal form. 120/1767 useless extension candidates. Maximal degree in co-relation 2691. Up to 187 conditions per place. [2022-12-06 17:20:22,402 INFO L137 encePairwiseOnDemand]: 176/189 looper letters, 82 selfloop transitions, 24 changer transitions 20/280 dead transitions. [2022-12-06 17:20:22,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 280 transitions, 1484 flow [2022-12-06 17:20:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 17:20:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 17:20:22,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1811 transitions. [2022-12-06 17:20:22,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8710918710918711 [2022-12-06 17:20:22,407 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 31 predicate places. [2022-12-06 17:20:22,407 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 280 transitions, 1484 flow [2022-12-06 17:20:22,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 161.42857142857142) internal successors, (1130), 7 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:22,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:22,408 INFO L213 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] [2022-12-06 17:20:22,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:20:22,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash -75935251, now seen corresponding path program 1 times [2022-12-06 17:20:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:22,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798554912] [2022-12-06 17:20:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:22,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798554912] [2022-12-06 17:20:22,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798554912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:22,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:22,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:20:22,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330967209] [2022-12-06 17:20:22,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:22,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:20:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:22,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:20:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:20:22,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2022-12-06 17:20:22,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 280 transitions, 1484 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:22,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:22,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2022-12-06 17:20:22,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:23,421 INFO L130 PetriNetUnfolder]: 1103/4862 cut-off events. [2022-12-06 17:20:23,421 INFO L131 PetriNetUnfolder]: For 6378/8839 co-relation queries the response was YES. [2022-12-06 17:20:23,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10519 conditions, 4862 events. 1103/4862 cut-off events. For 6378/8839 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 51254 event pairs, 255 based on Foata normal form. 60/4468 useless extension candidates. Maximal degree in co-relation 8181. Up to 1067 conditions per place. [2022-12-06 17:20:23,462 INFO L137 encePairwiseOnDemand]: 176/189 looper letters, 150 selfloop transitions, 33 changer transitions 55/408 dead transitions. [2022-12-06 17:20:23,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 408 transitions, 3058 flow [2022-12-06 17:20:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:20:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:20:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1636 transitions. [2022-12-06 17:20:23,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8656084656084656 [2022-12-06 17:20:23,468 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 40 predicate places. [2022-12-06 17:20:23,468 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 408 transitions, 3058 flow [2022-12-06 17:20:23,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:23,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:23,469 INFO L213 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] [2022-12-06 17:20:23,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 17:20:23,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:23,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:23,470 INFO L85 PathProgramCache]: Analyzing trace with hash 209067965, now seen corresponding path program 2 times [2022-12-06 17:20:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:23,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695532152] [2022-12-06 17:20:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:23,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:23,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:23,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695532152] [2022-12-06 17:20:23,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695532152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:23,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:23,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 17:20:23,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153585393] [2022-12-06 17:20:23,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:23,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:20:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:23,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:20:23,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:20:23,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2022-12-06 17:20:23,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 408 transitions, 3058 flow. Second operand has 8 states, 8 states have (on average 160.5) internal successors, (1284), 8 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:23,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:23,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2022-12-06 17:20:23,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:24,133 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][127], [208#true, 8#L49-11true, 271#true, 101#L74-4true, 49#L43-12true, 251#true, thread1Thread1of1ForFork1InUse, 63#$Ultimate##0true, thread2Thread1of1ForFork2InUse, 191#(= ~length_2~0 0), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:24,133 INFO L382 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-12-06 17:20:24,134 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:20:24,134 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:20:24,134 INFO L385 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-12-06 17:20:24,134 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][94], [271#true, 101#L74-4true, 251#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 63#$Ultimate##0true, thread2Thread1of1ForFork2InUse, 62#L43-11true, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 43#L49-12true, thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:24,134 INFO L382 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-12-06 17:20:24,134 INFO L385 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-12-06 17:20:24,134 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:20:24,134 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:20:24,157 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][189], [136#L55-12true, 271#true, 8#L49-11true, 101#L74-4true, 236#(<= ~result_6~0 0), 251#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 62#L43-11true, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:24,157 INFO L382 tUnfolder$Statistics]: this new event has 80 ancestors and is not cut-off event [2022-12-06 17:20:24,157 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-12-06 17:20:24,157 INFO L385 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-12-06 17:20:24,157 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-12-06 17:20:24,212 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][127], [136#L55-12true, 208#true, 271#true, 8#L49-11true, 101#L74-4true, 49#L43-12true, 251#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 191#(= ~length_2~0 0), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:24,212 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 17:20:24,212 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-06 17:20:24,212 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 17:20:24,212 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-06 17:20:24,213 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][94], [136#L55-12true, 271#true, 101#L74-4true, 251#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 62#L43-11true, 43#L49-12true, thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:24,213 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 17:20:24,213 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-06 17:20:24,213 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 17:20:24,213 INFO L385 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-12-06 17:20:24,369 INFO L130 PetriNetUnfolder]: 1119/4741 cut-off events. [2022-12-06 17:20:24,370 INFO L131 PetriNetUnfolder]: For 10015/20771 co-relation queries the response was YES. [2022-12-06 17:20:24,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12526 conditions, 4741 events. 1119/4741 cut-off events. For 10015/20771 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 48761 event pairs, 216 based on Foata normal form. 282/4598 useless extension candidates. Maximal degree in co-relation 10380. Up to 1172 conditions per place. [2022-12-06 17:20:24,415 INFO L137 encePairwiseOnDemand]: 178/189 looper letters, 156 selfloop transitions, 12 changer transitions 132/471 dead transitions. [2022-12-06 17:20:24,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 471 transitions, 4358 flow [2022-12-06 17:20:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 17:20:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 17:20:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1792 transitions. [2022-12-06 17:20:24,420 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8619528619528619 [2022-12-06 17:20:24,422 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 50 predicate places. [2022-12-06 17:20:24,422 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 471 transitions, 4358 flow [2022-12-06 17:20:24,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 160.5) internal successors, (1284), 8 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:24,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:24,424 INFO L213 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] [2022-12-06 17:20:24,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 17:20:24,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -189662913, now seen corresponding path program 1 times [2022-12-06 17:20:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:24,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979699705] [2022-12-06 17:20:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:24,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:24,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979699705] [2022-12-06 17:20:24,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979699705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:24,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:24,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:20:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092859546] [2022-12-06 17:20:24,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:24,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:20:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:24,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:20:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:20:24,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2022-12-06 17:20:24,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 471 transitions, 4358 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:24,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:24,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2022-12-06 17:20:24,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:25,432 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][250], [136#L55-12true, 253#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 189#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, 66#L49-10true, thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 151#L75-2true, 273#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,432 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-06 17:20:25,432 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 17:20:25,433 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 17:20:25,433 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 17:20:25,448 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][258], [136#L55-12true, 8#L49-11true, 189#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 151#L75-2true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,448 INFO L382 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-12-06 17:20:25,448 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 17:20:25,448 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 17:20:25,448 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:25,465 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][272], [136#L55-12true, 189#true, thread1Thread1of1ForFork1NotInUse, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 43#L49-12true, 151#L75-2true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,466 INFO L382 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-12-06 17:20:25,466 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 17:20:25,466 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 17:20:25,466 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 17:20:25,485 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][285], [136#L55-12true, 253#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 189#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 151#L75-2true, 155#L49-13true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 285#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ ~result_7~0 1) 0))]) [2022-12-06 17:20:25,485 INFO L382 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-12-06 17:20:25,485 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:20:25,485 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:25,485 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:25,501 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][295], [136#L55-12true, 189#true, 251#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 151#L75-2true, 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,501 INFO L382 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-12-06 17:20:25,501 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 17:20:25,501 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 17:20:25,501 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:20:25,588 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][234], [8#L49-11true, 189#true, 251#true, 149#L43-13true, 136#L55-12true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 271#true, 101#L74-4true, thread1Thread1of1ForFork1InUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:25,588 INFO L382 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-12-06 17:20:25,588 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 17:20:25,588 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:25,589 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 17:20:25,660 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][234], [136#L55-12true, 271#true, 8#L49-11true, 189#true, 251#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 151#L75-2true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,660 INFO L382 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event [2022-12-06 17:20:25,661 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-06 17:20:25,661 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-06 17:20:25,661 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-06 17:20:25,670 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][234], [136#L55-12true, 271#true, 189#true, 251#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 151#L75-2true, 43#L49-12true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,671 INFO L382 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-12-06 17:20:25,671 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:20:25,671 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:20:25,671 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:25,680 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][234], [136#L55-12true, 271#true, 189#true, 251#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 151#L75-2true, 155#L49-13true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,680 INFO L382 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-12-06 17:20:25,681 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-06 17:20:25,681 INFO L385 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-12-06 17:20:25,681 INFO L385 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-12-06 17:20:25,690 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][234], [136#L55-12true, 271#true, 189#true, 251#true, thread1Thread1of1ForFork1NotInUse, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 234#(or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)), 151#L75-2true, 105#L49-14true, 222#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0)))]) [2022-12-06 17:20:25,690 INFO L382 tUnfolder$Statistics]: this new event has 111 ancestors and is cut-off event [2022-12-06 17:20:25,691 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:25,691 INFO L385 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-12-06 17:20:25,691 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:25,753 INFO L130 PetriNetUnfolder]: 2330/9396 cut-off events. [2022-12-06 17:20:25,753 INFO L131 PetriNetUnfolder]: For 32144/38756 co-relation queries the response was YES. [2022-12-06 17:20:25,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25604 conditions, 9396 events. 2330/9396 cut-off events. For 32144/38756 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 105893 event pairs, 615 based on Foata normal form. 92/8320 useless extension candidates. Maximal degree in co-relation 15786. Up to 2274 conditions per place. [2022-12-06 17:20:25,833 INFO L137 encePairwiseOnDemand]: 183/189 looper letters, 114 selfloop transitions, 4 changer transitions 222/560 dead transitions. [2022-12-06 17:20:25,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 560 transitions, 6157 flow [2022-12-06 17:20:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:20:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:20:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-12-06 17:20:25,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9312169312169312 [2022-12-06 17:20:25,836 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 52 predicate places. [2022-12-06 17:20:25,836 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 560 transitions, 6157 flow [2022-12-06 17:20:25,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:25,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:25,837 INFO L213 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] [2022-12-06 17:20:25,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 17:20:25,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1576240501, now seen corresponding path program 2 times [2022-12-06 17:20:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:25,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419715048] [2022-12-06 17:20:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:25,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:25,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419715048] [2022-12-06 17:20:25,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419715048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:25,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:25,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:20:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268270165] [2022-12-06 17:20:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:25,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:20:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:20:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:20:25,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2022-12-06 17:20:25,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 560 transitions, 6157 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:25,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:25,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2022-12-06 17:20:25,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:26,840 INFO L130 PetriNetUnfolder]: 1635/7265 cut-off events. [2022-12-06 17:20:26,841 INFO L131 PetriNetUnfolder]: For 34051/38547 co-relation queries the response was YES. [2022-12-06 17:20:26,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20604 conditions, 7265 events. 1635/7265 cut-off events. For 34051/38547 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 79031 event pairs, 524 based on Foata normal form. 48/6502 useless extension candidates. Maximal degree in co-relation 12731. Up to 1670 conditions per place. [2022-12-06 17:20:26,900 INFO L137 encePairwiseOnDemand]: 185/189 looper letters, 148 selfloop transitions, 2 changer transitions 165/541 dead transitions. [2022-12-06 17:20:26,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 541 transitions, 6260 flow [2022-12-06 17:20:26,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:20:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:20:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-12-06 17:20:26,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9312169312169312 [2022-12-06 17:20:26,903 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 54 predicate places. [2022-12-06 17:20:26,903 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 541 transitions, 6260 flow [2022-12-06 17:20:26,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:26,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:26,904 INFO L213 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] [2022-12-06 17:20:26,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 17:20:26,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2069313360, now seen corresponding path program 1 times [2022-12-06 17:20:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:26,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380586475] [2022-12-06 17:20:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:27,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:27,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380586475] [2022-12-06 17:20:27,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380586475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:27,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:27,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:20:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892866479] [2022-12-06 17:20:27,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:27,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:20:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:27,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:20:27,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:20:27,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 189 [2022-12-06 17:20:27,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 541 transitions, 6260 flow. Second operand has 7 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:27,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:27,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 189 [2022-12-06 17:20:27,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:27,543 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][315], [292#true, 251#true, 62#L43-11true, 105#L49-14true, 275#(<= (+ ~result_7~0 1) 0), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:27,544 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 17:20:27,544 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:27,544 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:27,544 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:28,522 INFO L130 PetriNetUnfolder]: 2159/9462 cut-off events. [2022-12-06 17:20:28,522 INFO L131 PetriNetUnfolder]: For 59080/72397 co-relation queries the response was YES. [2022-12-06 17:20:28,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28722 conditions, 9462 events. 2159/9462 cut-off events. For 59080/72397 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 108425 event pairs, 580 based on Foata normal form. 235/8604 useless extension candidates. Maximal degree in co-relation 18324. Up to 2115 conditions per place. [2022-12-06 17:20:28,597 INFO L137 encePairwiseOnDemand]: 180/189 looper letters, 204 selfloop transitions, 10 changer transitions 179/584 dead transitions. [2022-12-06 17:20:28,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 584 transitions, 7743 flow [2022-12-06 17:20:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:20:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:20:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1661 transitions. [2022-12-06 17:20:28,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8788359788359789 [2022-12-06 17:20:28,604 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 63 predicate places. [2022-12-06 17:20:28,604 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 584 transitions, 7743 flow [2022-12-06 17:20:28,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:28,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:28,605 INFO L213 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] [2022-12-06 17:20:28,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 17:20:28,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:28,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1999688171, now seen corresponding path program 1 times [2022-12-06 17:20:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:28,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295044119] [2022-12-06 17:20:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:28,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:28,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-12-06 17:20:28,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:28,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295044119] [2022-12-06 17:20:28,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295044119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:28,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:28,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 17:20:28,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296050029] [2022-12-06 17:20:28,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:28,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:20:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:28,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:20:28,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:20:28,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2022-12-06 17:20:28,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 584 transitions, 7743 flow. Second operand has 8 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:28,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:28,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2022-12-06 17:20:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:29,485 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][360], [308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 251#true, 292#true, 191#(= ~length_2~0 0), 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 208#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 49#L43-12true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 31#L55-5true, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:29,485 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 17:20:29,485 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 17:20:29,485 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 17:20:29,485 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 17:20:29,713 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][356], [298#true, 251#true, 191#(= ~length_2~0 0), 151#L75-2true, 105#L49-14true, 295#true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 271#true, 140#L55-13true, thread1Thread1of1ForFork1NotInUse, 236#(<= ~result_6~0 0), 294#(= ~length_0~0 0), 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse]) [2022-12-06 17:20:29,714 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 17:20:29,714 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:29,714 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:29,714 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:30,348 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][360], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 251#true, 191#(= ~length_2~0 0), 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 208#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 49#L43-12true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:30,348 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:30,348 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:30,348 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:30,348 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:30,349 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][545], [251#true, 292#true, 62#L43-11true, 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:30,349 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:30,349 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:30,349 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:30,349 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:31,178 INFO L130 PetriNetUnfolder]: 5032/20066 cut-off events. [2022-12-06 17:20:31,179 INFO L131 PetriNetUnfolder]: For 161029/187990 co-relation queries the response was YES. [2022-12-06 17:20:31,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66521 conditions, 20066 events. 5032/20066 cut-off events. For 161029/187990 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 254355 event pairs, 1530 based on Foata normal form. 239/17907 useless extension candidates. Maximal degree in co-relation 38904. Up to 4515 conditions per place. [2022-12-06 17:20:31,480 INFO L137 encePairwiseOnDemand]: 176/189 looper letters, 133 selfloop transitions, 5 changer transitions 502/804 dead transitions. [2022-12-06 17:20:31,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 804 transitions, 12343 flow [2022-12-06 17:20:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 17:20:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 17:20:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1761 transitions. [2022-12-06 17:20:31,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.847041847041847 [2022-12-06 17:20:31,486 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 73 predicate places. [2022-12-06 17:20:31,486 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 804 transitions, 12343 flow [2022-12-06 17:20:31,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:31,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:31,487 INFO L213 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] [2022-12-06 17:20:31,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 17:20:31,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -852846745, now seen corresponding path program 2 times [2022-12-06 17:20:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:31,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540031460] [2022-12-06 17:20:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:31,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:31,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540031460] [2022-12-06 17:20:31,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540031460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:31,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:31,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 17:20:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096939722] [2022-12-06 17:20:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:31,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:20:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:20:31,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:20:31,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2022-12-06 17:20:31,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 804 transitions, 12343 flow. Second operand has 8 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:31,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:31,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2022-12-06 17:20:31,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:33,419 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][826], [338#true, 8#L49-11true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 149#L43-13true, 136#L55-12true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 101#L74-4true, 297#(not (= ~length_0~0 0)), thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:33,419 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,419 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,419 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,419 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,419 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][385], [60#L55-11true, 189#true, 298#true, 292#true, 43#L49-12true, 149#L43-13true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 101#L74-4true, 297#(not (= ~length_0~0 0)), 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0))), 232#true]) [2022-12-06 17:20:33,420 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,420 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,420 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,420 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:33,813 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][834], [60#L55-11true, 8#L49-11true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 151#L75-2true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 297#(not (= ~length_0~0 0)), thread1Thread1of1ForFork1NotInUse, 315#true, thread2Thread1of1ForFork2InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:33,814 INFO L382 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-12-06 17:20:33,814 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:33,814 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:33,814 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:33,990 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][916], [8#L49-11true, 338#true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 151#L75-2true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 140#L55-13true, 297#(not (= ~length_0~0 0)), thread1Thread1of1ForFork1NotInUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 232#true]) [2022-12-06 17:20:33,990 INFO L382 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-12-06 17:20:33,990 INFO L385 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-12-06 17:20:33,990 INFO L385 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-12-06 17:20:33,990 INFO L385 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-12-06 17:20:34,389 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][767], [60#L55-11true, 189#true, 298#true, 292#true, 43#L49-12true, 149#L43-13true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 317#(not (= ~length_4~0 0)), 101#L74-4true, 297#(not (= ~length_0~0 0)), 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0))), 232#true]) [2022-12-06 17:20:34,390 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-12-06 17:20:34,390 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-06 17:20:34,390 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-06 17:20:34,390 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-06 17:20:34,444 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][1120], [8#L49-11true, 338#true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 149#L43-13true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 136#L55-12true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 232#true]) [2022-12-06 17:20:34,444 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is not cut-off event [2022-12-06 17:20:34,444 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-06 17:20:34,444 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-06 17:20:34,444 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-06 17:20:34,709 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][847], [60#L55-11true, 8#L49-11true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 151#L75-2true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 297#(not (= ~length_0~0 0)), 317#(not (= ~length_4~0 0)), thread1Thread1of1ForFork1NotInUse, thread2Thread1of1ForFork2InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:34,709 INFO L382 tUnfolder$Statistics]: this new event has 109 ancestors and is not cut-off event [2022-12-06 17:20:34,709 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-12-06 17:20:34,709 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-12-06 17:20:34,709 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is not cut-off event [2022-12-06 17:20:34,959 INFO L130 PetriNetUnfolder]: 6287/24518 cut-off events. [2022-12-06 17:20:34,960 INFO L131 PetriNetUnfolder]: For 239688/307206 co-relation queries the response was YES. [2022-12-06 17:20:35,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91822 conditions, 24518 events. 6287/24518 cut-off events. For 239688/307206 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 325909 event pairs, 1045 based on Foata normal form. 916/22733 useless extension candidates. Maximal degree in co-relation 79356. Up to 5136 conditions per place. [2022-12-06 17:20:35,143 INFO L137 encePairwiseOnDemand]: 172/189 looper letters, 202 selfloop transitions, 55 changer transitions 946/1369 dead transitions. [2022-12-06 17:20:35,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 1369 transitions, 25026 flow [2022-12-06 17:20:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 17:20:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 17:20:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2091 transitions. [2022-12-06 17:20:35,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.851037851037851 [2022-12-06 17:20:35,149 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 85 predicate places. [2022-12-06 17:20:35,149 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 1369 transitions, 25026 flow [2022-12-06 17:20:35,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:35,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:35,150 INFO L213 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] [2022-12-06 17:20:35,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 17:20:35,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:35,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1223770025, now seen corresponding path program 3 times [2022-12-06 17:20:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:35,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756787380] [2022-12-06 17:20:35,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:35,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:35,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756787380] [2022-12-06 17:20:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756787380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:35,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:35,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:20:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970686432] [2022-12-06 17:20:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:35,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:20:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:35,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:20:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:20:35,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2022-12-06 17:20:35,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 1369 transitions, 25026 flow. Second operand has 7 states, 7 states have (on average 157.0) internal successors, (1099), 7 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:35,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:35,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2022-12-06 17:20:35,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:36,259 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][130], [292#true, 62#L43-11true, 43#L49-12true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 347#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0))), 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 28#L55-3true, 315#true, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:36,259 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,260 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,260 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,260 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,261 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][138], [8#L49-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 191#(= ~length_2~0 0), 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 347#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0))), 49#L43-12true, thread1Thread1of1ForFork1InUse, 28#L55-3true, 315#true, thread2Thread1of1ForFork2InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:36,261 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,261 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,261 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,262 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:36,392 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][344], [60#L55-11true, 292#true, 62#L43-11true, 43#L49-12true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 236#(<= ~result_6~0 0), 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:36,392 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,392 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,392 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,392 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,396 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][380], [60#L55-11true, 8#L49-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 191#(= ~length_2~0 0), 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:36,396 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,396 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,396 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,396 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:20:36,475 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][493], [308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 251#true, 292#true, 191#(= ~length_2~0 0), 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 208#true, 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 31#L55-5true, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:36,475 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 17:20:36,475 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 17:20:36,475 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 17:20:36,475 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 17:20:36,476 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][413], [8#L49-11true, 338#true, 292#true, 62#L43-11true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:36,476 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-06 17:20:36,476 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:36,477 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:36,477 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:37,720 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][790], [8#L49-11true, 338#true, 292#true, 62#L43-11true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 101#L74-4true, 297#(not (= ~length_0~0 0)), 317#(not (= ~length_4~0 0)), 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:37,720 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,720 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,720 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,720 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,721 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][346], [60#L55-11true, 292#true, 62#L43-11true, 43#L49-12true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:37,721 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,721 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,721 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,721 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:37,841 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][375], [60#L55-11true, 8#L49-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 191#(= ~length_2~0 0), 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 208#true, 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:37,842 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is not cut-off event [2022-12-06 17:20:37,842 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-12-06 17:20:37,842 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-12-06 17:20:37,842 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-12-06 17:20:38,520 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][870], [60#L55-11true, 298#true, 251#true, 292#true, 191#(= ~length_2~0 0), 151#L75-2true, 155#L49-13true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 208#true, 365#true, 271#true, 297#(not (= ~length_0~0 0)), thread1Thread1of1ForFork1NotInUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:38,521 INFO L382 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-12-06 17:20:38,521 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:38,521 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:38,521 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:38,710 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][870], [60#L55-11true, 298#true, 251#true, 292#true, 191#(= ~length_2~0 0), 151#L75-2true, 105#L49-14true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 208#true, 365#true, 271#true, 297#(not (= ~length_0~0 0)), thread1Thread1of1ForFork1NotInUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:38,710 INFO L382 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-12-06 17:20:38,710 INFO L385 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-12-06 17:20:38,710 INFO L385 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-12-06 17:20:38,710 INFO L385 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-12-06 17:20:39,801 INFO L130 PetriNetUnfolder]: 6383/24463 cut-off events. [2022-12-06 17:20:39,801 INFO L131 PetriNetUnfolder]: For 283692/367490 co-relation queries the response was YES. [2022-12-06 17:20:39,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102147 conditions, 24463 events. 6383/24463 cut-off events. For 283692/367490 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 322195 event pairs, 1111 based on Foata normal form. 774/22578 useless extension candidates. Maximal degree in co-relation 93092. Up to 7993 conditions per place. [2022-12-06 17:20:39,933 INFO L137 encePairwiseOnDemand]: 177/189 looper letters, 272 selfloop transitions, 21 changer transitions 985/1445 dead transitions. [2022-12-06 17:20:39,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 1445 transitions, 28926 flow [2022-12-06 17:20:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 17:20:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 17:20:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1443 transitions. [2022-12-06 17:20:39,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8483245149911817 [2022-12-06 17:20:39,937 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 93 predicate places. [2022-12-06 17:20:39,937 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 1445 transitions, 28926 flow [2022-12-06 17:20:39,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.0) internal successors, (1099), 7 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:39,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:39,938 INFO L213 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] [2022-12-06 17:20:39,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 17:20:39,938 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1347531141, now seen corresponding path program 4 times [2022-12-06 17:20:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:39,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857862700] [2022-12-06 17:20:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:40,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857862700] [2022-12-06 17:20:40,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857862700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:40,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:40,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 17:20:40,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071029006] [2022-12-06 17:20:40,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:40,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:20:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:40,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:20:40,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:20:40,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 189 [2022-12-06 17:20:40,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 1445 transitions, 28926 flow. Second operand has 8 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:40,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:40,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 189 [2022-12-06 17:20:40,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:40,703 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][130], [220#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 298#true, 292#true, 43#L49-12true, 36#L43-3true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 347#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0))), 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 315#true, 28#L55-3true, 242#(and (<= ~result_6~0 0) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 384#(or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0)), thread3Thread1of1ForFork0InUse, 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:40,703 INFO L382 tUnfolder$Statistics]: this new event has 64 ancestors and is not cut-off event [2022-12-06 17:20:40,703 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-12-06 17:20:40,703 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-12-06 17:20:40,703 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is not cut-off event [2022-12-06 17:20:40,786 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][130], [292#true, 62#L43-11true, 43#L49-12true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 347#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0))), 236#(<= ~result_6~0 0), 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 315#true, 28#L55-3true, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 384#(or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:40,786 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,786 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,786 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,786 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,788 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][138], [308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 8#L49-11true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 191#(= ~length_2~0 0), 365#true, 208#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 347#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0))), 49#L43-12true, thread1Thread1of1ForFork1InUse, 315#true, 28#L55-3true, thread2Thread1of1ForFork2InUse, 384#(or (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= ~length_4~0 0)), 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:40,788 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,788 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,788 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,788 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,795 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][346], [60#L55-11true, 220#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 298#true, 292#true, 36#L43-3true, 43#L49-12true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 365#true, 101#L74-4true, 297#(not (= ~length_0~0 0)), 382#true, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 315#true, 242#(and (<= ~result_6~0 0) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:40,795 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,796 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,796 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,796 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,797 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][391], [338#true, 8#L49-11true, 220#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 36#L43-3true, 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, thread1Thread1of1ForFork1InUse, 315#true, 242#(and (<= ~result_6~0 0) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse]) [2022-12-06 17:20:40,797 INFO L382 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,797 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,797 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:40,797 INFO L385 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-12-06 17:20:41,116 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][346], [60#L55-11true, 292#true, 62#L43-11true, 43#L49-12true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 315#true, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:41,116 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,116 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,116 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,116 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,117 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][388], [60#L55-11true, 8#L49-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 191#(= ~length_2~0 0), 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 232#true]) [2022-12-06 17:20:41,117 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,117 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,117 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,117 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,118 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][391], [338#true, 8#L49-11true, 292#true, 62#L43-11true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:41,118 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,118 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,118 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,118 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:20:41,248 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][497], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 251#true, 191#(= ~length_2~0 0), 105#L49-14true, 275#(<= (+ ~result_7~0 1) 0), 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:41,248 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 17:20:41,248 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:41,248 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:41,248 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:41,250 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][537], [338#true, 251#true, 292#true, 62#L43-11true, 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:41,250 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 17:20:41,251 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:41,251 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:41,251 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 17:20:42,112 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][383], [60#L55-11true, 220#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 298#true, 292#true, 36#L43-3true, 43#L49-12true, 365#true, 317#(not (= ~length_4~0 0)), 101#L74-4true, 297#(not (= ~length_0~0 0)), 382#true, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), 242#(and (<= ~result_6~0 0) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:42,112 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-06 17:20:42,112 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 17:20:42,112 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 17:20:42,112 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-12-06 17:20:42,247 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][773], [338#true, 8#L49-11true, 220#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 36#L43-3true, 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 317#(not (= ~length_4~0 0)), 101#L74-4true, 382#true, thread1Thread1of1ForFork1InUse, 242#(and (<= ~result_6~0 0) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse]) [2022-12-06 17:20:42,247 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is not cut-off event [2022-12-06 17:20:42,247 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-12-06 17:20:42,247 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-12-06 17:20:42,247 INFO L385 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-12-06 17:20:42,364 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][773], [338#true, 8#L49-11true, 292#true, 62#L43-11true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:42,364 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,364 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,364 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,364 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,364 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][454], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 8#L49-11true, 292#true, 191#(= ~length_2~0 0), 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 208#true, 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:42,364 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,364 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,364 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,364 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,380 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][821], [220#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 338#true, 298#true, 292#true, 36#L43-3true, 155#L49-13true, 136#L55-12true, 253#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, thread1Thread1of1ForFork1InUse, 242#(and (<= ~result_6~0 0) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 285#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ ~result_7~0 1) 0))]) [2022-12-06 17:20:42,380 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,380 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,380 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,380 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-06 17:20:42,489 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][383], [60#L55-11true, 292#true, 62#L43-11true, 43#L49-12true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:42,490 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is not cut-off event [2022-12-06 17:20:42,490 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-12-06 17:20:42,490 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-12-06 17:20:42,490 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is not cut-off event [2022-12-06 17:20:42,490 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][493], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 191#(= ~length_2~0 0), 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 43#L49-12true, 208#true, 365#true, 297#(not (= ~length_0~0 0)), 317#(not (= ~length_4~0 0)), 101#L74-4true, 382#true, 49#L43-12true, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:42,490 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,490 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,490 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,490 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,491 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][818], [338#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 62#L43-11true, 43#L49-12true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:42,491 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,491 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,491 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,491 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:20:42,590 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][494], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 191#(= ~length_2~0 0), 155#L49-13true, 253#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 285#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 232#true]) [2022-12-06 17:20:42,590 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,590 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,590 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,590 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][494], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 191#(= ~length_2~0 0), 155#L49-13true, 253#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread3Thread1of1ForFork0InUse, 285#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ ~result_7~0 1) 0)), 232#true]) [2022-12-06 17:20:42,593 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][821], [338#true, 292#true, 62#L43-11true, 155#L49-13true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 253#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 285#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ ~result_7~0 1) 0))]) [2022-12-06 17:20:42,593 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,593 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,594 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][821], [338#true, 292#true, 62#L43-11true, 155#L49-13true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 253#(<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0), 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0)), 285#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ ~result_7~0 1) 0))]) [2022-12-06 17:20:42,594 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,594 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,594 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,594 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,594 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][495], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 251#true, 292#true, 191#(= ~length_2~0 0), 105#L49-14true, 275#(<= (+ ~result_7~0 1) 0), 208#true, 365#true, 101#L74-4true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:42,595 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][820], [338#true, 292#true, 251#true, 62#L43-11true, 105#L49-14true, 275#(<= (+ ~result_7~0 1) 0), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 101#L74-4true, 297#(not (= ~length_0~0 0)), 317#(not (= ~length_4~0 0)), 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:42,595 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,595 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,599 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][820], [220#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), 338#true, 298#true, 292#true, 251#true, 36#L43-3true, 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, thread1Thread1of1ForFork1InUse, 242#(and (<= ~result_6~0 0) (<= |thread1Thread1of1ForFork1_#t~ite3#1| 0) (or (not (= ~length_2~0 0)) (= |thread1Thread1of1ForFork1_#t~ite3#1| 0))), thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse]) [2022-12-06 17:20:42,600 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-12-06 17:20:42,600 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-12-06 17:20:42,600 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-12-06 17:20:42,600 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-12-06 17:20:42,600 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][820], [338#true, 292#true, 251#true, 62#L43-11true, 105#L49-14true, 275#(<= (+ ~result_7~0 1) 0), 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:42,600 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,600 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,600 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,600 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,600 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,705 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][495], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 251#true, 191#(= ~length_2~0 0), 105#L49-14true, 275#(<= (+ ~result_7~0 1) 0), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:42,705 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,705 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,705 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,705 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,705 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([434] L43-11-->L43-12: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_3|, ~result_6~0=v_~result_6~0_1} AuxVars[] AssignedVars[~result_6~0][495], [60#L55-11true, 308#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ ~result_6~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 292#true, 251#true, 191#(= ~length_2~0 0), 105#L49-14true, 275#(<= (+ ~result_7~0 1) 0), 208#true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, 49#L43-12true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread3Thread1of1ForFork0InUse, 232#true]) [2022-12-06 17:20:42,708 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L380 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][820], [338#true, 251#true, 292#true, 62#L43-11true, 275#(<= (+ ~result_7~0 1) 0), 105#L49-14true, 306#(and (<= (+ |thread1Thread1of1ForFork1_#t~ite2#1| 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite3#1| 1) 0)), 136#L55-12true, 365#true, 317#(not (= ~length_4~0 0)), 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 236#(<= ~result_6~0 0), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 198#(and (<= ~result_6~0 0) (= ~length_2~0 0)), thread3Thread1of1ForFork0InUse, 216#(and (or (not (= ~length_2~0 0)) (= ~result_6~0 0)) (<= ~result_6~0 0))]) [2022-12-06 17:20:42,708 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,708 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,709 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,709 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,709 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:42,709 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 17:20:43,292 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][588], [60#L55-11true, 8#L49-11true, 292#true, 302#(<= (+ ~result_6~0 1) 0), 191#(= ~length_2~0 0), 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 151#L75-2true, 208#true, 365#true, 297#(not (= ~length_0~0 0)), 317#(not (= ~length_4~0 0)), 382#true, thread1Thread1of1ForFork1NotInUse, thread2Thread1of1ForFork2InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 232#true]) [2022-12-06 17:20:43,292 INFO L382 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-12-06 17:20:43,292 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:43,292 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:43,293 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:43,816 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][812], [60#L55-11true, 189#true, 298#true, 292#true, 149#L43-13true, 43#L49-12true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 232#true, 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0)))]) [2022-12-06 17:20:43,816 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-12-06 17:20:43,816 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-06 17:20:43,816 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-06 17:20:43,816 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-12-06 17:20:43,877 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][1186], [338#true, 8#L49-11true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 149#L43-13true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 317#(not (= ~length_4~0 0)), 382#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 232#true]) [2022-12-06 17:20:43,877 INFO L382 tUnfolder$Statistics]: this new event has 102 ancestors and is not cut-off event [2022-12-06 17:20:43,877 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-06 17:20:43,877 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-06 17:20:43,877 INFO L385 tUnfolder$Statistics]: existing Event has 102 ancestors and is not cut-off event [2022-12-06 17:20:44,239 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][898], [60#L55-11true, 8#L49-11true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 151#L75-2true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 365#true, 297#(not (= ~length_0~0 0)), 317#(not (= ~length_4~0 0)), 382#true, thread1Thread1of1ForFork1NotInUse, thread2Thread1of1ForFork2InUse, 354#(and (or (= ~result_8~0 1) (= ~length_4~0 0)) (<= 1 ~result_8~0)), thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 232#true]) [2022-12-06 17:20:44,239 INFO L382 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-12-06 17:20:44,239 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-06 17:20:44,239 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-06 17:20:44,239 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-06 17:20:44,509 INFO L130 PetriNetUnfolder]: 6784/25166 cut-off events. [2022-12-06 17:20:44,509 INFO L131 PetriNetUnfolder]: For 342341/500570 co-relation queries the response was YES. [2022-12-06 17:20:44,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115518 conditions, 25166 events. 6784/25166 cut-off events. For 342341/500570 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 331223 event pairs, 994 based on Foata normal form. 1960/24210 useless extension candidates. Maximal degree in co-relation 105548. Up to 8384 conditions per place. [2022-12-06 17:20:44,645 INFO L137 encePairwiseOnDemand]: 172/189 looper letters, 153 selfloop transitions, 17 changer transitions 1115/1443 dead transitions. [2022-12-06 17:20:44,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1443 transitions, 31412 flow [2022-12-06 17:20:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 17:20:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 17:20:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1762 transitions. [2022-12-06 17:20:44,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8475228475228476 [2022-12-06 17:20:44,648 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 103 predicate places. [2022-12-06 17:20:44,649 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 1443 transitions, 31412 flow [2022-12-06 17:20:44,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:44,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:44,649 INFO L213 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] [2022-12-06 17:20:44,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 17:20:44,650 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2028894208, now seen corresponding path program 1 times [2022-12-06 17:20:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:44,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760086777] [2022-12-06 17:20:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:44,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:44,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760086777] [2022-12-06 17:20:44,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760086777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:44,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:44,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:20:44,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31967684] [2022-12-06 17:20:44,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:44,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:20:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:44,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:20:44,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:20:44,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 189 [2022-12-06 17:20:44,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1443 transitions, 31412 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:44,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:44,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 189 [2022-12-06 17:20:44,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:47,772 INFO L130 PetriNetUnfolder]: 4999/19528 cut-off events. [2022-12-06 17:20:47,773 INFO L131 PetriNetUnfolder]: For 346647/440232 co-relation queries the response was YES. [2022-12-06 17:20:47,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91011 conditions, 19528 events. 4999/19528 cut-off events. For 346647/440232 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 246943 event pairs, 890 based on Foata normal form. 415/17877 useless extension candidates. Maximal degree in co-relation 48536. Up to 6104 conditions per place. [2022-12-06 17:20:47,871 INFO L137 encePairwiseOnDemand]: 185/189 looper letters, 70 selfloop transitions, 2 changer transitions 856/1151 dead transitions. [2022-12-06 17:20:47,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1151 transitions, 25586 flow [2022-12-06 17:20:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:20:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:20:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-12-06 17:20:47,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9294532627865961 [2022-12-06 17:20:47,873 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 105 predicate places. [2022-12-06 17:20:47,873 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 1151 transitions, 25586 flow [2022-12-06 17:20:47,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:47,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:47,874 INFO L213 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] [2022-12-06 17:20:47,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 17:20:47,874 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:47,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1405316295, now seen corresponding path program 1 times [2022-12-06 17:20:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:47,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645510197] [2022-12-06 17:20:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:47,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:47,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645510197] [2022-12-06 17:20:47,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645510197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:47,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:47,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 17:20:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189594824] [2022-12-06 17:20:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:47,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 17:20:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 17:20:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 17:20:47,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 189 [2022-12-06 17:20:47,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 1151 transitions, 25586 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:47,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:47,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 189 [2022-12-06 17:20:47,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:20:48,836 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][458], [298#true, 407#true, 251#true, 191#(= ~length_2~0 0), 151#L75-2true, 105#L49-14true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 295#true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 365#true, 271#true, 140#L55-13true, 382#true, 404#true, thread1Thread1of1ForFork1NotInUse, 236#(<= ~result_6~0 0), 315#true, 294#(= ~length_0~0 0), thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse]) [2022-12-06 17:20:48,836 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-06 17:20:48,836 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:48,836 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:48,836 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:20:49,389 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([468] L49-11-->L49-12: Formula: (= v_~result_7~0_1 |v_thread2Thread1of1ForFork2_#t~ite6#1_3|) InVars {thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|} OutVars{thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_3|, ~result_7~0=v_~result_7~0_1} AuxVars[] AssignedVars[~result_7~0][322], [60#L55-11true, 406#(not (= ~length_2~0 0)), 189#true, 298#true, 292#true, 43#L49-12true, 149#L43-13true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, 282#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (<= (+ ~result_7~0 1) 0)), thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 409#(= ~length_4~0 0), 261#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0) (or (<= ~result_7~0 0) (<= ~result_6~0 0) (< 0 ~result_8~0))), 232#true]) [2022-12-06 17:20:49,389 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 17:20:49,389 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:49,389 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:49,389 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 17:20:49,439 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L55-11-->L55-12: Formula: (= |v_thread3Thread1of1ForFork0_#t~ite9#1_3| v_~result_8~0_1) InVars {thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|} OutVars{thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_3|, ~result_8~0=v_~result_8~0_1} AuxVars[] AssignedVars[~result_8~0][637], [406#(not (= ~length_2~0 0)), 338#true, 8#L49-11true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 149#L43-13true, 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 136#L55-12true, 365#true, 297#(not (= ~length_0~0 0)), 101#L74-4true, 382#true, thread1Thread1of1ForFork1InUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 409#(= ~length_4~0 0), 232#true]) [2022-12-06 17:20:49,439 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is not cut-off event [2022-12-06 17:20:49,439 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-12-06 17:20:49,439 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-12-06 17:20:49,439 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-12-06 17:20:49,703 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([537] thread1EXIT-->L75-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem22#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][640], [60#L55-11true, 406#(not (= ~length_2~0 0)), 8#L49-11true, 189#true, 298#true, 292#true, 259#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 151#L75-2true, 341#(or (= ~result_8~0 1) (= ~length_4~0 0)), 211#(or (not (= ~length_2~0 0)) (= ~result_6~0 0)), 365#true, 297#(not (= ~length_0~0 0)), 382#true, thread1Thread1of1ForFork1NotInUse, 315#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 280#(and (<= (+ |thread2Thread1of1ForFork2_#t~ite5#1| 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite6#1| 1) 0)), 409#(= ~length_4~0 0), 232#true]) [2022-12-06 17:20:49,703 INFO L382 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-12-06 17:20:49,703 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:49,703 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:49,703 INFO L385 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-12-06 17:20:50,412 INFO L130 PetriNetUnfolder]: 4117/15464 cut-off events. [2022-12-06 17:20:50,412 INFO L131 PetriNetUnfolder]: For 325195/374998 co-relation queries the response was YES. [2022-12-06 17:20:50,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78840 conditions, 15464 events. 4117/15464 cut-off events. For 325195/374998 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 186167 event pairs, 911 based on Foata normal form. 432/14273 useless extension candidates. Maximal degree in co-relation 41735. Up to 4832 conditions per place. [2022-12-06 17:20:50,480 INFO L137 encePairwiseOnDemand]: 183/189 looper letters, 50 selfloop transitions, 4 changer transitions 724/973 dead transitions. [2022-12-06 17:20:50,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 973 transitions, 21921 flow [2022-12-06 17:20:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 17:20:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 17:20:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2022-12-06 17:20:50,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2022-12-06 17:20:50,482 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 107 predicate places. [2022-12-06 17:20:50,482 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 973 transitions, 21921 flow [2022-12-06 17:20:50,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:50,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:20:50,483 INFO L213 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] [2022-12-06 17:20:50,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 17:20:50,483 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:20:50,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:20:50,483 INFO L85 PathProgramCache]: Analyzing trace with hash -992513395, now seen corresponding path program 1 times [2022-12-06 17:20:50,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:20:50,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108443166] [2022-12-06 17:20:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:20:50,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:20:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:20:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:20:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:20:51,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108443166] [2022-12-06 17:20:51,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108443166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:20:51,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:20:51,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-06 17:20:51,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720054371] [2022-12-06 17:20:51,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:20:51,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 17:20:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:20:51,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 17:20:51,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-12-06 17:20:51,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 189 [2022-12-06 17:20:51,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 973 transitions, 21921 flow. Second operand has 28 states, 28 states have (on average 109.39285714285714) internal successors, (3063), 28 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:20:51,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:20:51,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 189 [2022-12-06 17:20:51,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:21:22,980 INFO L130 PetriNetUnfolder]: 42923/89231 cut-off events. [2022-12-06 17:21:22,981 INFO L131 PetriNetUnfolder]: For 907004/952391 co-relation queries the response was YES. [2022-12-06 17:21:23,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353530 conditions, 89231 events. 42923/89231 cut-off events. For 907004/952391 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 978866 event pairs, 10430 based on Foata normal form. 65/85692 useless extension candidates. Maximal degree in co-relation 252132. Up to 21324 conditions per place. [2022-12-06 17:21:23,590 INFO L137 encePairwiseOnDemand]: 152/189 looper letters, 1391 selfloop transitions, 103 changer transitions 1891/3500 dead transitions. [2022-12-06 17:21:23,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 3500 transitions, 56461 flow [2022-12-06 17:21:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2022-12-06 17:21:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2022-12-06 17:21:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 27372 transitions. [2022-12-06 17:21:23,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6085100706949447 [2022-12-06 17:21:23,627 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 344 predicate places. [2022-12-06 17:21:23,627 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 3500 transitions, 56461 flow [2022-12-06 17:21:23,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 109.39285714285714) internal successors, (3063), 28 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:21:23,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:21:23,629 INFO L213 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] [2022-12-06 17:21:23,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 17:21:23,629 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:21:23,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:21:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1758158421, now seen corresponding path program 2 times [2022-12-06 17:21:23,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:21:23,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99417760] [2022-12-06 17:21:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:21:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:21:24,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:21:24,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99417760] [2022-12-06 17:21:24,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99417760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:21:24,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:21:24,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-06 17:21:24,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523689841] [2022-12-06 17:21:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:21:24,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 17:21:24,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:21:24,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 17:21:24,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-12-06 17:21:24,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 189 [2022-12-06 17:21:24,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 3500 transitions, 56461 flow. Second operand has 28 states, 28 states have (on average 109.39285714285714) internal successors, (3063), 28 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:21:24,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:21:24,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 189 [2022-12-06 17:21:24,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:48,472 INFO L130 PetriNetUnfolder]: 90974/181805 cut-off events. [2022-12-06 17:22:48,472 INFO L131 PetriNetUnfolder]: For 1707463/1899023 co-relation queries the response was YES. [2022-12-06 17:22:49,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830165 conditions, 181805 events. 90974/181805 cut-off events. For 1707463/1899023 co-relation queries the response was YES. Maximal size of possible extension queue 3639. Compared 2093259 event pairs, 8555 based on Foata normal form. 301/175563 useless extension candidates. Maximal degree in co-relation 784925. Up to 44073 conditions per place. [2022-12-06 17:22:50,146 INFO L137 encePairwiseOnDemand]: 150/189 looper letters, 7082 selfloop transitions, 1039 changer transitions 2489/10719 dead transitions. [2022-12-06 17:22:50,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 10719 transitions, 142508 flow [2022-12-06 17:22:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2022-12-06 17:22:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2022-12-06 17:22:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 24677 transitions. [2022-12-06 17:22:50,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6044728591024887 [2022-12-06 17:22:50,177 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 559 predicate places. [2022-12-06 17:22:50,179 INFO L495 AbstractCegarLoop]: Abstraction has has 732 places, 10719 transitions, 142508 flow [2022-12-06 17:22:50,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 109.39285714285714) internal successors, (3063), 28 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:50,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:50,180 INFO L213 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] [2022-12-06 17:22:50,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 17:22:50,180 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:22:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 929729193, now seen corresponding path program 3 times [2022-12-06 17:22:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563276834] [2022-12-06 17:22:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563276834] [2022-12-06 17:22:50,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563276834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:22:50,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:22:50,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-06 17:22:50,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386091015] [2022-12-06 17:22:50,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:22:50,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 17:22:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 17:22:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-12-06 17:22:50,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 189 [2022-12-06 17:22:50,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 10719 transitions, 142508 flow. Second operand has 28 states, 28 states have (on average 109.39285714285714) internal successors, (3063), 28 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:22:50,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:50,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 189 [2022-12-06 17:22:50,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:26:23,858 INFO L130 PetriNetUnfolder]: 95575/190775 cut-off events. [2022-12-06 17:26:23,858 INFO L131 PetriNetUnfolder]: For 1807733/1912017 co-relation queries the response was YES. [2022-12-06 17:26:24,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022175 conditions, 190775 events. 95575/190775 cut-off events. For 1807733/1912017 co-relation queries the response was YES. Maximal size of possible extension queue 3883. Compared 2196770 event pairs, 4362 based on Foata normal form. 525/184764 useless extension candidates. Maximal degree in co-relation 770833. Up to 47600 conditions per place. [2022-12-06 17:26:25,554 INFO L137 encePairwiseOnDemand]: 150/189 looper letters, 16127 selfloop transitions, 2920 changer transitions 3553/22708 dead transitions. [2022-12-06 17:26:25,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 22708 transitions, 313010 flow [2022-12-06 17:26:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2022-12-06 17:26:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2022-12-06 17:26:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 27442 transitions. [2022-12-06 17:26:25,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6075136702751766 [2022-12-06 17:26:25,575 INFO L294 CegarLoopForPetriNet]: 173 programPoint places, 797 predicate places. [2022-12-06 17:26:25,575 INFO L495 AbstractCegarLoop]: Abstraction has has 970 places, 22708 transitions, 313010 flow [2022-12-06 17:26:25,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 109.39285714285714) internal successors, (3063), 28 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:26:25,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:26:25,576 INFO L213 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] [2022-12-06 17:26:25,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 17:26:25,577 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:26:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:26:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1235683785, now seen corresponding path program 4 times [2022-12-06 17:26:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:26:25,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248238742] [2022-12-06 17:26:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:26:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:26:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:26:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:26:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:26:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248238742] [2022-12-06 17:26:26,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248238742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:26:26,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:26:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-06 17:26:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475437780] [2022-12-06 17:26:26,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:26:26,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 17:26:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:26:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 17:26:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-12-06 17:26:26,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 189 [2022-12-06 17:26:26,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 22708 transitions, 313010 flow. Second operand has 28 states, 28 states have (on average 109.39285714285714) internal successors, (3063), 28 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:26:26,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:26:26,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 189 [2022-12-06 17:26:26,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 17:33:08,773 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:33:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-06 17:33:09,568 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 17:33:09,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 17:33:09,568 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 107/189 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 925827 conditions, 156856 events (80760/156855 cut-off events. For 1447277/1677602 co-relation queries the response was YES. Maximal size of possible extension queue 6091. Compared 1843141 event pairs, 3905 based on Foata normal form. 948/157834 useless extension candidates. Maximal degree in co-relation 804206. Up to 45451 conditions per place.). [2022-12-06 17:33:09,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 17:33:09,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 17:33:09,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 17:33:09,571 INFO L458 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1, 1] [2022-12-06 17:33:09,575 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 17:33:09,575 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 17:33:09,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:33:09 BasicIcfg [2022-12-06 17:33:09,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 17:33:09,579 INFO L158 Benchmark]: Toolchain (without parser) took 771091.91ms. Allocated memory was 189.8MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 166.0MB in the beginning and 463.4MB in the end (delta: -297.4MB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2022-12-06 17:33:09,579 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 189.8MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 17:33:09,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.84ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 154.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 17:33:09,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.10ms. Allocated memory is still 189.8MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:33:09,580 INFO L158 Benchmark]: Boogie Preprocessor took 26.94ms. Allocated memory is still 189.8MB. Free memory was 152.4MB in the beginning and 150.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 17:33:09,580 INFO L158 Benchmark]: RCFGBuilder took 604.51ms. Allocated memory is still 189.8MB. Free memory was 150.8MB in the beginning and 133.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 17:33:09,580 INFO L158 Benchmark]: TraceAbstraction took 770183.25ms. Allocated memory was 189.8MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 132.4MB in the beginning and 463.4MB in the end (delta: -331.0MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-06 17:33:09,582 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 189.8MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.84ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 154.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.10ms. Allocated memory is still 189.8MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.94ms. Allocated memory is still 189.8MB. Free memory was 152.4MB in the beginning and 150.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 604.51ms. Allocated memory is still 189.8MB. Free memory was 150.8MB in the beginning and 133.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 770183.25ms. Allocated memory was 189.8MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 132.4MB in the beginning and 463.4MB in the end (delta: -331.0MB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 107/189 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 925827 conditions, 156856 events (80760/156855 cut-off events. For 1447277/1677602 co-relation queries the response was YES. Maximal size of possible extension queue 6091. Compared 1843141 event pairs, 3905 based on Foata normal form. 948/157834 useless extension candidates. Maximal degree in co-relation 804206. Up to 45451 conditions per place.). - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 107/189 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 925827 conditions, 156856 events (80760/156855 cut-off events. For 1447277/1677602 co-relation queries the response was YES. Maximal size of possible extension queue 6091. Compared 1843141 event pairs, 3905 based on Foata normal form. 948/157834 useless extension candidates. Maximal degree in co-relation 804206. Up to 45451 conditions per place.). - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 107/189 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 925827 conditions, 156856 events (80760/156855 cut-off events. For 1447277/1677602 co-relation queries the response was YES. Maximal size of possible extension queue 6091. Compared 1843141 event pairs, 3905 based on Foata normal form. 948/157834 useless extension candidates. Maximal degree in co-relation 804206. Up to 45451 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 107/189 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 925827 conditions, 156856 events (80760/156855 cut-off events. For 1447277/1677602 co-relation queries the response was YES. Maximal size of possible extension queue 6091. Compared 1843141 event pairs, 3905 based on Foata normal form. 948/157834 useless extension candidates. Maximal degree in co-relation 804206. Up to 45451 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 273 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 770.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 764.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8849 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8849 mSDsluCounter, 38086 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35796 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14733 IncrementalHoareTripleChecker+Invalid, 14820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 2290 mSDtfsCounter, 14733 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 979 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70615 ImplicationChecksByTransitivity, 42.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313010occurred in iteration=17, InterpolantAutomatonStates: 814, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2086 NumberOfCodeBlocks, 2086 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2068 ConstructedInterpolants, 0 QuantifiedInterpolants, 6436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown