./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-16 03:02:52,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 03:02:52,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 03:02:52,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 03:02:52,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 03:02:52,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 03:02:52,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 03:02:52,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 03:02:52,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 03:02:52,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 03:02:52,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 03:02:52,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 03:02:52,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 03:02:52,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 03:02:52,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 03:02:52,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 03:02:52,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 03:02:52,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 03:02:52,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 03:02:52,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 03:02:52,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 03:02:52,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 03:02:52,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 03:02:52,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 03:02:52,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 03:02:52,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 03:02:52,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 03:02:52,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 03:02:52,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 03:02:52,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 03:02:52,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 03:02:52,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 03:02:52,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 03:02:52,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 03:02:52,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 03:02:52,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 03:02:52,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 03:02:52,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 03:02:52,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 03:02:52,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 03:02:52,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 03:02:52,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 03:02:52,755 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 03:02:52,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 03:02:52,756 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 03:02:52,756 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 03:02:52,757 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 03:02:52,757 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 03:02:52,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 03:02:52,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 03:02:52,758 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 03:02:52,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 03:02:52,759 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 03:02:52,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 03:02:52,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 03:02:52,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 03:02:52,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 03:02:52,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 03:02:52,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 03:02:52,760 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 03:02:52,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 03:02:52,761 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 03:02:52,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 03:02:52,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 03:02:52,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 03:02:52,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 03:02:52,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:02:52,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 03:02:52,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 03:02:52,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 03:02:52,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 03:02:52,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 03:02:52,763 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 03:02:52,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 03:02:52,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 03:02:52,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 03:02:52,764 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-16 03:02:53,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 03:02:53,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 03:02:53,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 03:02:53,035 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 03:02:53,036 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 03:02:53,037 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-16 03:02:53,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8d12686/189e5966dc3d497f98f50637d2b3494f/FLAGdbb003291 [2021-12-16 03:02:53,533 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 03:02:53,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2021-12-16 03:02:53,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8d12686/189e5966dc3d497f98f50637d2b3494f/FLAGdbb003291 [2021-12-16 03:02:53,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8d12686/189e5966dc3d497f98f50637d2b3494f [2021-12-16 03:02:53,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 03:02:53,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 03:02:53,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 03:02:53,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 03:02:53,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 03:02:53,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:02:53" (1/1) ... [2021-12-16 03:02:53,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5a4de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:53, skipping insertion in model container [2021-12-16 03:02:53,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:02:53" (1/1) ... [2021-12-16 03:02:53,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 03:02:53,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 03:02:54,144 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-16 03:02:54,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:02:54,163 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 03:02:54,196 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-16 03:02:54,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 03:02:54,217 INFO L208 MainTranslator]: Completed translation [2021-12-16 03:02:54,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54 WrapperNode [2021-12-16 03:02:54,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 03:02:54,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 03:02:54,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 03:02:54,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 03:02:54,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,269 INFO L137 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2021-12-16 03:02:54,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 03:02:54,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 03:02:54,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 03:02:54,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 03:02:54,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 03:02:54,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 03:02:54,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 03:02:54,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 03:02:54,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (1/1) ... [2021-12-16 03:02:54,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 03:02:54,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:02:54,333 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-16 03:02:54,338 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-16 03:02:54,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 03:02:54,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-16 03:02:54,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-16 03:02:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-16 03:02:54,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-16 03:02:54,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-16 03:02:54,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-16 03:02:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 03:02:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 03:02:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 03:02:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 03:02:54,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 03:02:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 03:02:54,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 03:02:54,372 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 03:02:54,447 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 03:02:54,448 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 03:02:54,597 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 03:02:54,604 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 03:02:54,604 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 03:02:54,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:02:54 BoogieIcfgContainer [2021-12-16 03:02:54,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 03:02:54,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 03:02:54,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 03:02:54,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 03:02:54,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:02:53" (1/3) ... [2021-12-16 03:02:54,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e796076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:02:54, skipping insertion in model container [2021-12-16 03:02:54,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:02:54" (2/3) ... [2021-12-16 03:02:54,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e796076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:02:54, skipping insertion in model container [2021-12-16 03:02:54,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:02:54" (3/3) ... [2021-12-16 03:02:54,615 INFO L111 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2021-12-16 03:02:54,619 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 03:02:54,619 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 03:02:54,619 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 03:02:54,620 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 03:02:54,650 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,651 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,651 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,651 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,652 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,652 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,652 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,652 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,653 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,653 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,653 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,653 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,654 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,654 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,654 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,655 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,655 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,655 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,656 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,656 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,656 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,656 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,657 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,657 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,657 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,657 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,658 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,658 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,658 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,658 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,659 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,659 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,659 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,659 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,659 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,660 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,660 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,660 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,661 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,661 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,661 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,661 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,662 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,662 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,662 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,662 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,662 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,663 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,663 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,663 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,663 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,663 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,664 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,664 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,664 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,664 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,664 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,665 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,667 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,668 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,668 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,683 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,684 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,684 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,685 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,685 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 03:02:54,688 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-16 03:02:54,756 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 03:02:54,765 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-16 03:02:54,765 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-16 03:02:54,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 238 flow [2021-12-16 03:02:54,843 INFO L129 PetriNetUnfolder]: 7/104 cut-off events. [2021-12-16 03:02:54,844 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-16 03:02:54,847 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-16 03:02:54,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 238 flow [2021-12-16 03:02:54,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 204 flow [2021-12-16 03:02:54,879 INFO L129 PetriNetUnfolder]: 7/92 cut-off events. [2021-12-16 03:02:54,887 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-16 03:02:54,887 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:54,890 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-16 03:02:54,890 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-16 03:02:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash 588643027, now seen corresponding path program 1 times [2021-12-16 03:02:54,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:54,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940424778] [2021-12-16 03:02:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:54,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:55,097 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-16 03:02:55,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:55,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940424778] [2021-12-16 03:02:55,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940424778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:55,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:55,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 03:02:55,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110674406] [2021-12-16 03:02:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:55,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 03:02:55,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 03:02:55,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 03:02:55,150 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2021-12-16 03:02:55,158 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-16 03:02:55,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:55,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2021-12-16 03:02:55,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:55,226 INFO L129 PetriNetUnfolder]: 3/89 cut-off events. [2021-12-16 03:02:55,230 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-12-16 03:02:55,231 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-16 03:02:55,234 INFO L132 encePairwiseOnDemand]: 103/107 looper letters, 6 selfloop transitions, 0 changer transitions 1/89 dead transitions. [2021-12-16 03:02:55,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 208 flow [2021-12-16 03:02:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 03:02:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-16 03:02:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2021-12-16 03:02:55,249 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9439252336448598 [2021-12-16 03:02:55,250 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2021-12-16 03:02:55,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2021-12-16 03:02:55,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:55,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2021-12-16 03:02:55,258 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-16 03:02:55,264 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-16 03:02:55,265 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-16 03:02:55,267 INFO L186 Difference]: Start difference. First operand has 96 places, 93 transitions, 204 flow. Second operand 2 states and 202 transitions. [2021-12-16 03:02:55,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 208 flow [2021-12-16 03:02:55,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-16 03:02:55,277 INFO L242 Difference]: Finished difference. Result has 91 places, 88 transitions, 182 flow [2021-12-16 03:02:55,279 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-16 03:02:55,282 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, -5 predicate places. [2021-12-16 03:02:55,282 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 182 flow [2021-12-16 03:02:55,283 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-16 03:02:55,283 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:55,283 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-16 03:02:55,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 03:02:55,284 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-16 03:02:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash -129768965, now seen corresponding path program 1 times [2021-12-16 03:02:55,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:55,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96360311] [2021-12-16 03:02:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:55,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:55,599 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-16 03:02:55,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:55,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96360311] [2021-12-16 03:02:55,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96360311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:55,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:55,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 03:02:55,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203680625] [2021-12-16 03:02:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:55,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 03:02:55,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:55,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 03:02:55,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-16 03:02:55,612 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-16 03:02:55,613 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-16 03:02:55,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:55,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-16 03:02:55,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:55,795 INFO L129 PetriNetUnfolder]: 53/322 cut-off events. [2021-12-16 03:02:55,796 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-12-16 03:02:55,803 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-16 03:02:55,806 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 35 selfloop transitions, 9 changer transitions 4/120 dead transitions. [2021-12-16 03:02:55,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 354 flow [2021-12-16 03:02:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 03:02:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-16 03:02:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2021-12-16 03:02:55,814 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8598130841121495 [2021-12-16 03:02:55,814 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2021-12-16 03:02:55,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2021-12-16 03:02:55,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:55,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2021-12-16 03:02:55,819 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-16 03:02:55,823 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-16 03:02:55,824 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-16 03:02:55,824 INFO L186 Difference]: Start difference. First operand has 91 places, 88 transitions, 182 flow. Second operand 7 states and 644 transitions. [2021-12-16 03:02:55,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 354 flow [2021-12-16 03:02:55,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 120 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 03:02:55,829 INFO L242 Difference]: Finished difference. Result has 100 places, 94 transitions, 235 flow [2021-12-16 03:02:55,829 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-16 03:02:55,830 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 4 predicate places. [2021-12-16 03:02:55,831 INFO L470 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 235 flow [2021-12-16 03:02:55,831 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-16 03:02:55,832 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:55,832 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-16 03:02:55,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 03:02:55,833 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-16 03:02:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash 891063948, now seen corresponding path program 1 times [2021-12-16 03:02:55,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:55,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298164112] [2021-12-16 03:02:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:55,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:55,968 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-16 03:02:55,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298164112] [2021-12-16 03:02:55,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298164112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:55,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:55,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:02:55,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624420138] [2021-12-16 03:02:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:55,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:02:55,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:55,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:02:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:02:55,972 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-16 03:02:55,973 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-16 03:02:55,973 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:55,973 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-16 03:02:55,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:56,298 INFO L129 PetriNetUnfolder]: 877/2022 cut-off events. [2021-12-16 03:02:56,299 INFO L130 PetriNetUnfolder]: For 171/172 co-relation queries the response was YES. [2021-12-16 03:02:56,306 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-16 03:02:56,316 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 40 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2021-12-16 03:02:56,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 387 flow [2021-12-16 03:02:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:02:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 03:02:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2021-12-16 03:02:56,319 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2021-12-16 03:02:56,319 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2021-12-16 03:02:56,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2021-12-16 03:02:56,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:56,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2021-12-16 03:02:56,321 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-16 03:02:56,322 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-16 03:02:56,323 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-16 03:02:56,323 INFO L186 Difference]: Start difference. First operand has 100 places, 94 transitions, 235 flow. Second operand 6 states and 542 transitions. [2021-12-16 03:02:56,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 387 flow [2021-12-16 03:02:56,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 120 transitions, 383 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-12-16 03:02:56,328 INFO L242 Difference]: Finished difference. Result has 104 places, 97 transitions, 269 flow [2021-12-16 03:02:56,328 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-16 03:02:56,329 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2021-12-16 03:02:56,329 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 97 transitions, 269 flow [2021-12-16 03:02:56,330 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-16 03:02:56,330 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:56,330 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-16 03:02:56,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 03:02:56,331 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-16 03:02:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1819342954, now seen corresponding path program 2 times [2021-12-16 03:02:56,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:56,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321239573] [2021-12-16 03:02:56,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:56,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:56,411 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-16 03:02:56,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321239573] [2021-12-16 03:02:56,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321239573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:56,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:56,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:02:56,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199649676] [2021-12-16 03:02:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:56,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:02:56,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:56,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:02:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:02:56,414 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-16 03:02:56,414 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-16 03:02:56,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:56,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-16 03:02:56,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:56,725 INFO L129 PetriNetUnfolder]: 901/2408 cut-off events. [2021-12-16 03:02:56,725 INFO L130 PetriNetUnfolder]: For 1120/1233 co-relation queries the response was YES. [2021-12-16 03:02:56,738 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-16 03:02:56,751 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 33 selfloop transitions, 5 changer transitions 2/119 dead transitions. [2021-12-16 03:02:56,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 426 flow [2021-12-16 03:02:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 03:02:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-16 03:02:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-12-16 03:02:56,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2021-12-16 03:02:56,754 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-12-16 03:02:56,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-12-16 03:02:56,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:56,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-12-16 03:02:56,756 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-16 03:02:56,757 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-16 03:02:56,757 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-16 03:02:56,758 INFO L186 Difference]: Start difference. First operand has 104 places, 97 transitions, 269 flow. Second operand 4 states and 379 transitions. [2021-12-16 03:02:56,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 426 flow [2021-12-16 03:02:56,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 03:02:56,766 INFO L242 Difference]: Finished difference. Result has 108 places, 102 transitions, 313 flow [2021-12-16 03:02:56,766 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-16 03:02:56,768 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2021-12-16 03:02:56,768 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 313 flow [2021-12-16 03:02:56,769 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-16 03:02:56,769 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:56,769 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-16 03:02:56,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 03:02:56,769 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-16 03:02:56,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1069972452, now seen corresponding path program 1 times [2021-12-16 03:02:56,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:56,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008706832] [2021-12-16 03:02:56,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:56,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:56,945 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-16 03:02:56,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:56,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008706832] [2021-12-16 03:02:56,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008706832] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:56,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:56,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:02:56,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463237906] [2021-12-16 03:02:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:56,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:02:56,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:02:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:02:56,948 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-16 03:02:56,949 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-16 03:02:56,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:56,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-16 03:02:56,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:57,351 INFO L129 PetriNetUnfolder]: 1128/2972 cut-off events. [2021-12-16 03:02:57,351 INFO L130 PetriNetUnfolder]: For 3069/3307 co-relation queries the response was YES. [2021-12-16 03:02:57,363 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-16 03:02:57,381 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 52 selfloop transitions, 7 changer transitions 1/136 dead transitions. [2021-12-16 03:02:57,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 571 flow [2021-12-16 03:02:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:02:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 03:02:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2021-12-16 03:02:57,384 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8473520249221184 [2021-12-16 03:02:57,384 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 544 transitions. [2021-12-16 03:02:57,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions. [2021-12-16 03:02:57,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:57,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions. [2021-12-16 03:02:57,386 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-16 03:02:57,388 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-16 03:02:57,389 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-16 03:02:57,389 INFO L186 Difference]: Start difference. First operand has 108 places, 102 transitions, 313 flow. Second operand 6 states and 544 transitions. [2021-12-16 03:02:57,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 571 flow [2021-12-16 03:02:57,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 03:02:57,396 INFO L242 Difference]: Finished difference. Result has 116 places, 105 transitions, 364 flow [2021-12-16 03:02:57,396 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-16 03:02:57,399 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2021-12-16 03:02:57,399 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 364 flow [2021-12-16 03:02:57,400 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-16 03:02:57,400 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:57,400 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-16 03:02:57,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 03:02:57,403 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-16 03:02:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:57,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1680413944, now seen corresponding path program 3 times [2021-12-16 03:02:57,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:57,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390498192] [2021-12-16 03:02:57,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:57,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:57,518 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-16 03:02:57,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:57,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390498192] [2021-12-16 03:02:57,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390498192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:57,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:57,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:02:57,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137816793] [2021-12-16 03:02:57,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:57,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:02:57,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:57,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:02:57,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:02:57,522 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-16 03:02:57,536 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-16 03:02:57,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:57,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-16 03:02:57,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:58,016 INFO L129 PetriNetUnfolder]: 1170/3388 cut-off events. [2021-12-16 03:02:58,016 INFO L130 PetriNetUnfolder]: For 5484/5889 co-relation queries the response was YES. [2021-12-16 03:02:58,032 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-16 03:02:58,055 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 10 changer transitions 2/132 dead transitions. [2021-12-16 03:02:58,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 132 transitions, 616 flow [2021-12-16 03:02:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 03:02:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-16 03:02:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-12-16 03:02:58,057 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8855140186915887 [2021-12-16 03:02:58,057 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-12-16 03:02:58,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-12-16 03:02:58,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:58,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-12-16 03:02:58,059 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-16 03:02:58,060 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-16 03:02:58,060 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-16 03:02:58,061 INFO L186 Difference]: Start difference. First operand has 116 places, 105 transitions, 364 flow. Second operand 4 states and 379 transitions. [2021-12-16 03:02:58,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 132 transitions, 616 flow [2021-12-16 03:02:58,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 132 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 03:02:58,069 INFO L242 Difference]: Finished difference. Result has 119 places, 111 transitions, 459 flow [2021-12-16 03:02:58,069 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-16 03:02:58,071 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 23 predicate places. [2021-12-16 03:02:58,072 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 111 transitions, 459 flow [2021-12-16 03:02:58,072 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-16 03:02:58,072 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:58,072 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-16 03:02:58,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 03:02:58,073 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-16 03:02:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1752919980, now seen corresponding path program 1 times [2021-12-16 03:02:58,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:58,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862800319] [2021-12-16 03:02:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:58,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:58,168 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-16 03:02:58,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:58,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862800319] [2021-12-16 03:02:58,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862800319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:58,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:58,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:02:58,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943911143] [2021-12-16 03:02:58,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:58,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:02:58,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:58,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:02:58,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:02:58,172 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-16 03:02:58,172 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-16 03:02:58,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:58,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-16 03:02:58,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:58,655 INFO L129 PetriNetUnfolder]: 1308/3777 cut-off events. [2021-12-16 03:02:58,656 INFO L130 PetriNetUnfolder]: For 12859/13724 co-relation queries the response was YES. [2021-12-16 03:02:58,678 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-16 03:02:58,702 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 37 selfloop transitions, 8 changer transitions 6/133 dead transitions. [2021-12-16 03:02:58,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 133 transitions, 707 flow [2021-12-16 03:02:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 03:02:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-16 03:02:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2021-12-16 03:02:58,704 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.883177570093458 [2021-12-16 03:02:58,704 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2021-12-16 03:02:58,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2021-12-16 03:02:58,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:58,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2021-12-16 03:02:58,706 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-16 03:02:58,707 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-16 03:02:58,709 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-16 03:02:58,709 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 459 flow. Second operand 4 states and 378 transitions. [2021-12-16 03:02:58,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 133 transitions, 707 flow [2021-12-16 03:02:58,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 133 transitions, 703 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-16 03:02:58,719 INFO L242 Difference]: Finished difference. Result has 123 places, 113 transitions, 498 flow [2021-12-16 03:02:58,720 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-16 03:02:58,720 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2021-12-16 03:02:58,720 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 498 flow [2021-12-16 03:02:58,721 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-16 03:02:58,721 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:58,721 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-16 03:02:58,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 03:02:58,722 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-16 03:02:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -215684502, now seen corresponding path program 4 times [2021-12-16 03:02:58,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:58,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138223641] [2021-12-16 03:02:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:58,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:58,790 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-16 03:02:58,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:58,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138223641] [2021-12-16 03:02:58,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138223641] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:58,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:58,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 03:02:58,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270068906] [2021-12-16 03:02:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:58,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 03:02:58,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:58,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 03:02:58,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 03:02:58,793 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-16 03:02:58,794 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-16 03:02:58,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:58,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-16 03:02:58,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:02:59,527 INFO L129 PetriNetUnfolder]: 2135/5361 cut-off events. [2021-12-16 03:02:59,528 INFO L130 PetriNetUnfolder]: For 14252/14950 co-relation queries the response was YES. [2021-12-16 03:02:59,552 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-16 03:02:59,586 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 46 selfloop transitions, 6 changer transitions 16/144 dead transitions. [2021-12-16 03:02:59,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 144 transitions, 814 flow [2021-12-16 03:02:59,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:02:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 03:02:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2021-12-16 03:02:59,589 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442367601246106 [2021-12-16 03:02:59,589 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 542 transitions. [2021-12-16 03:02:59,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 542 transitions. [2021-12-16 03:02:59,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:02:59,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 542 transitions. [2021-12-16 03:02:59,591 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-16 03:02:59,593 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-16 03:02:59,593 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-16 03:02:59,593 INFO L186 Difference]: Start difference. First operand has 123 places, 113 transitions, 498 flow. Second operand 6 states and 542 transitions. [2021-12-16 03:02:59,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 144 transitions, 814 flow [2021-12-16 03:02:59,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 144 transitions, 799 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-12-16 03:02:59,608 INFO L242 Difference]: Finished difference. Result has 130 places, 112 transitions, 499 flow [2021-12-16 03:02:59,608 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-16 03:02:59,610 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2021-12-16 03:02:59,610 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 499 flow [2021-12-16 03:02:59,611 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-16 03:02:59,611 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:02:59,611 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-16 03:02:59,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 03:02:59,611 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-16 03:02:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:02:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash 401888418, now seen corresponding path program 2 times [2021-12-16 03:02:59,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:02:59,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551540492] [2021-12-16 03:02:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:02:59,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:02:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:02:59,688 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-16 03:02:59,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:02:59,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551540492] [2021-12-16 03:02:59,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551540492] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:02:59,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:02:59,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 03:02:59,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088207320] [2021-12-16 03:02:59,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:02:59,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:02:59,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:02:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:02:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 03:02:59,691 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-16 03:02:59,692 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-16 03:02:59,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:02:59,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-16 03:02:59,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:00,050 INFO L129 PetriNetUnfolder]: 1236/3192 cut-off events. [2021-12-16 03:03:00,050 INFO L130 PetriNetUnfolder]: For 13531/14630 co-relation queries the response was YES. [2021-12-16 03:03:00,069 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-16 03:03:00,087 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 40 selfloop transitions, 15 changer transitions 3/139 dead transitions. [2021-12-16 03:03:00,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 139 transitions, 858 flow [2021-12-16 03:03:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 03:03:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-16 03:03:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 376 transitions. [2021-12-16 03:03:00,089 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8785046728971962 [2021-12-16 03:03:00,089 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 376 transitions. [2021-12-16 03:03:00,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 376 transitions. [2021-12-16 03:03:00,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:00,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 376 transitions. [2021-12-16 03:03:00,091 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-16 03:03:00,092 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-16 03:03:00,092 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-16 03:03:00,092 INFO L186 Difference]: Start difference. First operand has 130 places, 112 transitions, 499 flow. Second operand 4 states and 376 transitions. [2021-12-16 03:03:00,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 139 transitions, 858 flow [2021-12-16 03:03:00,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 139 transitions, 794 flow, removed 26 selfloop flow, removed 6 redundant places. [2021-12-16 03:03:00,107 INFO L242 Difference]: Finished difference. Result has 125 places, 119 transitions, 614 flow [2021-12-16 03:03:00,107 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-16 03:03:00,108 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2021-12-16 03:03:00,109 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 119 transitions, 614 flow [2021-12-16 03:03:00,109 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-16 03:03:00,109 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:00,109 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-16 03:03:00,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 03:03:00,110 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-16 03:03:00,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1597009161, now seen corresponding path program 1 times [2021-12-16 03:03:00,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:00,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798716698] [2021-12-16 03:03:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:00,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:00,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-16 03:03:00,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:00,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798716698] [2021-12-16 03:03:00,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798716698] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:00,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548612302] [2021-12-16 03:03:00,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:00,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:00,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:00,187 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-16 03:03:00,226 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-16 03:03:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:00,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 03:03:00,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:00,473 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-16 03:03:00,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:00,643 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-16 03:03:00,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548612302] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:00,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-16 03:03:00,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2021-12-16 03:03:00,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76945875] [2021-12-16 03:03:00,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:03:00,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 03:03:00,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 03:03:00,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-16 03:03:00,650 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-12-16 03:03:00,650 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-16 03:03:00,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:00,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-12-16 03:03:00,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:01,052 INFO L129 PetriNetUnfolder]: 1406/3297 cut-off events. [2021-12-16 03:03:01,052 INFO L130 PetriNetUnfolder]: For 14591/15799 co-relation queries the response was YES. [2021-12-16 03:03:01,080 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-16 03:03:01,104 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 39 selfloop transitions, 15 changer transitions 1/138 dead transitions. [2021-12-16 03:03:01,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 138 transitions, 893 flow [2021-12-16 03:03:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 03:03:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-12-16 03:03:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2021-12-16 03:03:01,107 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8691588785046729 [2021-12-16 03:03:01,107 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 372 transitions. [2021-12-16 03:03:01,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 372 transitions. [2021-12-16 03:03:01,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:01,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 372 transitions. [2021-12-16 03:03:01,109 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-16 03:03:01,110 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-16 03:03:01,111 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-16 03:03:01,111 INFO L186 Difference]: Start difference. First operand has 125 places, 119 transitions, 614 flow. Second operand 4 states and 372 transitions. [2021-12-16 03:03:01,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 138 transitions, 893 flow [2021-12-16 03:03:01,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 138 transitions, 873 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-16 03:03:01,122 INFO L242 Difference]: Finished difference. Result has 125 places, 123 transitions, 695 flow [2021-12-16 03:03:01,123 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-16 03:03:01,123 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2021-12-16 03:03:01,124 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 123 transitions, 695 flow [2021-12-16 03:03:01,124 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-16 03:03:01,124 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:01,124 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-16 03:03:01,155 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-16 03:03:01,337 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-16 03:03:01,338 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-16 03:03:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 739778129, now seen corresponding path program 2 times [2021-12-16 03:03:01,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:01,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313911820] [2021-12-16 03:03:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:01,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:01,457 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-16 03:03:01,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313911820] [2021-12-16 03:03:01,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313911820] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916539726] [2021-12-16 03:03:01,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 03:03:01,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:01,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:01,460 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-16 03:03:01,489 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-16 03:03:01,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 03:03:01,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:03:01,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 03:03:01,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:01,819 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-16 03:03:01,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:01,983 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-16 03:03:01,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916539726] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:01,983 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:01,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2021-12-16 03:03:01,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289260640] [2021-12-16 03:03:01,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:01,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 03:03:01,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:01,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 03:03:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 03:03:01,986 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-16 03:03:01,987 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-16 03:03:01,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:01,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-16 03:03:01,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:02,788 INFO L129 PetriNetUnfolder]: 3104/6639 cut-off events. [2021-12-16 03:03:02,788 INFO L130 PetriNetUnfolder]: For 32239/33949 co-relation queries the response was YES. [2021-12-16 03:03:02,831 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-16 03:03:02,877 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 106 selfloop transitions, 61 changer transitions 1/245 dead transitions. [2021-12-16 03:03:02,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 245 transitions, 2183 flow [2021-12-16 03:03:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 03:03:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 03:03:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 918 transitions. [2021-12-16 03:03:02,880 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8579439252336448 [2021-12-16 03:03:02,880 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 918 transitions. [2021-12-16 03:03:02,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 918 transitions. [2021-12-16 03:03:02,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:02,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 918 transitions. [2021-12-16 03:03:02,883 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-16 03:03:02,886 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-16 03:03:02,886 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-16 03:03:02,886 INFO L186 Difference]: Start difference. First operand has 125 places, 123 transitions, 695 flow. Second operand 10 states and 918 transitions. [2021-12-16 03:03:02,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 245 transitions, 2183 flow [2021-12-16 03:03:02,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 245 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-16 03:03:02,907 INFO L242 Difference]: Finished difference. Result has 140 places, 171 transitions, 1483 flow [2021-12-16 03:03:02,908 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-16 03:03:02,908 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2021-12-16 03:03:02,909 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 171 transitions, 1483 flow [2021-12-16 03:03:02,909 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-16 03:03:02,909 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:02,909 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-16 03:03:02,937 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-16 03:03:03,134 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-16 03:03:03,134 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-16 03:03:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1255263895, now seen corresponding path program 3 times [2021-12-16 03:03:03,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:03,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224985090] [2021-12-16 03:03:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:03,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:03,211 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-16 03:03:03,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224985090] [2021-12-16 03:03:03,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224985090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 03:03:03,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 03:03:03,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 03:03:03,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381935566] [2021-12-16 03:03:03,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 03:03:03,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 03:03:03,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 03:03:03,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-16 03:03:03,216 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-12-16 03:03:03,217 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-16 03:03:03,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:03,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-12-16 03:03:03,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:03,708 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-16 03:03:03,709 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:03,709 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:03,709 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:03,709 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:03,709 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-16 03:03:03,709 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:03,709 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:03,709 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:03,709 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:03,750 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-16 03:03:03,750 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:03,751 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:03,751 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:03,751 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:03,751 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-16 03:03:03,751 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:03,751 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:03,752 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:03,752 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:03,978 INFO L129 PetriNetUnfolder]: 3308/6879 cut-off events. [2021-12-16 03:03:03,978 INFO L130 PetriNetUnfolder]: For 52640/55882 co-relation queries the response was YES. [2021-12-16 03:03:04,021 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-16 03:03:04,082 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 97 selfloop transitions, 51 changer transitions 2/227 dead transitions. [2021-12-16 03:03:04,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 227 transitions, 2450 flow [2021-12-16 03:03:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 03:03:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 03:03:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2021-12-16 03:03:04,085 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8566978193146417 [2021-12-16 03:03:04,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 550 transitions. [2021-12-16 03:03:04,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 550 transitions. [2021-12-16 03:03:04,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:04,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 550 transitions. [2021-12-16 03:03:04,087 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-16 03:03:04,089 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-16 03:03:04,089 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-16 03:03:04,089 INFO L186 Difference]: Start difference. First operand has 140 places, 171 transitions, 1483 flow. Second operand 6 states and 550 transitions. [2021-12-16 03:03:04,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 227 transitions, 2450 flow [2021-12-16 03:03:04,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 227 transitions, 2426 flow, removed 12 selfloop flow, removed 0 redundant places. [2021-12-16 03:03:04,153 INFO L242 Difference]: Finished difference. Result has 148 places, 190 transitions, 1950 flow [2021-12-16 03:03:04,154 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-16 03:03:04,154 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 52 predicate places. [2021-12-16 03:03:04,154 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 1950 flow [2021-12-16 03:03:04,155 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-16 03:03:04,155 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:04,155 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-16 03:03:04,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 03:03:04,156 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-16 03:03:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash 856452868, now seen corresponding path program 1 times [2021-12-16 03:03:04,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:04,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356877568] [2021-12-16 03:03:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:04,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:04,306 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-16 03:03:04,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:04,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356877568] [2021-12-16 03:03:04,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356877568] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:04,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323424630] [2021-12-16 03:03:04,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:04,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:04,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:04,309 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-16 03:03:04,319 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-16 03:03:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:04,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 03:03:04,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:04,948 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-16 03:03:04,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:05,240 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-16 03:03:05,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323424630] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:05,240 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:05,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-16 03:03:05,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512386239] [2021-12-16 03:03:05,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:05,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 03:03:05,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:05,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 03:03:05,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:03:05,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-16 03:03:05,244 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-16 03:03:05,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:05,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-16 03:03:05,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:05,679 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-16 03:03:05,680 INFO L384 tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event [2021-12-16 03:03:05,680 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:05,680 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:05,680 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:05,772 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-16 03:03:05,772 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:05,772 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:05,772 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:05,772 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:05,793 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-16 03:03:05,793 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:05,793 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:05,793 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:05,793 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:05,810 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-16 03:03:05,810 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:05,810 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:05,810 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:05,810 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:05,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[][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-16 03:03:05,841 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-16 03:03:05,841 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:05,842 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:05,842 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:05,858 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-16 03:03:05,858 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2021-12-16 03:03:05,858 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-16 03:03:05,858 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is not cut-off event [2021-12-16 03:03:05,858 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2021-12-16 03:03:06,063 INFO L129 PetriNetUnfolder]: 1905/5784 cut-off events. [2021-12-16 03:03:06,063 INFO L130 PetriNetUnfolder]: For 29678/31177 co-relation queries the response was YES. [2021-12-16 03:03:06,115 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-16 03:03:06,153 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 41 selfloop transitions, 31 changer transitions 8/244 dead transitions. [2021-12-16 03:03:06,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 244 transitions, 2293 flow [2021-12-16 03:03:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 03:03:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-16 03:03:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1540 transitions. [2021-12-16 03:03:06,157 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2021-12-16 03:03:06,158 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1540 transitions. [2021-12-16 03:03:06,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1540 transitions. [2021-12-16 03:03:06,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:06,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1540 transitions. [2021-12-16 03:03:06,162 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-16 03:03:06,165 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-16 03:03:06,166 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-16 03:03:06,166 INFO L186 Difference]: Start difference. First operand has 148 places, 190 transitions, 1950 flow. Second operand 18 states and 1540 transitions. [2021-12-16 03:03:06,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 244 transitions, 2293 flow [2021-12-16 03:03:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 244 transitions, 2102 flow, removed 64 selfloop flow, removed 6 redundant places. [2021-12-16 03:03:06,219 INFO L242 Difference]: Finished difference. Result has 164 places, 211 transitions, 1951 flow [2021-12-16 03:03:06,219 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-16 03:03:06,220 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 68 predicate places. [2021-12-16 03:03:06,220 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 211 transitions, 1951 flow [2021-12-16 03:03:06,220 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-16 03:03:06,221 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:06,221 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-16 03:03:06,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 03:03:06,443 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-16 03:03:06,444 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-16 03:03:06,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1297516402, now seen corresponding path program 2 times [2021-12-16 03:03:06,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:06,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573591308] [2021-12-16 03:03:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:06,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:06,600 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-16 03:03:06,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:06,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573591308] [2021-12-16 03:03:06,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573591308] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:06,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644655733] [2021-12-16 03:03:06,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 03:03:06,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:06,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:06,603 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-16 03:03:06,604 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-16 03:03:06,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 03:03:06,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:03:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 03:03:06,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:07,220 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-16 03:03:07,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:07,536 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-16 03:03:07,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644655733] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:07,536 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:07,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-16 03:03:07,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841608283] [2021-12-16 03:03:07,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:07,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 03:03:07,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 03:03:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:03:07,541 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-16 03:03:07,542 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-16 03:03:07,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:07,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-16 03:03:07,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:07,782 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-16 03:03:07,782 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-16 03:03:07,782 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-16 03:03:07,782 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-16 03:03:07,782 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:07,976 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-16 03:03:07,976 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:07,976 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:07,977 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:07,977 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:08,017 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-16 03:03:08,017 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:08,017 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:08,017 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:08,017 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:08,017 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-16 03:03:08,018 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:08,018 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:08,018 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:08,018 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:08,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: 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-16 03:03:08,136 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:08,136 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:08,136 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:08,136 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:08,137 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-16 03:03:08,137 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:08,137 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:08,137 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:08,137 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:08,138 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-16 03:03:08,138 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-16 03:03:08,138 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:08,138 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:08,138 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:08,249 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-16 03:03:08,249 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:08,249 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:08,249 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:08,249 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:08,283 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-16 03:03:08,283 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:08,283 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:08,284 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:08,284 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:03:08,312 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-16 03:03:08,312 INFO L384 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2021-12-16 03:03:08,312 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-16 03:03:08,313 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-16 03:03:08,313 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-16 03:03:08,528 INFO L129 PetriNetUnfolder]: 2345/7257 cut-off events. [2021-12-16 03:03:08,528 INFO L130 PetriNetUnfolder]: For 30265/32318 co-relation queries the response was YES. [2021-12-16 03:03:08,586 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-16 03:03:08,627 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 59 selfloop transitions, 30 changer transitions 8/261 dead transitions. [2021-12-16 03:03:08,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 261 transitions, 2376 flow [2021-12-16 03:03:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 03:03:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-16 03:03:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1461 transitions. [2021-12-16 03:03:08,631 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8031885651456845 [2021-12-16 03:03:08,631 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1461 transitions. [2021-12-16 03:03:08,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1461 transitions. [2021-12-16 03:03:08,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:08,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1461 transitions. [2021-12-16 03:03:08,635 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-16 03:03:08,638 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-16 03:03:08,639 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-16 03:03:08,639 INFO L186 Difference]: Start difference. First operand has 164 places, 211 transitions, 1951 flow. Second operand 17 states and 1461 transitions. [2021-12-16 03:03:08,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 261 transitions, 2376 flow [2021-12-16 03:03:08,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 261 transitions, 2207 flow, removed 68 selfloop flow, removed 13 redundant places. [2021-12-16 03:03:08,709 INFO L242 Difference]: Finished difference. Result has 169 places, 226 transitions, 1992 flow [2021-12-16 03:03:08,709 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-16 03:03:08,710 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 73 predicate places. [2021-12-16 03:03:08,710 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 226 transitions, 1992 flow [2021-12-16 03:03:08,710 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-16 03:03:08,710 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:08,711 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-16 03:03:08,735 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-16 03:03:08,927 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-16 03:03:08,927 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-16 03:03:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1516377056, now seen corresponding path program 3 times [2021-12-16 03:03:08,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:08,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978677849] [2021-12-16 03:03:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:08,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:09,108 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-16 03:03:09,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:09,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978677849] [2021-12-16 03:03:09,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978677849] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:09,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589979558] [2021-12-16 03:03:09,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 03:03:09,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:09,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:09,111 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-16 03:03:09,112 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-16 03:03:09,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-16 03:03:09,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:03:09,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 03:03:09,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:09,743 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-16 03:03:09,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:10,023 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-16 03:03:10,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589979558] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:10,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:10,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-16 03:03:10,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434760378] [2021-12-16 03:03:10,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:10,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 03:03:10,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:10,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 03:03:10,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:03:10,027 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-16 03:03:10,028 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-16 03:03:10,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:10,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-16 03:03:10,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:10,230 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-16 03:03:10,230 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,230 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-16 03:03:10,230 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-16 03:03:10,231 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,350 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-16 03:03:10,351 INFO L384 tUnfolder$Statistics]: this new event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,351 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-16 03:03:10,351 INFO L387 tUnfolder$Statistics]: existing Event has 51 ancestors and is cut-off event [2021-12-16 03:03:10,351 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,438 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-16 03:03:10,439 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,439 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,439 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,439 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,459 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-16 03:03:10,460 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,460 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,460 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,460 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,460 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,471 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-16 03:03:10,471 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,471 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,471 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,471 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,485 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-16 03:03:10,485 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,486 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,486 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:10,486 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:10,527 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-16 03:03:10,527 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:10,527 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:10,527 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:10,527 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:10,543 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-16 03:03:10,543 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,543 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,543 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,543 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,561 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-16 03:03:10,562 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,562 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,562 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,562 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,562 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-16 03:03:10,562 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,562 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,562 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,562 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,568 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-16 03:03:10,568 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,568 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,568 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,568 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,605 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-16 03:03:10,605 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,605 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,605 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,605 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,606 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-16 03:03:10,607 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,607 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,607 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,607 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,607 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,608 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-16 03:03:10,608 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,608 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,608 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:10,608 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,608 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:10,609 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-16 03:03:10,609 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:10,609 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:10,610 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:10,610 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:10,616 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-16 03:03:10,616 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,616 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,616 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:10,616 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:10,829 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-16 03:03:10,829 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-16 03:03:10,829 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:10,829 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:10,830 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:03:10,830 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-16 03:03:10,830 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:10,830 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:10,830 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:10,830 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:03:11,001 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-16 03:03:11,002 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-16 03:03:11,002 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:11,002 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-16 03:03:11,002 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:11,179 INFO L129 PetriNetUnfolder]: 2788/8522 cut-off events. [2021-12-16 03:03:11,180 INFO L130 PetriNetUnfolder]: For 33561/37219 co-relation queries the response was YES. [2021-12-16 03:03:11,231 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-16 03:03:11,271 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 71 selfloop transitions, 31 changer transitions 8/274 dead transitions. [2021-12-16 03:03:11,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 274 transitions, 2444 flow [2021-12-16 03:03:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 03:03:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-16 03:03:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1537 transitions. [2021-12-16 03:03:11,275 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7980269989615784 [2021-12-16 03:03:11,275 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1537 transitions. [2021-12-16 03:03:11,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1537 transitions. [2021-12-16 03:03:11,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:11,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1537 transitions. [2021-12-16 03:03:11,279 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-16 03:03:11,282 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-16 03:03:11,283 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-16 03:03:11,283 INFO L186 Difference]: Start difference. First operand has 169 places, 226 transitions, 1992 flow. Second operand 18 states and 1537 transitions. [2021-12-16 03:03:11,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 274 transitions, 2444 flow [2021-12-16 03:03:11,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 274 transitions, 2356 flow, removed 31 selfloop flow, removed 10 redundant places. [2021-12-16 03:03:11,336 INFO L242 Difference]: Finished difference. Result has 178 places, 244 transitions, 2120 flow [2021-12-16 03:03:11,337 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-16 03:03:11,337 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 82 predicate places. [2021-12-16 03:03:11,337 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 244 transitions, 2120 flow [2021-12-16 03:03:11,338 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-16 03:03:11,338 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:11,338 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-16 03:03:11,364 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-16 03:03:11,551 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-16 03:03:11,552 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-16 03:03:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash -10980542, now seen corresponding path program 4 times [2021-12-16 03:03:11,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44637914] [2021-12-16 03:03:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:11,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:11,737 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-16 03:03:11,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:11,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44637914] [2021-12-16 03:03:11,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44637914] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:11,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083786902] [2021-12-16 03:03:11,739 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 03:03:11,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:11,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:11,740 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-16 03:03:11,742 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-16 03:03:11,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 03:03:11,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:03:11,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 03:03:11,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:12,349 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-16 03:03:12,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:12,665 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-16 03:03:12,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083786902] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:12,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:12,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-16 03:03:12,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192986606] [2021-12-16 03:03:12,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:12,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 03:03:12,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 03:03:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:03:12,668 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-16 03:03:12,670 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-16 03:03:12,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:12,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-16 03:03:12,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:13,194 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-16 03:03:13,194 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:13,194 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:13,194 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:13,194 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:13,251 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-16 03:03:13,252 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,252 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,252 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:13,252 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,308 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-16 03:03:13,308 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-16 03:03:13,308 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:13,308 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:13,308 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:13,358 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-16 03:03:13,358 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,358 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:13,358 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:13,358 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,361 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-16 03:03:13,361 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,361 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:13,362 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:13,362 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,362 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,405 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-16 03:03:13,406 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,406 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,406 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,406 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,415 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-16 03:03:13,415 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,415 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,415 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,415 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,464 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-16 03:03:13,464 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,465 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,465 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,465 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,469 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-16 03:03:13,469 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,469 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,469 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,469 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,469 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,496 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-16 03:03:13,496 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,496 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,496 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,496 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,496 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,496 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,553 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-16 03:03:13,554 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-12-16 03:03:13,554 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,554 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,554 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:13,559 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-16 03:03:13,559 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-16 03:03:13,559 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:13,559 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:13,559 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:03:13,559 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-16 03:03:13,560 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,560 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,560 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:13,560 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:03:13,569 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-16 03:03:13,569 INFO L384 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2021-12-16 03:03:13,569 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-16 03:03:13,569 INFO L387 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2021-12-16 03:03:13,569 INFO L387 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2021-12-16 03:03:13,637 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-16 03:03:13,637 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2021-12-16 03:03:13,637 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,637 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,637 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,637 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:13,637 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,637 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,729 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-16 03:03:13,729 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-16 03:03:13,729 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,729 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,729 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,742 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-16 03:03:13,742 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-16 03:03:13,742 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,742 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-16 03:03:13,742 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,754 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-16 03:03:13,754 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-12-16 03:03:13,754 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2021-12-16 03:03:13,755 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,755 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,755 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:13,897 INFO L129 PetriNetUnfolder]: 2999/9440 cut-off events. [2021-12-16 03:03:13,897 INFO L130 PetriNetUnfolder]: For 38593/42738 co-relation queries the response was YES. [2021-12-16 03:03:13,968 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-16 03:03:14,008 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 90 selfloop transitions, 30 changer transitions 8/292 dead transitions. [2021-12-16 03:03:14,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 292 transitions, 2653 flow [2021-12-16 03:03:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 03:03:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 03:03:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1378 transitions. [2021-12-16 03:03:14,011 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8049065420560748 [2021-12-16 03:03:14,011 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1378 transitions. [2021-12-16 03:03:14,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1378 transitions. [2021-12-16 03:03:14,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:14,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1378 transitions. [2021-12-16 03:03:14,014 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-16 03:03:14,017 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-16 03:03:14,018 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-16 03:03:14,018 INFO L186 Difference]: Start difference. First operand has 178 places, 244 transitions, 2120 flow. Second operand 16 states and 1378 transitions. [2021-12-16 03:03:14,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 292 transitions, 2653 flow [2021-12-16 03:03:14,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 292 transitions, 2537 flow, removed 46 selfloop flow, removed 10 redundant places. [2021-12-16 03:03:14,080 INFO L242 Difference]: Finished difference. Result has 185 places, 259 transitions, 2234 flow [2021-12-16 03:03:14,081 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-16 03:03:14,081 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 89 predicate places. [2021-12-16 03:03:14,081 INFO L470 AbstractCegarLoop]: Abstraction has has 185 places, 259 transitions, 2234 flow [2021-12-16 03:03:14,082 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-16 03:03:14,082 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:14,082 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-16 03:03:14,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-16 03:03:14,295 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-16 03:03:14,296 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-16 03:03:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:14,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1064763944, now seen corresponding path program 5 times [2021-12-16 03:03:14,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:14,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862804004] [2021-12-16 03:03:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:14,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:14,463 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-16 03:03:14,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:14,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862804004] [2021-12-16 03:03:14,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862804004] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:14,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812181990] [2021-12-16 03:03:14,464 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 03:03:14,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:14,465 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-16 03:03:14,467 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-16 03:03:14,572 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-12-16 03:03:14,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:03:14,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 03:03:14,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:14,997 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-16 03:03:14,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:15,248 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-16 03:03:15,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812181990] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:15,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:15,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-16 03:03:15,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905302639] [2021-12-16 03:03:15,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:15,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 03:03:15,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 03:03:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:03:15,252 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-16 03:03:15,265 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-16 03:03:15,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:15,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-16 03:03:15,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:15,772 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-16 03:03:15,773 INFO L384 tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event [2021-12-16 03:03:15,773 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:15,773 INFO L387 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2021-12-16 03:03:15,773 INFO L387 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2021-12-16 03:03:15,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[][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-16 03:03:15,829 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:15,829 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-12-16 03:03:15,829 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:15,829 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:15,882 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-16 03:03:15,882 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2021-12-16 03:03:15,882 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:15,882 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-12-16 03:03:15,882 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2021-12-16 03:03:15,930 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-16 03:03:15,930 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:15,930 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:15,930 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:15,930 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:15,931 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-16 03:03:15,931 INFO L384 tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event [2021-12-16 03:03:15,932 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:15,932 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:15,932 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:15,932 INFO L387 tUnfolder$Statistics]: existing Event has 59 ancestors and is cut-off event [2021-12-16 03:03:16,032 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-16 03:03:16,032 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:16,032 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:16,032 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:16,032 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:16,032 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-16 03:03:16,032 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-16 03:03:16,032 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:16,032 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:16,032 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:16,083 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-16 03:03:16,083 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-16 03:03:16,083 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:16,083 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2021-12-16 03:03:16,083 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:16,083 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:16,097 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-16 03:03:16,097 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-16 03:03:16,097 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-16 03:03:16,097 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-16 03:03:16,098 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-16 03:03:16,100 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-16 03:03:16,101 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-16 03:03:16,101 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:03:16,101 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:16,101 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:16,101 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:03:16,101 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-16 03:03:16,101 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:16,101 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:16,101 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:16,101 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:03:16,492 INFO L129 PetriNetUnfolder]: 3430/10662 cut-off events. [2021-12-16 03:03:16,492 INFO L130 PetriNetUnfolder]: For 46541/50053 co-relation queries the response was YES. [2021-12-16 03:03:16,573 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-16 03:03:16,618 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 104 selfloop transitions, 31 changer transitions 8/307 dead transitions. [2021-12-16 03:03:16,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 307 transitions, 2852 flow [2021-12-16 03:03:16,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 03:03:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-16 03:03:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1375 transitions. [2021-12-16 03:03:16,620 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8031542056074766 [2021-12-16 03:03:16,620 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1375 transitions. [2021-12-16 03:03:16,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1375 transitions. [2021-12-16 03:03:16,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:16,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1375 transitions. [2021-12-16 03:03:16,623 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-16 03:03:16,625 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-16 03:03:16,625 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-16 03:03:16,625 INFO L186 Difference]: Start difference. First operand has 185 places, 259 transitions, 2234 flow. Second operand 16 states and 1375 transitions. [2021-12-16 03:03:16,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 307 transitions, 2852 flow [2021-12-16 03:03:16,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 307 transitions, 2703 flow, removed 61 selfloop flow, removed 9 redundant places. [2021-12-16 03:03:16,696 INFO L242 Difference]: Finished difference. Result has 194 places, 277 transitions, 2371 flow [2021-12-16 03:03:16,696 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-16 03:03:16,697 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 98 predicate places. [2021-12-16 03:03:16,697 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 277 transitions, 2371 flow [2021-12-16 03:03:16,697 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-16 03:03:16,698 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:16,698 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-16 03:03:16,714 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-16 03:03:16,899 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-16 03:03:16,900 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-16 03:03:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash 421987156, now seen corresponding path program 6 times [2021-12-16 03:03:16,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:16,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320920899] [2021-12-16 03:03:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:16,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:17,050 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-16 03:03:17,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:17,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320920899] [2021-12-16 03:03:17,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320920899] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:17,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885971725] [2021-12-16 03:03:17,051 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 03:03:17,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:17,056 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-16 03:03:17,058 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-16 03:03:17,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-12-16 03:03:17,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:03:17,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 03:03:17,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:17,641 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-16 03:03:17,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:17,905 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-16 03:03:17,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885971725] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:17,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:17,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2021-12-16 03:03:17,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777070287] [2021-12-16 03:03:17,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:17,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 03:03:17,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 03:03:17,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-16 03:03:17,907 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2021-12-16 03:03:17,908 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-16 03:03:17,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:17,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2021-12-16 03:03:17,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:18,624 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-16 03:03:18,624 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-12-16 03:03:18,624 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:18,624 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:18,624 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-12-16 03:03:18,838 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-16 03:03:18,838 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,838 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,838 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,838 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,860 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-16 03:03:18,860 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,860 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,860 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,860 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,860 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,877 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-16 03:03:18,877 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-12-16 03:03:18,877 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-16 03:03:18,877 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-12-16 03:03:18,877 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-12-16 03:03:18,880 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-16 03:03:18,880 INFO L384 tUnfolder$Statistics]: this new event has 66 ancestors and is not cut-off event [2021-12-16 03:03:18,880 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:03:18,881 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:18,881 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2021-12-16 03:03:18,881 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is not cut-off event [2021-12-16 03:03:18,881 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-16 03:03:18,881 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2021-12-16 03:03:18,881 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:18,881 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2021-12-16 03:03:18,881 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2021-12-16 03:03:18,919 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-16 03:03:18,919 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,919 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,919 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,919 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,919 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:18,919 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2021-12-16 03:03:19,314 INFO L129 PetriNetUnfolder]: 3688/11480 cut-off events. [2021-12-16 03:03:19,314 INFO L130 PetriNetUnfolder]: For 52984/56882 co-relation queries the response was YES. [2021-12-16 03:03:19,401 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-16 03:03:19,454 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 117 selfloop transitions, 32 changer transitions 8/321 dead transitions. [2021-12-16 03:03:19,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 321 transitions, 3023 flow [2021-12-16 03:03:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 03:03:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-16 03:03:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1455 transitions. [2021-12-16 03:03:19,456 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.799890049477735 [2021-12-16 03:03:19,456 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1455 transitions. [2021-12-16 03:03:19,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1455 transitions. [2021-12-16 03:03:19,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:19,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1455 transitions. [2021-12-16 03:03:19,458 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-16 03:03:19,460 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-16 03:03:19,460 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-16 03:03:19,461 INFO L186 Difference]: Start difference. First operand has 194 places, 277 transitions, 2371 flow. Second operand 17 states and 1455 transitions. [2021-12-16 03:03:19,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 321 transitions, 3023 flow [2021-12-16 03:03:19,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 321 transitions, 2852 flow, removed 77 selfloop flow, removed 7 redundant places. [2021-12-16 03:03:19,534 INFO L242 Difference]: Finished difference. Result has 206 places, 292 transitions, 2483 flow [2021-12-16 03:03:19,535 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-16 03:03:19,535 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 110 predicate places. [2021-12-16 03:03:19,536 INFO L470 AbstractCegarLoop]: Abstraction has has 206 places, 292 transitions, 2483 flow [2021-12-16 03:03:19,536 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-16 03:03:19,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:19,537 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-16 03:03:19,560 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-16 03:03:19,755 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-16 03:03:19,756 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-16 03:03:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1308129123, now seen corresponding path program 7 times [2021-12-16 03:03:19,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:19,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295180375] [2021-12-16 03:03:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:19,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:19,867 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-16 03:03:19,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:19,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295180375] [2021-12-16 03:03:19,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295180375] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:19,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163182308] [2021-12-16 03:03:19,868 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 03:03:19,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:19,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:19,869 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-16 03:03:19,871 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-16 03:03:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:19,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 03:03:19,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:20,186 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-16 03:03:20,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:20,413 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-16 03:03:20,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163182308] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:20,414 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:20,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-16 03:03:20,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309856847] [2021-12-16 03:03:20,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:20,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 03:03:20,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 03:03:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-16 03:03:20,416 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2021-12-16 03:03:20,417 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-16 03:03:20,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:20,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2021-12-16 03:03:20,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 03:03:39,033 INFO L129 PetriNetUnfolder]: 54460/99703 cut-off events. [2021-12-16 03:03:39,034 INFO L130 PetriNetUnfolder]: For 490090/495599 co-relation queries the response was YES. [2021-12-16 03:03:40,288 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-16 03:03:40,862 INFO L132 encePairwiseOnDemand]: 91/107 looper letters, 1052 selfloop transitions, 985 changer transitions 0/2207 dead transitions. [2021-12-16 03:03:40,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 2207 transitions, 23485 flow [2021-12-16 03:03:40,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2021-12-16 03:03:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2021-12-16 03:03:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 16676 transitions. [2021-12-16 03:03:40,878 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.775375459152834 [2021-12-16 03:03:40,878 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 16676 transitions. [2021-12-16 03:03:40,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 16676 transitions. [2021-12-16 03:03:40,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 03:03:40,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 16676 transitions. [2021-12-16 03:03:40,905 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-16 03:03:40,934 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-16 03:03:40,943 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-16 03:03:40,944 INFO L186 Difference]: Start difference. First operand has 206 places, 292 transitions, 2483 flow. Second operand 201 states and 16676 transitions. [2021-12-16 03:03:40,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 2207 transitions, 23485 flow [2021-12-16 03:03:42,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2207 transitions, 23334 flow, removed 66 selfloop flow, removed 9 redundant places. [2021-12-16 03:03:42,099 INFO L242 Difference]: Finished difference. Result has 546 places, 1329 transitions, 16364 flow [2021-12-16 03:03:42,100 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-16 03:03:42,101 INFO L334 CegarLoopForPetriNet]: 96 programPoint places, 450 predicate places. [2021-12-16 03:03:42,101 INFO L470 AbstractCegarLoop]: Abstraction has has 546 places, 1329 transitions, 16364 flow [2021-12-16 03:03:42,101 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-16 03:03:42,102 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 03:03:42,102 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-16 03:03:42,124 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-16 03:03:42,315 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-16 03:03:42,315 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-16 03:03:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 03:03:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash -596875945, now seen corresponding path program 8 times [2021-12-16 03:03:42,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 03:03:42,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765802838] [2021-12-16 03:03:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 03:03:42,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 03:03:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 03:03:42,519 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-16 03:03:42,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 03:03:42,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765802838] [2021-12-16 03:03:42,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765802838] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 03:03:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200889442] [2021-12-16 03:03:42,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 03:03:42,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 03:03:42,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 03:03:42,524 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-16 03:03:42,525 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-16 03:03:42,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 03:03:42,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 03:03:42,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 03:03:42,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 03:03:42,854 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-16 03:03:42,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 03:03:43,086 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-16 03:03:43,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200889442] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 03:03:43,086 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 03:03:43,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2021-12-16 03:03:43,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173740682] [2021-12-16 03:03:43,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 03:03:43,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-16 03:03:43,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 03:03:43,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-16 03:03:43,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-12-16 03:03:43,089 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2021-12-16 03:03:43,090 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-16 03:03:43,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 03:03:43,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2021-12-16 03:03:43,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand