./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/mult-flipped-dist.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 0d10bf8c0e842192a13f4b6638f03cf57668d5bee07d0b49c4b595de1c605066 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:48:58,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:48:58,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:48:58,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:48:58,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:48:58,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:48:58,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:48:58,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:48:58,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:48:58,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:48:58,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:48:58,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:48:58,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:48:58,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:48:58,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:48:58,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:48:58,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:48:58,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:48:58,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:48:58,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:48:58,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:48:58,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:48:58,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:48:58,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:48:58,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:48:58,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:48:58,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:48:58,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:48:58,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:48:58,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:48:58,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:48:58,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:48:58,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:48:58,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:48:58,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:48:58,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:48:58,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:48:58,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:48:58,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:48:58,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:48:58,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:48:58,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:48:58,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:48:58,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:48:58,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:48:58,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:48:58,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:48:58,415 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:48:58,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:48:58,416 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:48:58,416 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:48:58,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:48:58,417 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:48:58,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:48:58,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:48:58,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:48:58,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:48:58,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:48:58,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:48:58,419 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:48:58,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:48:58,419 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:48:58,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:48:58,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:48:58,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:48:58,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:48:58,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:48:58,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:48:58,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:48:58,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:48:58,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:48:58,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:48:58,422 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:48:58,422 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:48:58,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:48:58,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:48:58,423 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 -> 0d10bf8c0e842192a13f4b6638f03cf57668d5bee07d0b49c4b595de1c605066 [2021-12-17 22:48:58,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:48:58,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:48:58,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:48:58,723 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:48:58,724 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:48:58,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2021-12-17 22:48:58,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c317b3f5c/2d46617bc4b44c4c8e9121153c5fa11a/FLAGa96c73aec [2021-12-17 22:48:59,259 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:48:59,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2021-12-17 22:48:59,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c317b3f5c/2d46617bc4b44c4c8e9121153c5fa11a/FLAGa96c73aec [2021-12-17 22:48:59,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c317b3f5c/2d46617bc4b44c4c8e9121153c5fa11a [2021-12-17 22:48:59,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:48:59,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:48:59,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:48:59,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:48:59,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:48:59,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1256f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59, skipping insertion in model container [2021-12-17 22:48:59,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:48:59,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:48:59,479 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/mult-flipped-dist.wvr.c[2135,2148] [2021-12-17 22:48:59,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:48:59,497 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:48:59,532 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/mult-flipped-dist.wvr.c[2135,2148] [2021-12-17 22:48:59,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:48:59,544 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:48:59,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59 WrapperNode [2021-12-17 22:48:59,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:48:59,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:48:59,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:48:59,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:48:59,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,593 INFO L137 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2021-12-17 22:48:59,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:48:59,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:48:59,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:48:59,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:48:59,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:48:59,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:48:59,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:48:59,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:48:59,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (1/1) ... [2021-12-17 22:48:59,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:48:59,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:48:59,661 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-17 22:48:59,667 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-17 22:48:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:48:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-17 22:48:59,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-17 22:48:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-17 22:48:59,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-17 22:48:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-17 22:48:59,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-17 22:48:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:48:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:48:59,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:48:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:48:59,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:48:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 22:48:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:48:59,702 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:48:59,806 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:48:59,808 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:49:00,049 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:49:00,056 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:49:00,069 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-17 22:49:00,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:49:00 BoogieIcfgContainer [2021-12-17 22:49:00,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:49:00,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:49:00,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:49:00,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:49:00,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:48:59" (1/3) ... [2021-12-17 22:49:00,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1e32dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:49:00, skipping insertion in model container [2021-12-17 22:49:00,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:48:59" (2/3) ... [2021-12-17 22:49:00,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1e32dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:49:00, skipping insertion in model container [2021-12-17 22:49:00,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:49:00" (3/3) ... [2021-12-17 22:49:00,093 INFO L111 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2021-12-17 22:49:00,098 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:49:00,099 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:49:00,099 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 22:49:00,099 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:49:00,126 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,127 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,127 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,128 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,128 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,128 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,129 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,130 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,130 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,131 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,132 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,132 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,132 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,132 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,132 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,133 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,134 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,134 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,135 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,135 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,136 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,136 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,137 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,137 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,137 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,137 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,139 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,139 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,140 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,140 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,140 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,140 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,140 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,145 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,146 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,146 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,146 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,149 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,149 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,150 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,151 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:49:00,154 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-17 22:49:00,217 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:49:00,233 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-17 22:49:00,233 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-17 22:49:00,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 238 flow [2021-12-17 22:49:00,313 INFO L129 PetriNetUnfolder]: 7/104 cut-off events. [2021-12-17 22:49:00,314 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:49:00,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 7/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2021-12-17 22:49:00,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 238 flow [2021-12-17 22:49:00,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 204 flow [2021-12-17 22:49:00,358 INFO L129 PetriNetUnfolder]: 7/92 cut-off events. [2021-12-17 22:49:00,358 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:49:00,359 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:00,360 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] [2021-12-17 22:49:00,361 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 588643027, now seen corresponding path program 1 times [2021-12-17 22:49:00,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:00,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238622093] [2021-12-17 22:49:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:00,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:00,552 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-17 22:49:00,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:00,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238622093] [2021-12-17 22:49:00,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238622093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:00,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:00,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:49:00,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621921663] [2021-12-17 22:49:00,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:00,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 22:49:00,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 22:49:00,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 22:49:00,610 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2021-12-17 22:49:00,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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-17 22:49:00,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:00,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2021-12-17 22:49:00,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:00,684 INFO L129 PetriNetUnfolder]: 3/89 cut-off events. [2021-12-17 22:49:00,684 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-12-17 22:49:00,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 89 events. 3/89 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 10/95 useless extension candidates. Maximal degree in co-relation 66. Up to 7 conditions per place. [2021-12-17 22:49:00,687 INFO L132 encePairwiseOnDemand]: 103/107 looper letters, 6 selfloop transitions, 0 changer transitions 1/89 dead transitions. [2021-12-17 22:49:00,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 208 flow [2021-12-17 22:49:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 22:49:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 22:49:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2021-12-17 22:49:00,701 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9439252336448598 [2021-12-17 22:49:00,702 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2021-12-17 22:49:00,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2021-12-17 22:49:00,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:00,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2021-12-17 22:49:00,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 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-17 22:49:00,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-17 22:49:00,720 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-17 22:49:00,721 INFO L186 Difference]: Start difference. First operand has 96 places, 93 transitions, 204 flow. Second operand 2 states and 202 transitions. [2021-12-17 22:49:00,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 208 flow [2021-12-17 22:49:00,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-17 22:49:00,730 INFO L242 Difference]: Finished difference. Result has 91 places, 88 transitions, 182 flow [2021-12-17 22:49:00,732 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2021-12-17 22:49:00,736 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2021-12-17 22:49:00,737 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 182 flow [2021-12-17 22:49:00,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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-17 22:49:00,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:00,738 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] [2021-12-17 22:49:00,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:49:00,739 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash -129768965, now seen corresponding path program 1 times [2021-12-17 22:49:00,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:00,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170338140] [2021-12-17 22:49:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:00,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:01,046 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-17 22:49:01,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:01,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170338140] [2021-12-17 22:49:01,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170338140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:01,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:01,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:49:01,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667906309] [2021-12-17 22:49:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:01,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:49:01,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:01,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:49:01,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:49:01,058 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-17 22:49:01,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 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-17 22:49:01,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:01,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-17 22:49:01,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:01,256 INFO L129 PetriNetUnfolder]: 53/322 cut-off events. [2021-12-17 22:49:01,256 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-12-17 22:49:01,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 322 events. 53/322 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1267 event pairs, 7 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 432. Up to 52 conditions per place. [2021-12-17 22:49:01,263 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 35 selfloop transitions, 9 changer transitions 4/120 dead transitions. [2021-12-17 22:49:01,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 354 flow [2021-12-17 22:49:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:49:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:49:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2021-12-17 22:49:01,268 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2021-12-17 22:49:01,268 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2021-12-17 22:49:01,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2021-12-17 22:49:01,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:01,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2021-12-17 22:49:01,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 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-17 22:49:01,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 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-17 22:49:01,276 INFO L81 ComplementDD]: Finished complementDD. Result has 8 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-17 22:49:01,276 INFO L186 Difference]: Start difference. First operand has 91 places, 88 transitions, 182 flow. Second operand 7 states and 644 transitions. [2021-12-17 22:49:01,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 354 flow [2021-12-17 22:49:01,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 120 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 22:49:01,282 INFO L242 Difference]: Finished difference. Result has 100 places, 94 transitions, 235 flow [2021-12-17 22:49:01,282 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2021-12-17 22:49:01,284 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2021-12-17 22:49:01,284 INFO L470 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 235 flow [2021-12-17 22:49:01,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.85714285714286) internal successors, (608), 7 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-17 22:49:01,285 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:01,285 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] [2021-12-17 22:49:01,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:49:01,286 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash 891063948, now seen corresponding path program 1 times [2021-12-17 22:49:01,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:01,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9457832] [2021-12-17 22:49:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:01,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:01,402 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-17 22:49:01,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:01,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9457832] [2021-12-17 22:49:01,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9457832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:01,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:01,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:49:01,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608103927] [2021-12-17 22:49:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:01,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:49:01,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:49:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:49:01,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-17 22:49:01,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-17 22:49:01,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:01,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-17 22:49:01,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:01,696 INFO L129 PetriNetUnfolder]: 877/2022 cut-off events. [2021-12-17 22:49:01,696 INFO L130 PetriNetUnfolder]: For 171/172 co-relation queries the response was YES. [2021-12-17 22:49:01,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 2022 events. 877/2022 cut-off events. For 171/172 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14780 event pairs, 392 based on Foata normal form. 0/1584 useless extension candidates. Maximal degree in co-relation 3667. Up to 807 conditions per place. [2021-12-17 22:49:01,717 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 40 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2021-12-17 22:49:01,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 387 flow [2021-12-17 22:49:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:49:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:49:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2021-12-17 22:49:01,721 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2021-12-17 22:49:01,721 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2021-12-17 22:49:01,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2021-12-17 22:49:01,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:01,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2021-12-17 22:49:01,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 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-17 22:49:01,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:01,725 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:01,725 INFO L186 Difference]: Start difference. First operand has 100 places, 94 transitions, 235 flow. Second operand 6 states and 542 transitions. [2021-12-17 22:49:01,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 387 flow [2021-12-17 22:49:01,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 383 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-17 22:49:01,735 INFO L242 Difference]: Finished difference. Result has 104 places, 97 transitions, 269 flow [2021-12-17 22:49:01,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=104, PETRI_TRANSITIONS=97} [2021-12-17 22:49:01,737 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2021-12-17 22:49:01,737 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 97 transitions, 269 flow [2021-12-17 22:49:01,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-17 22:49:01,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:01,739 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] [2021-12-17 22:49:01,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:49:01,739 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:01,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1819342954, now seen corresponding path program 2 times [2021-12-17 22:49:01,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:01,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987136060] [2021-12-17 22:49:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:01,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:01,887 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-17 22:49:01,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:01,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987136060] [2021-12-17 22:49:01,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987136060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:01,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:01,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 22:49:01,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801497165] [2021-12-17 22:49:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:01,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 22:49:01,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:01,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 22:49:01,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 22:49:01,895 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-17 22:49:01,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 97 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:01,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:01,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-17 22:49:01,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:02,205 INFO L129 PetriNetUnfolder]: 901/2408 cut-off events. [2021-12-17 22:49:02,205 INFO L130 PetriNetUnfolder]: For 1120/1233 co-relation queries the response was YES. [2021-12-17 22:49:02,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5073 conditions, 2408 events. 901/2408 cut-off events. For 1120/1233 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 20139 event pairs, 347 based on Foata normal form. 96/2344 useless extension candidates. Maximal degree in co-relation 5063. Up to 915 conditions per place. [2021-12-17 22:49:02,228 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 33 selfloop transitions, 5 changer transitions 2/119 dead transitions. [2021-12-17 22:49:02,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 426 flow [2021-12-17 22:49:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 22:49:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 22:49:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-12-17 22:49:02,230 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2021-12-17 22:49:02,230 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-12-17 22:49:02,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-12-17 22:49:02,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:02,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-12-17 22:49:02,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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-17 22:49:02,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:02,251 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:02,252 INFO L186 Difference]: Start difference. First operand has 104 places, 97 transitions, 269 flow. Second operand 4 states and 379 transitions. [2021-12-17 22:49:02,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 426 flow [2021-12-17 22:49:02,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:49:02,257 INFO L242 Difference]: Finished difference. Result has 108 places, 102 transitions, 313 flow [2021-12-17 22:49:02,257 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2021-12-17 22:49:02,258 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2021-12-17 22:49:02,258 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 313 flow [2021-12-17 22:49:02,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:02,259 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:02,259 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] [2021-12-17 22:49:02,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 22:49:02,259 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:02,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1069972452, now seen corresponding path program 1 times [2021-12-17 22:49:02,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:02,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116396943] [2021-12-17 22:49:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:02,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:02,383 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-17 22:49:02,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:02,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116396943] [2021-12-17 22:49:02,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116396943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:02,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:02,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:49:02,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693342577] [2021-12-17 22:49:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:02,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:49:02,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:49:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:49:02,386 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-17 22:49:02,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-17 22:49:02,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:02,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-17 22:49:02,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:02,803 INFO L129 PetriNetUnfolder]: 1128/2972 cut-off events. [2021-12-17 22:49:02,804 INFO L130 PetriNetUnfolder]: For 3069/3307 co-relation queries the response was YES. [2021-12-17 22:49:02,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7052 conditions, 2972 events. 1128/2972 cut-off events. For 3069/3307 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 25076 event pairs, 343 based on Foata normal form. 207/3107 useless extension candidates. Maximal degree in co-relation 7040. Up to 836 conditions per place. [2021-12-17 22:49:02,835 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 52 selfloop transitions, 7 changer transitions 1/136 dead transitions. [2021-12-17 22:49:02,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 571 flow [2021-12-17 22:49:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:49:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:49:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2021-12-17 22:49:02,837 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8473520249221184 [2021-12-17 22:49:02,838 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 544 transitions. [2021-12-17 22:49:02,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions. [2021-12-17 22:49:02,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:02,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions. [2021-12-17 22:49:02,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 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-17 22:49:02,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:02,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:02,843 INFO L186 Difference]: Start difference. First operand has 108 places, 102 transitions, 313 flow. Second operand 6 states and 544 transitions. [2021-12-17 22:49:02,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 571 flow [2021-12-17 22:49:02,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 22:49:02,854 INFO L242 Difference]: Finished difference. Result has 116 places, 105 transitions, 364 flow [2021-12-17 22:49:02,854 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2021-12-17 22:49:02,856 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2021-12-17 22:49:02,857 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 364 flow [2021-12-17 22:49:02,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-17 22:49:02,857 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:02,858 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] [2021-12-17 22:49:02,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:49:02,858 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:02,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1680413944, now seen corresponding path program 3 times [2021-12-17 22:49:02,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:02,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163731270] [2021-12-17 22:49:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:02,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:02,956 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-17 22:49:02,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:02,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163731270] [2021-12-17 22:49:02,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163731270] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:02,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:02,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 22:49:02,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784292739] [2021-12-17 22:49:02,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:02,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 22:49:02,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 22:49:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 22:49:02,962 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-17 22:49:02,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:02,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:02,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-17 22:49:02,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:03,391 INFO L129 PetriNetUnfolder]: 1170/3388 cut-off events. [2021-12-17 22:49:03,392 INFO L130 PetriNetUnfolder]: For 5484/5889 co-relation queries the response was YES. [2021-12-17 22:49:03,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 3388 events. 1170/3388 cut-off events. For 5484/5889 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 31163 event pairs, 509 based on Foata normal form. 265/3458 useless extension candidates. Maximal degree in co-relation 8907. Up to 906 conditions per place. [2021-12-17 22:49:03,430 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 10 changer transitions 2/132 dead transitions. [2021-12-17 22:49:03,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 616 flow [2021-12-17 22:49:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 22:49:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 22:49:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-12-17 22:49:03,432 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2021-12-17 22:49:03,432 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-12-17 22:49:03,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-12-17 22:49:03,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:03,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-12-17 22:49:03,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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-17 22:49:03,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:03,435 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:03,435 INFO L186 Difference]: Start difference. First operand has 116 places, 105 transitions, 364 flow. Second operand 4 states and 379 transitions. [2021-12-17 22:49:03,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 616 flow [2021-12-17 22:49:03,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 132 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:49:03,444 INFO L242 Difference]: Finished difference. Result has 119 places, 111 transitions, 459 flow [2021-12-17 22:49:03,444 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=119, PETRI_TRANSITIONS=111} [2021-12-17 22:49:03,447 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2021-12-17 22:49:03,447 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 111 transitions, 459 flow [2021-12-17 22:49:03,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:03,448 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:03,448 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] [2021-12-17 22:49:03,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 22:49:03,448 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:03,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1752919980, now seen corresponding path program 1 times [2021-12-17 22:49:03,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:03,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399232913] [2021-12-17 22:49:03,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:03,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:03,605 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-17 22:49:03,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:03,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399232913] [2021-12-17 22:49:03,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399232913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:03,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:03,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 22:49:03,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924245553] [2021-12-17 22:49:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:03,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 22:49:03,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:03,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 22:49:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 22:49:03,608 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-17 22:49:03,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:03,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:03,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-17 22:49:03,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:04,166 INFO L129 PetriNetUnfolder]: 1308/3777 cut-off events. [2021-12-17 22:49:04,166 INFO L130 PetriNetUnfolder]: For 12859/13724 co-relation queries the response was YES. [2021-12-17 22:49:04,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 3777 events. 1308/3777 cut-off events. For 12859/13724 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 35345 event pairs, 674 based on Foata normal form. 232/3695 useless extension candidates. Maximal degree in co-relation 11725. Up to 1487 conditions per place. [2021-12-17 22:49:04,209 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 37 selfloop transitions, 8 changer transitions 6/133 dead transitions. [2021-12-17 22:49:04,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 133 transitions, 707 flow [2021-12-17 22:49:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 22:49:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 22:49:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2021-12-17 22:49:04,212 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.883177570093458 [2021-12-17 22:49:04,212 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2021-12-17 22:49:04,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2021-12-17 22:49:04,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:04,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2021-12-17 22:49:04,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 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-17 22:49:04,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:04,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:04,216 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 459 flow. Second operand 4 states and 378 transitions. [2021-12-17 22:49:04,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 133 transitions, 707 flow [2021-12-17 22:49:04,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 133 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-17 22:49:04,225 INFO L242 Difference]: Finished difference. Result has 123 places, 113 transitions, 498 flow [2021-12-17 22:49:04,225 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=498, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2021-12-17 22:49:04,226 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2021-12-17 22:49:04,226 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 498 flow [2021-12-17 22:49:04,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:04,227 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:04,227 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] [2021-12-17 22:49:04,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:49:04,228 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -215684502, now seen corresponding path program 4 times [2021-12-17 22:49:04,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:04,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059526823] [2021-12-17 22:49:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:04,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:04,307 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-17 22:49:04,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:04,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059526823] [2021-12-17 22:49:04,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059526823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:04,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:04,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 22:49:04,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289861513] [2021-12-17 22:49:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:04,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 22:49:04,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:04,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 22:49:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 22:49:04,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-17 22:49:04,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-17 22:49:04,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:04,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-17 22:49:04,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:05,013 INFO L129 PetriNetUnfolder]: 2135/5361 cut-off events. [2021-12-17 22:49:05,014 INFO L130 PetriNetUnfolder]: For 14252/14950 co-relation queries the response was YES. [2021-12-17 22:49:05,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16436 conditions, 5361 events. 2135/5361 cut-off events. For 14252/14950 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 50291 event pairs, 946 based on Foata normal form. 175/5214 useless extension candidates. Maximal degree in co-relation 16416. Up to 1592 conditions per place. [2021-12-17 22:49:05,094 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 46 selfloop transitions, 6 changer transitions 16/144 dead transitions. [2021-12-17 22:49:05,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 814 flow [2021-12-17 22:49:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:49:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:49:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2021-12-17 22:49:05,097 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2021-12-17 22:49:05,097 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2021-12-17 22:49:05,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2021-12-17 22:49:05,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:05,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2021-12-17 22:49:05,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 0 states have call successors, (0), 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-17 22:49:05,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:05,101 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:05,101 INFO L186 Difference]: Start difference. First operand has 123 places, 113 transitions, 498 flow. Second operand 6 states and 542 transitions. [2021-12-17 22:49:05,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 814 flow [2021-12-17 22:49:05,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 144 transitions, 799 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-12-17 22:49:05,116 INFO L242 Difference]: Finished difference. Result has 130 places, 112 transitions, 499 flow [2021-12-17 22:49:05,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2021-12-17 22:49:05,118 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2021-12-17 22:49:05,118 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 499 flow [2021-12-17 22:49:05,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 0 states have call successors, (0), 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-17 22:49:05,119 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:05,119 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] [2021-12-17 22:49:05,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:49:05,120 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 401888418, now seen corresponding path program 2 times [2021-12-17 22:49:05,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:05,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171540657] [2021-12-17 22:49:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:05,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:05,203 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-17 22:49:05,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171540657] [2021-12-17 22:49:05,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171540657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:05,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:05,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 22:49:05,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996744862] [2021-12-17 22:49:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:05,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 22:49:05,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:05,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 22:49:05,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 22:49:05,207 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-17 22:49:05,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:05,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:05,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-17 22:49:05,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:05,623 INFO L129 PetriNetUnfolder]: 1236/3192 cut-off events. [2021-12-17 22:49:05,623 INFO L130 PetriNetUnfolder]: For 13531/14630 co-relation queries the response was YES. [2021-12-17 22:49:05,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11250 conditions, 3192 events. 1236/3192 cut-off events. For 13531/14630 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27195 event pairs, 364 based on Foata normal form. 213/3170 useless extension candidates. Maximal degree in co-relation 11227. Up to 916 conditions per place. [2021-12-17 22:49:05,667 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 40 selfloop transitions, 15 changer transitions 3/139 dead transitions. [2021-12-17 22:49:05,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 858 flow [2021-12-17 22:49:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 22:49:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 22:49:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2021-12-17 22:49:05,669 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8785046728971962 [2021-12-17 22:49:05,669 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2021-12-17 22:49:05,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2021-12-17 22:49:05,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:05,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2021-12-17 22:49:05,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 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-17 22:49:05,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:05,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:05,672 INFO L186 Difference]: Start difference. First operand has 130 places, 112 transitions, 499 flow. Second operand 4 states and 376 transitions. [2021-12-17 22:49:05,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 858 flow [2021-12-17 22:49:05,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 139 transitions, 794 flow, removed 26 selfloop flow, removed 6 redundant places. [2021-12-17 22:49:05,690 INFO L242 Difference]: Finished difference. Result has 125 places, 119 transitions, 614 flow [2021-12-17 22:49:05,690 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=614, PETRI_PLACES=125, PETRI_TRANSITIONS=119} [2021-12-17 22:49:05,691 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2021-12-17 22:49:05,691 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 119 transitions, 614 flow [2021-12-17 22:49:05,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.25) internal successors, (353), 4 states have internal predecessors, (353), 0 states have call successors, (0), 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-17 22:49:05,692 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:05,692 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] [2021-12-17 22:49:05,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:49:05,692 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1597009161, now seen corresponding path program 1 times [2021-12-17 22:49:05,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:05,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482140451] [2021-12-17 22:49:05,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:05,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:05,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:05,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482140451] [2021-12-17 22:49:05,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482140451] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:05,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563324054] [2021-12-17 22:49:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:05,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:05,766 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-17 22:49:05,787 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-17 22:49:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:05,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 22:49:05,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:06,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:06,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563324054] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:06,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:49:06,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2021-12-17 22:49:06,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862020202] [2021-12-17 22:49:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:06,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 22:49:06,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:06,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 22:49:06,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:49:06,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-17 22:49:06,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 119 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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-17 22:49:06,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:06,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-17 22:49:06,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:06,791 INFO L129 PetriNetUnfolder]: 1406/3297 cut-off events. [2021-12-17 22:49:06,791 INFO L130 PetriNetUnfolder]: For 14591/15799 co-relation queries the response was YES. [2021-12-17 22:49:06,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12349 conditions, 3297 events. 1406/3297 cut-off events. For 14591/15799 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26513 event pairs, 234 based on Foata normal form. 241/3351 useless extension candidates. Maximal degree in co-relation 12328. Up to 1090 conditions per place. [2021-12-17 22:49:06,839 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 15 changer transitions 1/138 dead transitions. [2021-12-17 22:49:06,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 138 transitions, 893 flow [2021-12-17 22:49:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 22:49:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-17 22:49:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2021-12-17 22:49:06,842 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8691588785046729 [2021-12-17 22:49:06,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 372 transitions. [2021-12-17 22:49:06,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 372 transitions. [2021-12-17 22:49:06,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:06,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 372 transitions. [2021-12-17 22:49:06,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 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-17 22:49:06,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:06,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 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-17 22:49:06,846 INFO L186 Difference]: Start difference. First operand has 125 places, 119 transitions, 614 flow. Second operand 4 states and 372 transitions. [2021-12-17 22:49:06,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 138 transitions, 893 flow [2021-12-17 22:49:06,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 138 transitions, 873 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-17 22:49:06,855 INFO L242 Difference]: Finished difference. Result has 125 places, 123 transitions, 695 flow [2021-12-17 22:49:06,856 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=695, PETRI_PLACES=125, PETRI_TRANSITIONS=123} [2021-12-17 22:49:06,857 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2021-12-17 22:49:06,857 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 123 transitions, 695 flow [2021-12-17 22:49:06,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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-17 22:49:06,857 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:06,857 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] [2021-12-17 22:49:06,884 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-17 22:49:07,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 22:49:07,082 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:07,082 INFO L85 PathProgramCache]: Analyzing trace with hash 739778129, now seen corresponding path program 2 times [2021-12-17 22:49:07,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:07,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258615558] [2021-12-17 22:49:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:07,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:07,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:07,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258615558] [2021-12-17 22:49:07,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258615558] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:07,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817423750] [2021-12-17 22:49:07,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:49:07,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:07,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:07,186 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-17 22:49:07,195 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-17 22:49:07,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:49:07,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:49:07,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 22:49:07,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:07,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:07,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817423750] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:07,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:07,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2021-12-17 22:49:07,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980565881] [2021-12-17 22:49:07,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:07,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:49:07,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:49:07,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:49:07,716 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-17 22:49:07,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 123 transitions, 695 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 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-17 22:49:07,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:07,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-17 22:49:07,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:08,529 INFO L129 PetriNetUnfolder]: 3104/6639 cut-off events. [2021-12-17 22:49:08,529 INFO L130 PetriNetUnfolder]: For 32239/33949 co-relation queries the response was YES. [2021-12-17 22:49:08,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26308 conditions, 6639 events. 3104/6639 cut-off events. For 32239/33949 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 57842 event pairs, 303 based on Foata normal form. 328/6635 useless extension candidates. Maximal degree in co-relation 26286. Up to 1814 conditions per place. [2021-12-17 22:49:08,638 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 106 selfloop transitions, 61 changer transitions 1/245 dead transitions. [2021-12-17 22:49:08,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 245 transitions, 2183 flow [2021-12-17 22:49:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 22:49:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-17 22:49:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 918 transitions. [2021-12-17 22:49:08,641 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8579439252336448 [2021-12-17 22:49:08,641 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 918 transitions. [2021-12-17 22:49:08,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 918 transitions. [2021-12-17 22:49:08,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:08,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 918 transitions. [2021-12-17 22:49:08,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.8) internal successors, (918), 10 states have internal predecessors, (918), 0 states have call successors, (0), 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-17 22:49:08,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 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-17 22:49:08,737 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 0 states have call successors, (0), 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-17 22:49:08,737 INFO L186 Difference]: Start difference. First operand has 125 places, 123 transitions, 695 flow. Second operand 10 states and 918 transitions. [2021-12-17 22:49:08,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 245 transitions, 2183 flow [2021-12-17 22:49:08,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 245 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:49:08,765 INFO L242 Difference]: Finished difference. Result has 140 places, 171 transitions, 1483 flow [2021-12-17 22:49:08,765 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1483, PETRI_PLACES=140, PETRI_TRANSITIONS=171} [2021-12-17 22:49:08,766 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2021-12-17 22:49:08,766 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 171 transitions, 1483 flow [2021-12-17 22:49:08,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 states have internal predecessors, (688), 0 states have call successors, (0), 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-17 22:49:08,767 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:08,767 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] [2021-12-17 22:49:08,795 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-17 22:49:08,991 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,SelfDestructingSolverStorable10 [2021-12-17 22:49:08,992 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:08,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1255263895, now seen corresponding path program 3 times [2021-12-17 22:49:08,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:08,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766737776] [2021-12-17 22:49:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:08,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:09,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:09,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766737776] [2021-12-17 22:49:09,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766737776] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:49:09,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:49:09,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:49:09,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237074378] [2021-12-17 22:49:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:49:09,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:49:09,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:49:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:49:09,078 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-17 22:49:09,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 171 transitions, 1483 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 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-17 22:49:09,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:09,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-17 22:49:09,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:09,732 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L50-5-->L50-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~c~0_3 4294967296))) InVars {~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][73], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 14#L50-6true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:09,732 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:09,732 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:09,733 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:09,733 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:09,733 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][59], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:09,733 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:09,733 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:09,734 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:09,734 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:09,951 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L50-5-->L50-6: Formula: (not (< (mod v_thread2Thread1of1ForFork2_~i~1_3 4294967296) (mod v_~c~0_3 4294967296))) InVars {~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} OutVars{~c~0=v_~c~0_3, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3} AuxVars[] AssignedVars[][73], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 14#L50-6true, 80#L58-6true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:09,952 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:09,952 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:09,953 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:09,953 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:09,953 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][59], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), 118#(= ~x_1~0 0), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 80#L58-6true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1216#true, Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 488#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:09,953 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:09,954 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:09,954 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:09,954 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:10,145 INFO L129 PetriNetUnfolder]: 3308/6879 cut-off events. [2021-12-17 22:49:10,145 INFO L130 PetriNetUnfolder]: For 52640/55882 co-relation queries the response was YES. [2021-12-17 22:49:10,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31807 conditions, 6879 events. 3308/6879 cut-off events. For 52640/55882 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 58564 event pairs, 843 based on Foata normal form. 360/6816 useless extension candidates. Maximal degree in co-relation 31778. Up to 2236 conditions per place. [2021-12-17 22:49:10,246 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 97 selfloop transitions, 51 changer transitions 2/227 dead transitions. [2021-12-17 22:49:10,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 227 transitions, 2450 flow [2021-12-17 22:49:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:49:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:49:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2021-12-17 22:49:10,248 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8566978193146417 [2021-12-17 22:49:10,248 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 550 transitions. [2021-12-17 22:49:10,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 550 transitions. [2021-12-17 22:49:10,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:10,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 550 transitions. [2021-12-17 22:49:10,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 0 states have call successors, (0), 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-17 22:49:10,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:10,251 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 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-17 22:49:10,251 INFO L186 Difference]: Start difference. First operand has 140 places, 171 transitions, 1483 flow. Second operand 6 states and 550 transitions. [2021-12-17 22:49:10,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 227 transitions, 2450 flow [2021-12-17 22:49:10,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 227 transitions, 2426 flow, removed 12 selfloop flow, removed 0 redundant places. [2021-12-17 22:49:10,311 INFO L242 Difference]: Finished difference. Result has 148 places, 190 transitions, 1950 flow [2021-12-17 22:49:10,311 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1950, PETRI_PLACES=148, PETRI_TRANSITIONS=190} [2021-12-17 22:49:10,312 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 52 predicate places. [2021-12-17 22:49:10,312 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 1950 flow [2021-12-17 22:49:10,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 0 states have call successors, (0), 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-17 22:49:10,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:10,312 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:49:10,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 22:49:10,313 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash 856452868, now seen corresponding path program 1 times [2021-12-17 22:49:10,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:10,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377571957] [2021-12-17 22:49:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:10,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:10,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:10,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377571957] [2021-12-17 22:49:10,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377571957] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:10,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208768805] [2021-12-17 22:49:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:10,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:10,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:10,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 22:49:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:10,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 22:49:10,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:11,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:11,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208768805] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:11,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:11,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-17 22:49:11,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955959750] [2021-12-17 22:49:11,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:11,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:49:11,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:11,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:49:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:49:11,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-17 22:49:11,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 1950 flow. Second operand has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-17 22:49:11,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:11,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-17 22:49:11,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:12,104 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][156], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, 7#L42-6true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1232#(and (= ~x_2~0 0) (<= (+ ~b~0 ~x_1~0) ~x_3~0) (<= ~x_3~0 (+ ~b~0 ~x_1~0))), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 1216#true, 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:12,104 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-17 22:49:12,104 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:12,104 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:12,104 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:12,201 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][175], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), 44#L50-2true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1226#true, 94#L76-2true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 68#L58-2true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:12,202 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:12,202 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:12,202 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:12,202 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:12,225 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][156], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 1216#true, 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:12,226 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:12,226 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:12,226 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:12,226 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:12,244 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][156], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 1216#true, 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:12,245 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:12,245 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:12,245 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:12,245 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:12,289 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][175], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1226#true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 94#L76-2true, 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 68#L58-2true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:12,289 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-17 22:49:12,289 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:12,289 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:12,289 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:12,308 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][175], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 134#(= thread3Thread1of1ForFork0_~i~2 0), 1226#true, Black: 138#(and (= thread3Thread1of1ForFork0_~i~2 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 94#L76-2true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 68#L58-2true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 707#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ ~c~0 (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)))) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 706#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:12,309 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2021-12-17 22:49:12,309 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-17 22:49:12,309 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-12-17 22:49:12,309 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-17 22:49:12,531 INFO L129 PetriNetUnfolder]: 1905/5784 cut-off events. [2021-12-17 22:49:12,532 INFO L130 PetriNetUnfolder]: For 29678/31177 co-relation queries the response was YES. [2021-12-17 22:49:12,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22359 conditions, 5784 events. 1905/5784 cut-off events. For 29678/31177 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 57268 event pairs, 261 based on Foata normal form. 156/5646 useless extension candidates. Maximal degree in co-relation 22326. Up to 1183 conditions per place. [2021-12-17 22:49:12,645 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 41 selfloop transitions, 31 changer transitions 8/244 dead transitions. [2021-12-17 22:49:12,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 244 transitions, 2293 flow [2021-12-17 22:49:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 22:49:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-17 22:49:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1540 transitions. [2021-12-17 22:49:12,649 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2021-12-17 22:49:12,649 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1540 transitions. [2021-12-17 22:49:12,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1540 transitions. [2021-12-17 22:49:12,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:12,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1540 transitions. [2021-12-17 22:49:12,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.55555555555556) internal successors, (1540), 18 states have internal predecessors, (1540), 0 states have call successors, (0), 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-17 22:49:12,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-17 22:49:12,658 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-17 22:49:12,658 INFO L186 Difference]: Start difference. First operand has 148 places, 190 transitions, 1950 flow. Second operand 18 states and 1540 transitions. [2021-12-17 22:49:12,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 244 transitions, 2293 flow [2021-12-17 22:49:12,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 244 transitions, 2102 flow, removed 64 selfloop flow, removed 6 redundant places. [2021-12-17 22:49:12,720 INFO L242 Difference]: Finished difference. Result has 164 places, 211 transitions, 1951 flow [2021-12-17 22:49:12,721 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1951, PETRI_PLACES=164, PETRI_TRANSITIONS=211} [2021-12-17 22:49:12,722 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 68 predicate places. [2021-12-17 22:49:12,722 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 211 transitions, 1951 flow [2021-12-17 22:49:12,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-17 22:49:12,723 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:12,723 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:49:12,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 22:49:12,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:12,939 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1297516402, now seen corresponding path program 2 times [2021-12-17 22:49:12,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:12,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074377402] [2021-12-17 22:49:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:12,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:13,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074377402] [2021-12-17 22:49:13,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074377402] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:13,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743776052] [2021-12-17 22:49:13,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:49:13,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:13,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:13,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:13,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 22:49:13,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:49:13,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:49:13,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 22:49:13,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:13,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:14,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743776052] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:14,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:14,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-17 22:49:14,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741753296] [2021-12-17 22:49:14,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:14,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:49:14,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:49:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:49:14,221 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-17 22:49:14,222 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 211 transitions, 1951 flow. Second operand has 16 states, 16 states have (on average 83.4375) internal successors, (1335), 16 states have internal predecessors, (1335), 0 states have call successors, (0), 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-17 22:49:14,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:14,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-17 22:49:14,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:14,459 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 55#L74-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:14,459 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-17 22:49:14,459 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-17 22:49:14,459 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-17 22:49:14,459 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:14,724 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][134], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 48#L42-4true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), 116#true, 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:14,724 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:14,724 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:14,724 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:14,724 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:14,764 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] thread3ENTRY-->L58-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][83], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 48#L42-4true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), 116#true, 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:14,764 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:14,764 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:14,764 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:14,764 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:14,764 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 75#thread3ENTRYtrue, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:14,765 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:14,765 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:14,765 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:14,765 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:14,829 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:14,829 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:14,829 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:14,829 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:14,829 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:14,830 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:14,830 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:14,830 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:14,830 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:14,830 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:14,831 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 116#true, 27#L58-5true, Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:14,831 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-17 22:49:14,831 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:14,831 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:14,831 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:14,974 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:14,974 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:14,974 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:14,974 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:14,974 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:15,100 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][179], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 94#L76-2true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 68#L58-2true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:15,100 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:15,100 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:15,100 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:15,100 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-17 22:49:15,136 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][61], [Black: 120#(and (= ~x_1~0 0) (= ~x_2~0 0) (= ~x_3~0 0)), 113#true, Black: 119#(and (= ~x_1~0 0) (= ~x_2~0 0)), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 68#L58-2true, Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 116#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1771#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1773#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1775#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1777#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:15,136 INFO L384 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2021-12-17 22:49:15,136 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-17 22:49:15,136 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-17 22:49:15,136 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-17 22:49:15,386 INFO L129 PetriNetUnfolder]: 2345/7257 cut-off events. [2021-12-17 22:49:15,386 INFO L130 PetriNetUnfolder]: For 30265/32318 co-relation queries the response was YES. [2021-12-17 22:49:15,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27296 conditions, 7257 events. 2345/7257 cut-off events. For 30265/32318 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 74671 event pairs, 309 based on Foata normal form. 286/7227 useless extension candidates. Maximal degree in co-relation 27261. Up to 1502 conditions per place. [2021-12-17 22:49:15,490 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 59 selfloop transitions, 30 changer transitions 8/261 dead transitions. [2021-12-17 22:49:15,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 261 transitions, 2376 flow [2021-12-17 22:49:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 22:49:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-17 22:49:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1461 transitions. [2021-12-17 22:49:15,494 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8031885651456845 [2021-12-17 22:49:15,494 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1461 transitions. [2021-12-17 22:49:15,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1461 transitions. [2021-12-17 22:49:15,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:15,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1461 transitions. [2021-12-17 22:49:15,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.94117647058823) internal successors, (1461), 17 states have internal predecessors, (1461), 0 states have call successors, (0), 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-17 22:49:15,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-17 22:49:15,502 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-17 22:49:15,502 INFO L186 Difference]: Start difference. First operand has 164 places, 211 transitions, 1951 flow. Second operand 17 states and 1461 transitions. [2021-12-17 22:49:15,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 261 transitions, 2376 flow [2021-12-17 22:49:15,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 261 transitions, 2207 flow, removed 68 selfloop flow, removed 13 redundant places. [2021-12-17 22:49:15,586 INFO L242 Difference]: Finished difference. Result has 169 places, 226 transitions, 1992 flow [2021-12-17 22:49:15,586 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1992, PETRI_PLACES=169, PETRI_TRANSITIONS=226} [2021-12-17 22:49:15,587 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 73 predicate places. [2021-12-17 22:49:15,587 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 226 transitions, 1992 flow [2021-12-17 22:49:15,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.4375) internal successors, (1335), 16 states have internal predecessors, (1335), 0 states have call successors, (0), 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-17 22:49:15,588 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:15,588 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:49:15,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 22:49:15,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:15,812 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1516377056, now seen corresponding path program 3 times [2021-12-17 22:49:15,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:15,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589425023] [2021-12-17 22:49:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:15,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:15,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589425023] [2021-12-17 22:49:15,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589425023] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:15,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796554237] [2021-12-17 22:49:15,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 22:49:15,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:15,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:15,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 22:49:16,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-17 22:49:16,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:49:16,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 22:49:16,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:16,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:49:16,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796554237] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:16,968 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:16,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-17 22:49:16,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749168018] [2021-12-17 22:49:16,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:16,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:49:16,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:16,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:49:16,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:49:16,970 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-17 22:49:16,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 226 transitions, 1992 flow. Second operand has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-17 22:49:16,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:16,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-17 22:49:16,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:17,205 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 55#L74-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,205 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,206 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-17 22:49:17,206 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-17 22:49:17,206 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,357 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), 55#L74-4true]) [2021-12-17 22:49:17,357 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,357 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-17 22:49:17,358 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-17 22:49:17,358 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,470 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 48#L42-4true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,470 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,470 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,470 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,470 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,496 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 48#L42-4true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,496 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,496 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,496 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,496 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,496 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,510 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][76], [113#true, 1787#(= ~x_1~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,510 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,510 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,510 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,510 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,529 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([261] thread3ENTRY-->L58-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2][80], [113#true, 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 48#L42-4true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,529 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,529 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,529 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:17,529 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:17,580 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,580 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:17,580 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:17,581 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:17,581 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:17,601 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,601 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,601 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,601 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,601 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,624 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][153], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,624 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,624 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,624 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,624 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,625 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([244] L42-5-->L43: Formula: (< (mod v_thread1Thread1of1ForFork1_~i~0_5 4294967296) (mod v_~c~0_2 4294967296)) InVars {~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~c~0=v_~c~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[][48], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 702#true, 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,625 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,625 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,625 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,625 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,632 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:17,632 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,633 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,633 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,633 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,677 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2344#(= ~x_1~0 0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,677 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,677 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,677 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,677 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,678 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, 1787#(= ~x_1~0 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:17,678 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,678 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,678 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,678 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,679 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,680 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), 27#L58-5true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:17,680 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,681 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,681 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:17,681 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,681 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:17,682 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][149], [113#true, 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 44#L50-2true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 94#L76-2true, 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 68#L58-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:17,682 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:17,683 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:17,683 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:17,683 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:17,690 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:17,690 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,690 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,690 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:17,690 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:17,841 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][149], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 94#L76-2true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:17,842 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-17 22:49:17,842 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:17,842 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:17,842 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-17 22:49:17,842 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][149], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, 94#L76-2true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 68#L58-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:17,842 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:17,842 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:17,842 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:17,842 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-17 22:49:18,022 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][153], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 2332#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2330#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2328#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 2334#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2730#(<= (div (+ (* ~b~0 (- 1)) (* ~x_3~0 (- 1)) ~x_2~0 ~x_1~0 (- 4294967296)) (- 4294967296)) (+ (div (+ ~b~0 ~x_3~0 (* ~x_2~0 (- 1)) (* ~x_1~0 (- 1))) 4294967296) 1)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:18,022 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-17 22:49:18,023 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:18,023 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-17 22:49:18,023 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:18,192 INFO L129 PetriNetUnfolder]: 2788/8522 cut-off events. [2021-12-17 22:49:18,192 INFO L130 PetriNetUnfolder]: For 33561/37219 co-relation queries the response was YES. [2021-12-17 22:49:18,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31308 conditions, 8522 events. 2788/8522 cut-off events. For 33561/37219 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 89593 event pairs, 454 based on Foata normal form. 199/8281 useless extension candidates. Maximal degree in co-relation 31273. Up to 1929 conditions per place. [2021-12-17 22:49:18,355 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 71 selfloop transitions, 31 changer transitions 8/274 dead transitions. [2021-12-17 22:49:18,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 274 transitions, 2444 flow [2021-12-17 22:49:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 22:49:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-17 22:49:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1537 transitions. [2021-12-17 22:49:18,359 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7980269989615784 [2021-12-17 22:49:18,359 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1537 transitions. [2021-12-17 22:49:18,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1537 transitions. [2021-12-17 22:49:18,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:18,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1537 transitions. [2021-12-17 22:49:18,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.38888888888889) internal successors, (1537), 18 states have internal predecessors, (1537), 0 states have call successors, (0), 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-17 22:49:18,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-17 22:49:18,368 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 107.0) internal successors, (2033), 19 states have internal predecessors, (2033), 0 states have call successors, (0), 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-17 22:49:18,368 INFO L186 Difference]: Start difference. First operand has 169 places, 226 transitions, 1992 flow. Second operand 18 states and 1537 transitions. [2021-12-17 22:49:18,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 274 transitions, 2444 flow [2021-12-17 22:49:18,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 274 transitions, 2356 flow, removed 31 selfloop flow, removed 10 redundant places. [2021-12-17 22:49:18,448 INFO L242 Difference]: Finished difference. Result has 178 places, 244 transitions, 2120 flow [2021-12-17 22:49:18,449 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2120, PETRI_PLACES=178, PETRI_TRANSITIONS=244} [2021-12-17 22:49:18,449 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 82 predicate places. [2021-12-17 22:49:18,450 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 244 transitions, 2120 flow [2021-12-17 22:49:18,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-17 22:49:18,450 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:18,451 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:49:18,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 22:49:18,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 22:49:18,668 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash -10980542, now seen corresponding path program 4 times [2021-12-17 22:49:18,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:18,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031666544] [2021-12-17 22:49:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:18,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:18,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:18,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031666544] [2021-12-17 22:49:18,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031666544] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:18,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117557779] [2021-12-17 22:49:18,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 22:49:18,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:18,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:18,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 22:49:18,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 22:49:18,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:49:18,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 22:49:18,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:19,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 22:49:19,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117557779] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:19,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:19,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-17 22:49:19,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493612230] [2021-12-17 22:49:19,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:19,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:49:19,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:49:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:49:19,759 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-17 22:49:19,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 244 transitions, 2120 flow. Second operand has 16 states, 16 states have (on average 83.5) internal successors, (1336), 16 states have internal predecessors, (1336), 0 states have call successors, (0), 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-17 22:49:19,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:19,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-17 22:49:19,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:20,328 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][77], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2344#(= ~x_1~0 0), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,328 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:20,328 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:20,328 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:20,328 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:20,390 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2344#(= ~x_1~0 0), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,390 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,390 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,390 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:20,390 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,452 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2344#(= ~x_1~0 0), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,452 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-17 22:49:20,452 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:20,452 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:20,452 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:20,507 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2344#(= ~x_1~0 0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,507 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,508 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:20,508 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:20,508 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,511 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2344#(= ~x_1~0 0), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 1228#(= ~x_1~0 0), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,511 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,511 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:20,511 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:20,511 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,511 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,558 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 68#L58-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,559 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,559 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,559 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,559 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,568 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 48#L42-4true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,568 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,568 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,568 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,568 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,619 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,619 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,619 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,619 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,619 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,624 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,624 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,624 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,624 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,624 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,624 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,652 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,652 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,652 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,652 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,653 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,653 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,653 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,711 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 68#L58-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,711 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-17 22:49:20,711 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,711 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,711 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:20,716 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,716 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-17 22:49:20,716 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:20,716 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:20,716 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-17 22:49:20,716 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][182], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 68#L58-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,716 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,716 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,716 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:20,717 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-17 22:49:20,726 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][120], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 96#L42-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,726 INFO L384 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2021-12-17 22:49:20,726 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-17 22:49:20,726 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-17 22:49:20,726 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-17 22:49:20,806 INFO L382 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,806 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-12-17 22:49:20,806 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,807 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,807 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,807 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:20,807 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,807 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,930 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 3313#(<= (div (+ (* ~b~0 (- 1)) (* ~x_3~0 (- 1)) ~x_2~0 ~x_1~0 (- 4294967296)) (- 4294967296)) (+ (div (+ ~b~0 ~x_3~0 (* ~x_2~0 (- 1)) (* ~x_1~0 (- 1))) 4294967296) 1)), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,930 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-17 22:49:20,930 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,930 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,930 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,947 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2730#(<= (div (+ (* ~b~0 (- 1)) (* ~x_3~0 (- 1)) ~x_2~0 ~x_1~0 (- 4294967296)) (- 4294967296)) (+ (div (+ ~b~0 ~x_3~0 (* ~x_2~0 (- 1)) (* ~x_1~0 (- 1))) 4294967296) 1)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:20,948 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-17 22:49:20,948 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,948 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-17 22:49:20,948 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,964 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][157], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 2887#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 2891#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2889#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2893#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3313#(<= (div (+ (* ~b~0 (- 1)) (* ~x_3~0 (- 1)) ~x_2~0 ~x_1~0 (- 4294967296)) (- 4294967296)) (+ (div (+ ~b~0 ~x_3~0 (* ~x_2~0 (- 1)) (* ~x_1~0 (- 1))) 4294967296) 1)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 702#true, 89#L75-4true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:20,965 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-17 22:49:20,965 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-17 22:49:20,965 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,965 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:20,965 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:21,142 INFO L129 PetriNetUnfolder]: 2999/9440 cut-off events. [2021-12-17 22:49:21,142 INFO L130 PetriNetUnfolder]: For 38593/42738 co-relation queries the response was YES. [2021-12-17 22:49:21,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35280 conditions, 9440 events. 2999/9440 cut-off events. For 38593/42738 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 101899 event pairs, 517 based on Foata normal form. 316/9284 useless extension candidates. Maximal degree in co-relation 35242. Up to 2093 conditions per place. [2021-12-17 22:49:21,284 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 90 selfloop transitions, 30 changer transitions 8/292 dead transitions. [2021-12-17 22:49:21,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 292 transitions, 2653 flow [2021-12-17 22:49:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:49:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:49:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1378 transitions. [2021-12-17 22:49:21,286 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8049065420560748 [2021-12-17 22:49:21,286 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1378 transitions. [2021-12-17 22:49:21,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1378 transitions. [2021-12-17 22:49:21,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:21,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1378 transitions. [2021-12-17 22:49:21,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.125) internal successors, (1378), 16 states have internal predecessors, (1378), 0 states have call successors, (0), 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-17 22:49:21,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-17 22:49:21,292 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-17 22:49:21,292 INFO L186 Difference]: Start difference. First operand has 178 places, 244 transitions, 2120 flow. Second operand 16 states and 1378 transitions. [2021-12-17 22:49:21,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 292 transitions, 2653 flow [2021-12-17 22:49:21,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 292 transitions, 2537 flow, removed 46 selfloop flow, removed 10 redundant places. [2021-12-17 22:49:21,366 INFO L242 Difference]: Finished difference. Result has 185 places, 259 transitions, 2234 flow [2021-12-17 22:49:21,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2234, PETRI_PLACES=185, PETRI_TRANSITIONS=259} [2021-12-17 22:49:21,367 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 89 predicate places. [2021-12-17 22:49:21,367 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 259 transitions, 2234 flow [2021-12-17 22:49:21,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5) internal successors, (1336), 16 states have internal predecessors, (1336), 0 states have call successors, (0), 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-17 22:49:21,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:21,368 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:49:21,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 22:49:21,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-17 22:49:21,584 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1064763944, now seen corresponding path program 5 times [2021-12-17 22:49:21,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:21,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685841590] [2021-12-17 22:49:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:21,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:21,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685841590] [2021-12-17 22:49:21,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685841590] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50009003] [2021-12-17 22:49:21,727 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 22:49:21,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:21,728 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:21,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 22:49:21,828 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-12-17 22:49:21,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:49:21,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 22:49:21,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:22,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:22,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50009003] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:22,569 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:22,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-17 22:49:22,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152969231] [2021-12-17 22:49:22,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:22,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:49:22,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:49:22,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:49:22,572 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-17 22:49:22,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 259 transitions, 2234 flow. Second operand has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-17 22:49:22,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:22,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-17 22:49:22,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:23,106 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][76], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2344#(= ~x_1~0 0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:23,107 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-17 22:49:23,107 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:23,107 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-17 22:49:23,107 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-17 22:49:23,169 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 69#L58-4true, Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 2344#(= ~x_1~0 0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), 2903#(= ~x_1~0 0), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:23,169 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:23,169 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-17 22:49:23,169 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:23,170 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:23,229 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), 3458#(= ~x_1~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 61#L42-5true, 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:23,229 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-17 22:49:23,229 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:23,229 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-17 22:49:23,229 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-17 22:49:23,282 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), 3458#(= ~x_1~0 0), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:23,283 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,283 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:23,283 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,283 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:23,284 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), 3458#(= ~x_1~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 1205#(and (= thread1Thread1of1ForFork1_~i~0 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), 62#L43true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 2903#(= ~x_1~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:23,284 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,284 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:23,284 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,284 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,284 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-17 22:49:23,392 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3456#true, 48#L42-4true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 702#true, 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0))]) [2021-12-17 22:49:23,392 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:23,392 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:23,392 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:23,393 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:23,393 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 702#true, 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0))]) [2021-12-17 22:49:23,393 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-17 22:49:23,393 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,393 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,393 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:23,450 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 89#L75-4true, Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0))]) [2021-12-17 22:49:23,450 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-17 22:49:23,450 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,450 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-17 22:49:23,450 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:23,450 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:23,464 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 64#L59true, Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:23,465 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-17 22:49:23,465 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:49:23,465 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:49:23,465 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:49:23,468 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 64#L59true, Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0))]) [2021-12-17 22:49:23,468 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-17 22:49:23,468 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-17 22:49:23,468 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:23,468 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:23,468 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-17 22:49:23,468 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3456#true, 68#L58-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3446#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3448#(and (= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 3444#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 3442#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0))]) [2021-12-17 22:49:23,468 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:23,468 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:23,468 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:23,468 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-17 22:49:23,926 INFO L129 PetriNetUnfolder]: 3430/10662 cut-off events. [2021-12-17 22:49:23,927 INFO L130 PetriNetUnfolder]: For 46541/50053 co-relation queries the response was YES. [2021-12-17 22:49:24,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41075 conditions, 10662 events. 3430/10662 cut-off events. For 46541/50053 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 117288 event pairs, 636 based on Foata normal form. 241/10391 useless extension candidates. Maximal degree in co-relation 41034. Up to 2455 conditions per place. [2021-12-17 22:49:24,100 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 104 selfloop transitions, 31 changer transitions 8/307 dead transitions. [2021-12-17 22:49:24,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 307 transitions, 2852 flow [2021-12-17 22:49:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 22:49:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-17 22:49:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1375 transitions. [2021-12-17 22:49:24,103 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8031542056074766 [2021-12-17 22:49:24,103 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1375 transitions. [2021-12-17 22:49:24,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1375 transitions. [2021-12-17 22:49:24,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:24,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1375 transitions. [2021-12-17 22:49:24,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.9375) internal successors, (1375), 16 states have internal predecessors, (1375), 0 states have call successors, (0), 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-17 22:49:24,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-17 22:49:24,110 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 0 states have call successors, (0), 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-17 22:49:24,110 INFO L186 Difference]: Start difference. First operand has 185 places, 259 transitions, 2234 flow. Second operand 16 states and 1375 transitions. [2021-12-17 22:49:24,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 307 transitions, 2852 flow [2021-12-17 22:49:24,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 307 transitions, 2703 flow, removed 61 selfloop flow, removed 9 redundant places. [2021-12-17 22:49:24,198 INFO L242 Difference]: Finished difference. Result has 194 places, 277 transitions, 2371 flow [2021-12-17 22:49:24,199 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2371, PETRI_PLACES=194, PETRI_TRANSITIONS=277} [2021-12-17 22:49:24,199 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 98 predicate places. [2021-12-17 22:49:24,199 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 277 transitions, 2371 flow [2021-12-17 22:49:24,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.5625) internal successors, (1337), 16 states have internal predecessors, (1337), 0 states have call successors, (0), 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-17 22:49:24,200 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:24,200 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:49:24,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 22:49:24,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:24,424 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 421987156, now seen corresponding path program 6 times [2021-12-17 22:49:24,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389861519] [2021-12-17 22:49:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:24,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:24,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:24,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389861519] [2021-12-17 22:49:24,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389861519] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:24,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867037171] [2021-12-17 22:49:24,588 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 22:49:24,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:24,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:24,589 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:24,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 22:49:24,715 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-12-17 22:49:24,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:49:24,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 22:49:24,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:25,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:25,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867037171] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:25,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:25,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-17 22:49:25,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135301121] [2021-12-17 22:49:25,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:25,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:49:25,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:49:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:49:25,470 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-17 22:49:25,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 277 transitions, 2371 flow. Second operand has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-17 22:49:25,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:25,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-17 22:49:25,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:26,225 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([254] L50-5-->L51: Formula: (< (mod v_thread2Thread1of1ForFork2_~i~1_5 4294967296) (mod v_~c~0_4 4294967296)) InVars {~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} OutVars{~c~0=v_~c~0_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5} AuxVars[] AssignedVars[][60], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), 3458#(= ~x_1~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), 69#L58-4true, Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 2344#(= ~x_1~0 0), 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 3461#(and (<= (+ ~a~0 ~b~0) ~x_3~0) (<= ~x_3~0 (+ ~a~0 ~b~0)) (= ~x_1~0 0) (= ~x_2~0 0)), Black: 3997#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3670#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3999#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 62#L43true, Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 197#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 704#(= thread1Thread1of1ForFork1_~i~0 0), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), 4014#(= ~x_1~0 0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 89#L75-4true, Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:26,225 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-17 22:49:26,225 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:26,225 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:26,225 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-17 22:49:26,353 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 3461#(and (<= (+ ~a~0 ~b~0) ~x_3~0) (<= ~x_3~0 (+ ~a~0 ~b~0)) (= ~x_1~0 0) (= ~x_2~0 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 3997#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), 1785#true, Black: 3670#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3999#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0)]) [2021-12-17 22:49:26,353 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,353 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,353 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,353 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,381 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 39#L51true, Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 3461#(and (<= (+ ~a~0 ~b~0) ~x_3~0) (<= ~x_3~0 (+ ~a~0 ~b~0)) (= ~x_1~0 0) (= ~x_2~0 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3997#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3670#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 1785#true, Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3999#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), 89#L75-4true, Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:26,381 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,381 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,381 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,381 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,381 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,400 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 3461#(and (<= (+ ~a~0 ~b~0) ~x_3~0) (<= ~x_3~0 (+ ~a~0 ~b~0)) (= ~x_1~0 0) (= ~x_2~0 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 3997#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3670#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 1785#true, Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3999#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:26,400 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-17 22:49:26,400 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:49:26,400 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-17 22:49:26,400 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-17 22:49:26,404 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 3461#(and (<= (+ ~a~0 ~b~0) ~x_3~0) (<= ~x_3~0 (+ ~a~0 ~b~0)) (= ~x_1~0 0) (= ~x_2~0 0)), Black: 3997#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3670#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 1785#true, Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3999#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 2342#true, Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0))]) [2021-12-17 22:49:26,404 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-17 22:49:26,404 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-17 22:49:26,404 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:26,404 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-17 22:49:26,404 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-17 22:49:26,404 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([277] thread1EXIT-->L76-2: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork1_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][153], [113#true, 44#L50-2true, Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 94#L76-2true, Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 1221#(and (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) (+ (* 4294967296 (div thread3Thread1of1ForFork0_~i~2 4294967296)) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 145#true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 3456#true, 68#L58-2true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 3461#(and (<= (+ ~a~0 ~b~0) ~x_3~0) (<= ~x_3~0 (+ ~a~0 ~b~0)) (= ~x_1~0 0) (= ~x_2~0 0)), Black: 3997#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3670#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 1785#true, Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3999#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), Black: 702#true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0))]) [2021-12-17 22:49:26,404 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-17 22:49:26,404 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:26,404 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-17 22:49:26,405 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-17 22:49:26,448 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([264] L58-5-->L59: Formula: (< (mod v_thread3Thread1of1ForFork0_~i~2_5 4294967296) (mod v_~c~0_6 4294967296)) InVars {~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} OutVars{~c~0=v_~c~0_6, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5} AuxVars[] AssignedVars[][158], [113#true, Black: 1218#(= thread3Thread1of1ForFork0_~i~2 0), Black: 196#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1220#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) thread1Thread1of1ForFork1_~i~0 1) (+ ~c~0 (* 4294967296 (div thread1Thread1of1ForFork1_~i~0 4294967296))))), Black: 1219#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 1226#true, Black: 2514#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 134#(= thread3Thread1of1ForFork0_~i~2 0), Black: 2632#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), 4012#true, 147#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 145#true, 39#L51true, Black: 148#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), 7#L42-6true, 3456#true, Black: 1792#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 1958#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 3461#(and (<= (+ ~a~0 ~b~0) ~x_3~0) (<= ~x_3~0 (+ ~a~0 ~b~0)) (= ~x_1~0 0) (= ~x_2~0 0)), Black: 159#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 (div (+ (* ~c~0 (- 1)) (* (div ~c~0 4294967296) 4294967296)) 4294967296))), Black: 155#(= thread1Thread1of1ForFork1_~i~0 0), Black: 3997#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 3670#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 1785#true, Black: 3746#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 3999#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4003#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4001#(and (= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 170#(and (= thread2Thread1of1ForFork2_~i~1 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 169#(= thread2Thread1of1ForFork2_~i~1 0), 990#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 2901#true, Black: 177#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0)), Black: 1516#(= (mod (+ ~x_2~0 ~x_1~0) 4294967296) (mod ~x_3~0 4294967296)), Black: 1434#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), 2342#true, Black: 705#(and (= thread1Thread1of1ForFork1_~i~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), Black: 1203#(and (<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0) (< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296))), Black: 704#(= thread1Thread1of1ForFork1_~i~0 0), 64#L59true, 176#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), Black: 204#(<= (+ (* 4294967296 (div ~c~0 4294967296)) 1) ~c~0), 89#L75-4true, Black: 2908#(= (+ (* 4294967296 (div ~x_3~0 4294967296)) ~x_2~0 ~x_1~0) (+ (* 4294967296 (div (+ ~x_2~0 ~x_1~0) 4294967296)) ~x_3~0)), Black: 702#true, Black: 183#(= thread2Thread1of1ForFork2_~i~1 0), Black: 3068#(and (<= ~x_3~0 (+ ~x_2~0 ~x_1~0)) (<= (+ ~x_2~0 ~x_1~0) ~x_3~0)), Black: 1069#(<= (div (+ (mod thread1Thread1of1ForFork1_~i~0 4294967296) (* (mod thread3Thread1of1ForFork0_~i~2 4294967296) (- 1))) (- 4294967296)) 0)]) [2021-12-17 22:49:26,448 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,448 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,448 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,448 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,448 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:26,448 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-17 22:49:27,014 INFO L129 PetriNetUnfolder]: 3688/11480 cut-off events. [2021-12-17 22:49:27,014 INFO L130 PetriNetUnfolder]: For 52984/56882 co-relation queries the response was YES. [2021-12-17 22:49:27,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44783 conditions, 11480 events. 3688/11480 cut-off events. For 52984/56882 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 127731 event pairs, 726 based on Foata normal form. 272/11181 useless extension candidates. Maximal degree in co-relation 44738. Up to 2725 conditions per place. [2021-12-17 22:49:27,244 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 117 selfloop transitions, 32 changer transitions 8/321 dead transitions. [2021-12-17 22:49:27,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 321 transitions, 3023 flow [2021-12-17 22:49:27,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 22:49:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-17 22:49:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1455 transitions. [2021-12-17 22:49:27,246 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.799890049477735 [2021-12-17 22:49:27,246 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1455 transitions. [2021-12-17 22:49:27,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1455 transitions. [2021-12-17 22:49:27,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:27,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1455 transitions. [2021-12-17 22:49:27,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.58823529411765) internal successors, (1455), 17 states have internal predecessors, (1455), 0 states have call successors, (0), 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-17 22:49:27,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-17 22:49:27,252 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 0 states have call successors, (0), 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-17 22:49:27,253 INFO L186 Difference]: Start difference. First operand has 194 places, 277 transitions, 2371 flow. Second operand 17 states and 1455 transitions. [2021-12-17 22:49:27,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 321 transitions, 3023 flow [2021-12-17 22:49:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 321 transitions, 2852 flow, removed 77 selfloop flow, removed 7 redundant places. [2021-12-17 22:49:27,349 INFO L242 Difference]: Finished difference. Result has 206 places, 292 transitions, 2483 flow [2021-12-17 22:49:27,350 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2483, PETRI_PLACES=206, PETRI_TRANSITIONS=292} [2021-12-17 22:49:27,350 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 110 predicate places. [2021-12-17 22:49:27,350 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 292 transitions, 2483 flow [2021-12-17 22:49:27,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.625) internal successors, (1338), 16 states have internal predecessors, (1338), 0 states have call successors, (0), 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-17 22:49:27,351 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:27,351 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 22:49:27,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 22:49:27,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 22:49:27,552 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:27,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1308129123, now seen corresponding path program 7 times [2021-12-17 22:49:27,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:27,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232068293] [2021-12-17 22:49:27,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:27,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:27,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232068293] [2021-12-17 22:49:27,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232068293] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:27,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152701830] [2021-12-17 22:49:27,689 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 22:49:27,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:27,692 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:27,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 22:49:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:27,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 22:49:27,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:28,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:28,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152701830] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:28,253 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:28,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-17 22:49:28,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890657182] [2021-12-17 22:49:28,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:28,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 22:49:28,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:28,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 22:49:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-17 22:49:28,256 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2021-12-17 22:49:28,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 292 transitions, 2483 flow. Second operand has 18 states, 18 states have (on average 80.05555555555556) internal successors, (1441), 18 states have internal predecessors, (1441), 0 states have call successors, (0), 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-17 22:49:28,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:28,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2021-12-17 22:49:28,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:49:47,494 INFO L129 PetriNetUnfolder]: 54460/99703 cut-off events. [2021-12-17 22:49:47,495 INFO L130 PetriNetUnfolder]: For 490090/495599 co-relation queries the response was YES. [2021-12-17 22:49:48,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398329 conditions, 99703 events. 54460/99703 cut-off events. For 490090/495599 co-relation queries the response was YES. Maximal size of possible extension queue 3053. Compared 1012940 event pairs, 2829 based on Foata normal form. 1108/99701 useless extension candidates. Maximal degree in co-relation 398280. Up to 15332 conditions per place. [2021-12-17 22:49:49,455 INFO L132 encePairwiseOnDemand]: 91/107 looper letters, 1052 selfloop transitions, 985 changer transitions 0/2207 dead transitions. [2021-12-17 22:49:49,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 2207 transitions, 23485 flow [2021-12-17 22:49:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2021-12-17 22:49:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2021-12-17 22:49:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 16676 transitions. [2021-12-17 22:49:49,479 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.775375459152834 [2021-12-17 22:49:49,479 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 16676 transitions. [2021-12-17 22:49:49,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 16676 transitions. [2021-12-17 22:49:49,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:49:49,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 16676 transitions. [2021-12-17 22:49:49,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 82.96517412935323) internal successors, (16676), 201 states have internal predecessors, (16676), 0 states have call successors, (0), 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-17 22:49:49,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 107.0) internal successors, (21614), 202 states have internal predecessors, (21614), 0 states have call successors, (0), 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-17 22:49:49,555 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 107.0) internal successors, (21614), 202 states have internal predecessors, (21614), 0 states have call successors, (0), 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-17 22:49:49,556 INFO L186 Difference]: Start difference. First operand has 206 places, 292 transitions, 2483 flow. Second operand 201 states and 16676 transitions. [2021-12-17 22:49:49,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 2207 transitions, 23485 flow [2021-12-17 22:49:50,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2207 transitions, 23334 flow, removed 66 selfloop flow, removed 9 redundant places. [2021-12-17 22:49:51,003 INFO L242 Difference]: Finished difference. Result has 546 places, 1329 transitions, 16364 flow [2021-12-17 22:49:51,004 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=16364, PETRI_PLACES=546, PETRI_TRANSITIONS=1329} [2021-12-17 22:49:51,005 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 450 predicate places. [2021-12-17 22:49:51,005 INFO L470 AbstractCegarLoop]: Abstraction has has 546 places, 1329 transitions, 16364 flow [2021-12-17 22:49:51,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 80.05555555555556) internal successors, (1441), 18 states have internal predecessors, (1441), 0 states have call successors, (0), 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-17 22:49:51,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:49:51,006 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 22:49:51,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 22:49:51,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:51,229 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-17 22:49:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:49:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash -596875945, now seen corresponding path program 8 times [2021-12-17 22:49:51,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:49:51,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058958383] [2021-12-17 22:49:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:49:51,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:49:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:49:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:49:51,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:49:51,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058958383] [2021-12-17 22:49:51,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058958383] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:49:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089700509] [2021-12-17 22:49:51,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:49:51,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:49:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:49:51,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 22:49:51,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 22:49:51,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:49:51,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:49:51,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 22:49:51,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:49:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:51,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:49:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 22:49:51,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089700509] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:49:51,980 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:49:51,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2021-12-17 22:49:51,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322550369] [2021-12-17 22:49:51,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:49:51,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 22:49:51,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:49:51,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 22:49:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-12-17 22:49:51,982 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2021-12-17 22:49:51,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 1329 transitions, 16364 flow. Second operand has 21 states, 21 states have (on average 79.38095238095238) internal successors, (1667), 21 states have internal predecessors, (1667), 0 states have call successors, (0), 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-17 22:49:51,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:49:51,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2021-12-17 22:49:51,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand