./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:04:57,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:04:57,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:04:57,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:04:57,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:04:57,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:04:57,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:04:57,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:04:57,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:04:57,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:04:57,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:04:57,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:04:57,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:04:57,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:04:57,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:04:57,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:04:57,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:04:57,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:04:57,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:04:57,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:04:57,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:04:57,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:04:57,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:04:57,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:04:57,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:04:57,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:04:57,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:04:57,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:04:57,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:04:57,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:04:57,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:04:57,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:04:57,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:04:57,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:04:57,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:04:57,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:04:57,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:04:57,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:04:57,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:04:57,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:04:57,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:04:57,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 03:04:57,556 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:04:57,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:04:57,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:04:57,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:04:57,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:04:57,559 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:04:57,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:04:57,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:04:57,560 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:04:57,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:04:57,560 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 03:04:57,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:04:57,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 03:04:57,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:04:57,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:04:57,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:04:57,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:04:57,561 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 03:04:57,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:04:57,561 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:04:57,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:04:57,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:04:57,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:04:57,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:04:57,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:04:57,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:04:57,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:04:57,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:04:57,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:04:57,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:04:57,563 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:04:57,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:04:57,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:04:57,563 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 [2021-12-28 03:04:57,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:04:57,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:04:57,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:04:57,822 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:04:57,822 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:04:57,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2021-12-28 03:04:57,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0a27846/1d3cd7c0460b4278b8294352e5eb9835/FLAG1afbcd8bd [2021-12-28 03:04:58,276 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:04:58,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2021-12-28 03:04:58,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0a27846/1d3cd7c0460b4278b8294352e5eb9835/FLAG1afbcd8bd [2021-12-28 03:04:58,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0a27846/1d3cd7c0460b4278b8294352e5eb9835 [2021-12-28 03:04:58,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:04:58,296 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:04:58,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:04:58,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:04:58,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:04:58,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c941e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58, skipping insertion in model container [2021-12-28 03:04:58,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:04:58,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:04:58,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2021-12-28 03:04:58,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:04:58,494 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:04:58,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2021-12-28 03:04:58,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:04:58,556 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:04:58,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58 WrapperNode [2021-12-28 03:04:58,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:04:58,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:04:58,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:04:58,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:04:58,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,598 INFO L137 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2021-12-28 03:04:58,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:04:58,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:04:58,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:04:58,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:04:58,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:04:58,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:04:58,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:04:58,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:04:58,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (1/1) ... [2021-12-28 03:04:58,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:04:58,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:04:58,672 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) [2021-12-28 03:04:58,732 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 [2021-12-28 03:04:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:04:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-28 03:04:58,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-28 03:04:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-28 03:04:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-28 03:04:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-28 03:04:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-28 03:04:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-28 03:04:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-28 03:04:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:04:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 03:04:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:04:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 03:04:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 03:04:58,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:04:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:04:58,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:04:58,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 03:04:58,754 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 03:04:58,824 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:04:58,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:04:59,042 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:04:59,093 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:04:59,093 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-28 03:04:59,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:04:59 BoogieIcfgContainer [2021-12-28 03:04:59,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:04:59,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:04:59,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:04:59,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:04:59,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:04:58" (1/3) ... [2021-12-28 03:04:59,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9010a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:04:59, skipping insertion in model container [2021-12-28 03:04:59,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:04:58" (2/3) ... [2021-12-28 03:04:59,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9010a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:04:59, skipping insertion in model container [2021-12-28 03:04:59,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:04:59" (3/3) ... [2021-12-28 03:04:59,101 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2021-12-28 03:04:59,104 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 03:04:59,104 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:04:59,105 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:04:59,105 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 03:04:59,130 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,130 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,130 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,131 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,131 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,131 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,132 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,133 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,133 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,133 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,133 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,134 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,134 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,140 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,140 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,140 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,141 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,141 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,141 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,141 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,142 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,142 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,142 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,142 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,142 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,144 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,144 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,144 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,144 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,145 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,145 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,145 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,145 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,147 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,147 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,147 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,148 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,148 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,148 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,149 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,149 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,159 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,159 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,159 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,160 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,160 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,160 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,160 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,160 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,161 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,161 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,161 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,161 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,163 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,164 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,164 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,164 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,164 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,165 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,165 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,165 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,167 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,167 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,168 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,168 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,168 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,170 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,170 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,170 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,171 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,171 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_~i~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,171 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,171 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,172 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,178 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:04:59,189 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-28 03:04:59,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:04:59,239 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:04:59,239 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-28 03:04:59,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 124 transitions, 280 flow [2021-12-28 03:04:59,302 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2021-12-28 03:04:59,302 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-28 03:04:59,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 9/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-12-28 03:04:59,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 124 transitions, 280 flow [2021-12-28 03:04:59,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 107 transitions, 238 flow [2021-12-28 03:04:59,340 INFO L129 PetriNetUnfolder]: 9/106 cut-off events. [2021-12-28 03:04:59,341 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-28 03:04:59,341 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:04:59,342 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:04:59,342 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:04:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:04:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -835718213, now seen corresponding path program 1 times [2021-12-28 03:04:59,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:04:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841982615] [2021-12-28 03:04:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:04:59,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:04:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:04:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:04:59,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:04:59,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841982615] [2021-12-28 03:04:59,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841982615] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:04:59,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:04:59,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:04:59,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724670389] [2021-12-28 03:04:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:04:59,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:04:59,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:04:59,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:04:59,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:04:59,696 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 124 [2021-12-28 03:04:59,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:04:59,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:04:59,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 124 [2021-12-28 03:04:59,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:04:59,841 INFO L129 PetriNetUnfolder]: 107/494 cut-off events. [2021-12-28 03:04:59,841 INFO L130 PetriNetUnfolder]: For 115/116 co-relation queries the response was YES. [2021-12-28 03:04:59,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 494 events. 107/494 cut-off events. For 115/116 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2247 event pairs, 24 based on Foata normal form. 136/564 useless extension candidates. Maximal degree in co-relation 525. Up to 124 conditions per place. [2021-12-28 03:04:59,848 INFO L132 encePairwiseOnDemand]: 109/124 looper letters, 32 selfloop transitions, 5 changer transitions 8/128 dead transitions. [2021-12-28 03:04:59,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 128 transitions, 406 flow [2021-12-28 03:04:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:04:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-28 03:04:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 856 transitions. [2021-12-28 03:04:59,861 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8629032258064516 [2021-12-28 03:04:59,861 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 856 transitions. [2021-12-28 03:04:59,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 856 transitions. [2021-12-28 03:04:59,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:04:59,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 856 transitions. [2021-12-28 03:04:59,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:04:59,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:04:59,878 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:04:59,879 INFO L186 Difference]: Start difference. First operand has 111 places, 107 transitions, 238 flow. Second operand 8 states and 856 transitions. [2021-12-28 03:04:59,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 128 transitions, 406 flow [2021-12-28 03:04:59,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 366 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-28 03:04:59,886 INFO L242 Difference]: Finished difference. Result has 114 places, 104 transitions, 249 flow [2021-12-28 03:04:59,888 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2021-12-28 03:04:59,890 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 3 predicate places. [2021-12-28 03:04:59,890 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 249 flow [2021-12-28 03:04:59,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.33333333333333) internal successors, (608), 6 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:04:59,891 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:04:59,891 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:04:59,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:04:59,892 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:04:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:04:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash 365170717, now seen corresponding path program 1 times [2021-12-28 03:04:59,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:04:59,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099495006] [2021-12-28 03:04:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:04:59,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:04:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:04:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:04:59,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:04:59,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099495006] [2021-12-28 03:04:59,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099495006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:04:59,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:04:59,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:04:59,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523488734] [2021-12-28 03:04:59,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:04:59,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:04:59,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:04:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:04:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:04:59,975 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:04:59,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:04:59,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:04:59,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:04:59,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:01,021 INFO L129 PetriNetUnfolder]: 6233/11726 cut-off events. [2021-12-28 03:05:01,022 INFO L130 PetriNetUnfolder]: For 1563/1563 co-relation queries the response was YES. [2021-12-28 03:05:01,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22312 conditions, 11726 events. 6233/11726 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 96468 event pairs, 2937 based on Foata normal form. 0/9031 useless extension candidates. Maximal degree in co-relation 22289. Up to 3632 conditions per place. [2021-12-28 03:05:01,139 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 83 selfloop transitions, 6 changer transitions 0/162 dead transitions. [2021-12-28 03:05:01,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 162 transitions, 602 flow [2021-12-28 03:05:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:05:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-28 03:05:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2021-12-28 03:05:01,146 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-12-28 03:05:01,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 620 transitions. [2021-12-28 03:05:01,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 620 transitions. [2021-12-28 03:05:01,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:01,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 620 transitions. [2021-12-28 03:05:01,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:01,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:01,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:01,149 INFO L186 Difference]: Start difference. First operand has 114 places, 104 transitions, 249 flow. Second operand 6 states and 620 transitions. [2021-12-28 03:05:01,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 162 transitions, 602 flow [2021-12-28 03:05:01,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 162 transitions, 598 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-28 03:05:01,156 INFO L242 Difference]: Finished difference. Result has 115 places, 107 transitions, 277 flow [2021-12-28 03:05:01,156 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2021-12-28 03:05:01,157 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2021-12-28 03:05:01,157 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 277 flow [2021-12-28 03:05:01,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:01,158 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:01,158 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:01,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:05:01,158 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1177269511, now seen corresponding path program 2 times [2021-12-28 03:05:01,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:01,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674960819] [2021-12-28 03:05:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:01,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:01,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:01,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674960819] [2021-12-28 03:05:01,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674960819] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:05:01,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435263687] [2021-12-28 03:05:01,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 03:05:01,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:05:01,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:05:01,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:05:01,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 03:05:01,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 03:05:01,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 03:05:01,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 03:05:01,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:05:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:01,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:05:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:01,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435263687] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:05:01,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:05:01,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-28 03:05:01,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647867665] [2021-12-28 03:05:01,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:05:01,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:05:01,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:05:01,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:05:01,728 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:01,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 277 flow. Second operand has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:01,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:01,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:01,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:02,963 INFO L129 PetriNetUnfolder]: 10141/15803 cut-off events. [2021-12-28 03:05:02,963 INFO L130 PetriNetUnfolder]: For 5123/5155 co-relation queries the response was YES. [2021-12-28 03:05:02,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35365 conditions, 15803 events. 10141/15803 cut-off events. For 5123/5155 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 113133 event pairs, 1088 based on Foata normal form. 192/13136 useless extension candidates. Maximal degree in co-relation 29374. Up to 2334 conditions per place. [2021-12-28 03:05:03,056 INFO L132 encePairwiseOnDemand]: 116/124 looper letters, 177 selfloop transitions, 28 changer transitions 1/279 dead transitions. [2021-12-28 03:05:03,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 279 transitions, 1237 flow [2021-12-28 03:05:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 03:05:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-28 03:05:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1452 transitions. [2021-12-28 03:05:03,059 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.836405529953917 [2021-12-28 03:05:03,059 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1452 transitions. [2021-12-28 03:05:03,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1452 transitions. [2021-12-28 03:05:03,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:03,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1452 transitions. [2021-12-28 03:05:03,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 103.71428571428571) internal successors, (1452), 14 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:03,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 124.0) internal successors, (1860), 15 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:03,065 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 124.0) internal successors, (1860), 15 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:03,065 INFO L186 Difference]: Start difference. First operand has 115 places, 107 transitions, 277 flow. Second operand 14 states and 1452 transitions. [2021-12-28 03:05:03,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 279 transitions, 1237 flow [2021-12-28 03:05:03,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 279 transitions, 1222 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-28 03:05:03,075 INFO L242 Difference]: Finished difference. Result has 133 places, 135 transitions, 470 flow [2021-12-28 03:05:03,075 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=470, PETRI_PLACES=133, PETRI_TRANSITIONS=135} [2021-12-28 03:05:03,076 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 22 predicate places. [2021-12-28 03:05:03,076 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 135 transitions, 470 flow [2021-12-28 03:05:03,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.11111111111111) internal successors, (838), 9 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:03,077 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:03,077 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:03,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 03:05:03,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:05:03,292 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash -290999237, now seen corresponding path program 3 times [2021-12-28 03:05:03,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:03,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287834169] [2021-12-28 03:05:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:03,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:03,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:03,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287834169] [2021-12-28 03:05:03,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287834169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:05:03,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:05:03,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:05:03,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796161180] [2021-12-28 03:05:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:05:03,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:05:03,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:05:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:05:03,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:03,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 135 transitions, 470 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:03,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:03,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:03,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:05,620 INFO L129 PetriNetUnfolder]: 13768/22840 cut-off events. [2021-12-28 03:05:05,621 INFO L130 PetriNetUnfolder]: For 26912/28031 co-relation queries the response was YES. [2021-12-28 03:05:05,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58648 conditions, 22840 events. 13768/22840 cut-off events. For 26912/28031 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 188633 event pairs, 4285 based on Foata normal form. 1060/20635 useless extension candidates. Maximal degree in co-relation 43866. Up to 9840 conditions per place. [2021-12-28 03:05:05,798 INFO L132 encePairwiseOnDemand]: 116/124 looper letters, 115 selfloop transitions, 21 changer transitions 1/222 dead transitions. [2021-12-28 03:05:05,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 222 transitions, 1098 flow [2021-12-28 03:05:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:05:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-28 03:05:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2021-12-28 03:05:05,801 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8629032258064516 [2021-12-28 03:05:05,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2021-12-28 03:05:05,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2021-12-28 03:05:05,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:05,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2021-12-28 03:05:05,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:05,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:05,804 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:05,805 INFO L186 Difference]: Start difference. First operand has 133 places, 135 transitions, 470 flow. Second operand 6 states and 642 transitions. [2021-12-28 03:05:05,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 222 transitions, 1098 flow [2021-12-28 03:05:05,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 222 transitions, 1092 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-12-28 03:05:05,874 INFO L242 Difference]: Finished difference. Result has 140 places, 149 transitions, 594 flow [2021-12-28 03:05:05,874 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=140, PETRI_TRANSITIONS=149} [2021-12-28 03:05:05,875 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 29 predicate places. [2021-12-28 03:05:05,875 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 149 transitions, 594 flow [2021-12-28 03:05:05,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:05,875 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:05,876 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:05,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:05:05,876 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash -551484583, now seen corresponding path program 1 times [2021-12-28 03:05:05,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:05,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255238308] [2021-12-28 03:05:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:05,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:05,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:05,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255238308] [2021-12-28 03:05:05,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255238308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:05:05,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:05:05,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:05:05,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109662114] [2021-12-28 03:05:05,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:05:05,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:05:05,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:05,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:05:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:05:05,931 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:05,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 149 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:05,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:05,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:05,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:08,255 INFO L129 PetriNetUnfolder]: 16121/28229 cut-off events. [2021-12-28 03:05:08,255 INFO L130 PetriNetUnfolder]: For 39584/41423 co-relation queries the response was YES. [2021-12-28 03:05:08,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77396 conditions, 28229 events. 16121/28229 cut-off events. For 39584/41423 co-relation queries the response was YES. Maximal size of possible extension queue 1663. Compared 256255 event pairs, 7338 based on Foata normal form. 1500/28138 useless extension candidates. Maximal degree in co-relation 58149. Up to 11933 conditions per place. [2021-12-28 03:05:08,448 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 74 selfloop transitions, 19 changer transitions 13/195 dead transitions. [2021-12-28 03:05:08,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 195 transitions, 985 flow [2021-12-28 03:05:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:05:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-28 03:05:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2021-12-28 03:05:08,451 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8293010752688172 [2021-12-28 03:05:08,451 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 617 transitions. [2021-12-28 03:05:08,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 617 transitions. [2021-12-28 03:05:08,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:08,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 617 transitions. [2021-12-28 03:05:08,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:08,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:08,453 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:08,454 INFO L186 Difference]: Start difference. First operand has 140 places, 149 transitions, 594 flow. Second operand 6 states and 617 transitions. [2021-12-28 03:05:08,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 195 transitions, 985 flow [2021-12-28 03:05:08,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 195 transitions, 983 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-12-28 03:05:08,589 INFO L242 Difference]: Finished difference. Result has 147 places, 149 transitions, 639 flow [2021-12-28 03:05:08,589 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=147, PETRI_TRANSITIONS=149} [2021-12-28 03:05:08,592 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 36 predicate places. [2021-12-28 03:05:08,592 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 639 flow [2021-12-28 03:05:08,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:08,592 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:08,592 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:08,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:05:08,593 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:08,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:08,593 INFO L85 PathProgramCache]: Analyzing trace with hash -453112731, now seen corresponding path program 4 times [2021-12-28 03:05:08,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:08,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885738116] [2021-12-28 03:05:08,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:08,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:08,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:08,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885738116] [2021-12-28 03:05:08,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885738116] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:05:08,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559423291] [2021-12-28 03:05:08,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-28 03:05:08,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:05:08,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:05:08,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:05:08,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 03:05:08,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-28 03:05:08,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 03:05:08,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 03:05:08,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:05:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:08,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:05:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:08,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559423291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:05:08,991 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:05:08,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-28 03:05:08,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773594422] [2021-12-28 03:05:08,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:05:08,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:05:08,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:05:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:05:08,994 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:08,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 639 flow. Second operand has 11 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:08,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:08,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:08,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:11,477 INFO L129 PetriNetUnfolder]: 18450/33118 cut-off events. [2021-12-28 03:05:11,477 INFO L130 PetriNetUnfolder]: For 49627/50222 co-relation queries the response was YES. [2021-12-28 03:05:11,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90983 conditions, 33118 events. 18450/33118 cut-off events. For 49627/50222 co-relation queries the response was YES. Maximal size of possible extension queue 1889. Compared 309695 event pairs, 4958 based on Foata normal form. 668/32188 useless extension candidates. Maximal degree in co-relation 69617. Up to 7001 conditions per place. [2021-12-28 03:05:11,908 INFO L132 encePairwiseOnDemand]: 116/124 looper letters, 176 selfloop transitions, 46 changer transitions 0/299 dead transitions. [2021-12-28 03:05:11,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 299 transitions, 1847 flow [2021-12-28 03:05:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:05:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 03:05:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 956 transitions. [2021-12-28 03:05:11,935 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8566308243727598 [2021-12-28 03:05:11,935 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 956 transitions. [2021-12-28 03:05:11,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 956 transitions. [2021-12-28 03:05:11,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:11,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 956 transitions. [2021-12-28 03:05:11,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:11,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:11,941 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:11,942 INFO L186 Difference]: Start difference. First operand has 147 places, 149 transitions, 639 flow. Second operand 9 states and 956 transitions. [2021-12-28 03:05:11,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 299 transitions, 1847 flow [2021-12-28 03:05:12,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 299 transitions, 1799 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-12-28 03:05:12,185 INFO L242 Difference]: Finished difference. Result has 156 places, 171 transitions, 954 flow [2021-12-28 03:05:12,185 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=954, PETRI_PLACES=156, PETRI_TRANSITIONS=171} [2021-12-28 03:05:12,187 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 45 predicate places. [2021-12-28 03:05:12,188 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 171 transitions, 954 flow [2021-12-28 03:05:12,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.36363636363636) internal successors, (1027), 11 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:12,189 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:12,189 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:12,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 03:05:12,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 03:05:12,390 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -584767227, now seen corresponding path program 2 times [2021-12-28 03:05:12,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:12,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310217107] [2021-12-28 03:05:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:12,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:12,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:12,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310217107] [2021-12-28 03:05:12,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310217107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:05:12,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:05:12,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:05:12,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091676266] [2021-12-28 03:05:12,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:05:12,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:05:12,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:12,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:05:12,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:05:12,446 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:12,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 171 transitions, 954 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:12,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:12,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:12,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:18,339 INFO L129 PetriNetUnfolder]: 36954/61959 cut-off events. [2021-12-28 03:05:18,340 INFO L130 PetriNetUnfolder]: For 183796/188821 co-relation queries the response was YES. [2021-12-28 03:05:18,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192980 conditions, 61959 events. 36954/61959 cut-off events. For 183796/188821 co-relation queries the response was YES. Maximal size of possible extension queue 3160. Compared 589323 event pairs, 14655 based on Foata normal form. 4613/63292 useless extension candidates. Maximal degree in co-relation 142433. Up to 25194 conditions per place. [2021-12-28 03:05:19,135 INFO L132 encePairwiseOnDemand]: 118/124 looper letters, 224 selfloop transitions, 23 changer transitions 4/344 dead transitions. [2021-12-28 03:05:19,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 344 transitions, 2927 flow [2021-12-28 03:05:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:05:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-28 03:05:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2021-12-28 03:05:19,137 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8548387096774194 [2021-12-28 03:05:19,138 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2021-12-28 03:05:19,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2021-12-28 03:05:19,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:19,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2021-12-28 03:05:19,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:19,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:19,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:19,141 INFO L186 Difference]: Start difference. First operand has 156 places, 171 transitions, 954 flow. Second operand 5 states and 530 transitions. [2021-12-28 03:05:19,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 344 transitions, 2927 flow [2021-12-28 03:05:19,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 344 transitions, 2911 flow, removed 8 selfloop flow, removed 0 redundant places. [2021-12-28 03:05:19,572 INFO L242 Difference]: Finished difference. Result has 163 places, 192 transitions, 1297 flow [2021-12-28 03:05:19,573 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1297, PETRI_PLACES=163, PETRI_TRANSITIONS=192} [2021-12-28 03:05:19,573 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 52 predicate places. [2021-12-28 03:05:19,573 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 192 transitions, 1297 flow [2021-12-28 03:05:19,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:19,574 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:19,574 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:19,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 03:05:19,574 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1402727025, now seen corresponding path program 3 times [2021-12-28 03:05:19,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:19,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156651579] [2021-12-28 03:05:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:19,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:19,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:19,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156651579] [2021-12-28 03:05:19,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156651579] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:05:19,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:05:19,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:05:19,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032547202] [2021-12-28 03:05:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:05:19,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:05:19,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:05:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:05:19,619 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:19,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 192 transitions, 1297 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:19,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:19,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:19,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:25,437 INFO L129 PetriNetUnfolder]: 34646/62394 cut-off events. [2021-12-28 03:05:25,438 INFO L130 PetriNetUnfolder]: For 158440/160141 co-relation queries the response was YES. [2021-12-28 03:05:26,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197837 conditions, 62394 events. 34646/62394 cut-off events. For 158440/160141 co-relation queries the response was YES. Maximal size of possible extension queue 3110. Compared 649967 event pairs, 11610 based on Foata normal form. 1033/62297 useless extension candidates. Maximal degree in co-relation 175462. Up to 24446 conditions per place. [2021-12-28 03:05:26,379 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 136 selfloop transitions, 18 changer transitions 3/271 dead transitions. [2021-12-28 03:05:26,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 271 transitions, 2059 flow [2021-12-28 03:05:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:05:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-28 03:05:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2021-12-28 03:05:26,381 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.831989247311828 [2021-12-28 03:05:26,381 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 619 transitions. [2021-12-28 03:05:26,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 619 transitions. [2021-12-28 03:05:26,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:26,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 619 transitions. [2021-12-28 03:05:26,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:26,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:26,384 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:26,384 INFO L186 Difference]: Start difference. First operand has 163 places, 192 transitions, 1297 flow. Second operand 6 states and 619 transitions. [2021-12-28 03:05:26,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 271 transitions, 2059 flow [2021-12-28 03:05:27,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 271 transitions, 2059 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-28 03:05:27,820 INFO L242 Difference]: Finished difference. Result has 170 places, 193 transitions, 1347 flow [2021-12-28 03:05:27,821 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1347, PETRI_PLACES=170, PETRI_TRANSITIONS=193} [2021-12-28 03:05:27,821 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 59 predicate places. [2021-12-28 03:05:27,821 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 193 transitions, 1347 flow [2021-12-28 03:05:27,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:27,822 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:27,822 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:27,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:05:27,822 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1376975019, now seen corresponding path program 4 times [2021-12-28 03:05:27,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:27,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232836826] [2021-12-28 03:05:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:27,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:27,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:27,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232836826] [2021-12-28 03:05:27,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232836826] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:05:27,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:05:27,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:05:27,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057508813] [2021-12-28 03:05:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:05:27,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:05:27,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:27,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:05:27,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:05:27,857 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:27,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 193 transitions, 1347 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:27,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:27,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:27,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:05:29,459 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-28 03:05:29,460 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-28 03:05:29,460 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:29,460 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:29,460 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:29,747 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:29,748 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,748 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,748 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,748 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,751 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-28 03:05:29,751 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,751 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,751 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,751 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,752 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, 40#L41-3true, 25#L65true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-28 03:05:29,752 INFO L384 tUnfolder$Statistics]: this new event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,752 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,752 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:29,752 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:30,308 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 33#L73true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:30,309 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,309 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,309 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,309 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,310 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, 25#L65true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:30,310 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,310 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,310 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,310 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,312 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-28 03:05:30,312 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,312 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,312 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,313 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,313 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), 705#true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-28 03:05:30,313 INFO L384 tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,313 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,313 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,313 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:30,647 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 705#true, 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:30,647 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,648 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,648 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,648 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,648 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 25#L65true, 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:30,648 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,648 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,648 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,649 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,651 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][211], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 32#L52true, 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 40#L41-3true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 705#true, 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0))]) [2021-12-28 03:05:30,651 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,651 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,651 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,651 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-28 03:05:30,725 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 131#true, Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1260#true, Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 82#thread3ENTRYtrue, Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:30,726 INFO L384 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2021-12-28 03:05:30,726 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-12-28 03:05:30,726 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-12-28 03:05:30,726 INFO L387 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2021-12-28 03:05:31,276 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 83#L62-2true, Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:31,277 INFO L384 tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event [2021-12-28 03:05:31,277 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-28 03:05:31,277 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-28 03:05:31,277 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-28 03:05:31,364 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 56#L62-4true, 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:31,364 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-28 03:05:31,364 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:31,364 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:31,364 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:31,365 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 111#L51-4true, Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 131#true, Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1260#true, Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 82#thread3ENTRYtrue, Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:31,365 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-28 03:05:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:31,365 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-28 03:05:31,775 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 11#L62-5true, Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:31,775 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-28 03:05:31,776 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,776 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,776 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,776 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 131#true, Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 52#L63true, 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 116#L76true, Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:31,776 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-28 03:05:31,776 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,777 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,777 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,777 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 56#L62-4true, 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 705#true, 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:31,777 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-28 03:05:31,777 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,777 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:31,778 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-28 03:05:32,193 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), Black: 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 705#true, 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 12#L41-5true, 11#L62-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:32,193 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-28 03:05:32,194 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:32,194 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:32,194 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:32,194 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([340] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][212], [Black: 166#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), 111#L51-4true, Black: 1275#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), Black: 1278#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 20#L72-2true, 729#(= |thread2Thread1of1ForFork3_~i~1#1| 0), 1271#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 708#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 131#true, Black: 711#(and (= |thread4Thread1of1ForFork2_~i~3#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 152#(= |thread2Thread1of1ForFork3_~i~1#1| 0), Black: 138#(and (= ~counter2~0 ~counter1~0) (= ~counter1~0 0)), Black: 133#(= ~counter1~0 0), Black: 721#(and (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 156#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0)), 8#L91-4true, Black: 158#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= ~N~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 732#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0)), Black: 730#(and (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1249#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), Black: 731#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), 52#L63true, 1263#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1264#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1262#(= thread3Thread1of1ForFork0_~i~2 0), 1285#(= |thread4Thread1of1ForFork2_~i~3#1| 0), 705#true, 694#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (<= 0 thread1Thread1of1ForFork1_~i~0)), 12#L41-5true, Black: 690#(and (<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 686#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 165#(= thread1Thread1of1ForFork1_~i~0 0), Black: 688#(and (< |thread2Thread1of1ForFork3_~i~1#1| ~N~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 168#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~i~1#1| 0))]) [2021-12-28 03:05:32,194 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-28 03:05:32,194 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:32,195 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:32,195 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-28 03:05:36,134 INFO L129 PetriNetUnfolder]: 49827/85142 cut-off events. [2021-12-28 03:05:36,135 INFO L130 PetriNetUnfolder]: For 326628/335574 co-relation queries the response was YES. [2021-12-28 03:05:37,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283664 conditions, 85142 events. 49827/85142 cut-off events. For 326628/335574 co-relation queries the response was YES. Maximal size of possible extension queue 4121. Compared 851886 event pairs, 20637 based on Foata normal form. 5633/88499 useless extension candidates. Maximal degree in co-relation 245112. Up to 33868 conditions per place. [2021-12-28 03:05:37,510 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 187 selfloop transitions, 12 changer transitions 6/331 dead transitions. [2021-12-28 03:05:37,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 331 transitions, 2757 flow [2021-12-28 03:05:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:05:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-28 03:05:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2021-12-28 03:05:37,515 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8279569892473119 [2021-12-28 03:05:37,515 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2021-12-28 03:05:37,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2021-12-28 03:05:37,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:05:37,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2021-12-28 03:05:37,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:37,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:37,518 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:37,518 INFO L186 Difference]: Start difference. First operand has 170 places, 193 transitions, 1347 flow. Second operand 6 states and 616 transitions. [2021-12-28 03:05:37,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 331 transitions, 2757 flow [2021-12-28 03:05:38,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 331 transitions, 2721 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-28 03:05:38,570 INFO L242 Difference]: Finished difference. Result has 175 places, 196 transitions, 1377 flow [2021-12-28 03:05:38,571 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1377, PETRI_PLACES=175, PETRI_TRANSITIONS=196} [2021-12-28 03:05:38,571 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 64 predicate places. [2021-12-28 03:05:38,571 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 196 transitions, 1377 flow [2021-12-28 03:05:38,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:38,572 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:05:38,572 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:05:38,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 03:05:38,572 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:05:38,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:05:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1176667927, now seen corresponding path program 5 times [2021-12-28 03:05:38,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:05:38,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359112324] [2021-12-28 03:05:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:05:38,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:05:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:05:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:05:38,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:05:38,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359112324] [2021-12-28 03:05:38,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359112324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:05:38,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:05:38,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:05:38,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114772123] [2021-12-28 03:05:38,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:05:38,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:05:38,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:05:38,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:05:38,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:05:38,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 124 [2021-12-28 03:05:38,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 196 transitions, 1377 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:05:38,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:05:38,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 124 [2021-12-28 03:05:38,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand