./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.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 c7095f70ba7104a12a93da2a0b557c5b5c6880d23caa33c7c2fd19334f4cb537 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 12:58:08,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 12:58:08,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 12:58:08,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 12:58:08,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 12:58:08,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 12:58:08,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 12:58:08,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 12:58:08,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 12:58:08,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 12:58:08,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 12:58:08,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 12:58:08,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 12:58:08,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 12:58:08,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 12:58:08,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 12:58:08,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 12:58:08,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 12:58:08,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 12:58:08,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 12:58:08,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 12:58:08,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 12:58:08,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 12:58:08,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 12:58:08,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 12:58:08,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 12:58:08,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 12:58:08,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 12:58:08,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 12:58:08,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 12:58:08,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 12:58:08,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 12:58:08,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 12:58:08,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 12:58:08,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 12:58:08,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 12:58:08,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 12:58:08,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 12:58:08,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 12:58:08,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 12:58:08,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 12:58:08,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 12:58:08,202 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 12:58:08,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 12:58:08,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 12:58:08,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 12:58:08,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 12:58:08,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 12:58:08,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 12:58:08,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 12:58:08,204 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 12:58:08,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 12:58:08,204 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 12:58:08,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 12:58:08,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 12:58:08,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 12:58:08,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 12:58:08,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 12:58:08,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 12:58:08,205 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 12:58:08,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 12:58:08,206 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 12:58:08,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 12:58:08,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 12:58:08,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 12:58:08,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 12:58:08,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 12:58:08,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 12:58:08,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 12:58:08,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 12:58:08,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 12:58:08,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 12:58:08,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 12:58:08,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 12:58:08,207 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 12:58:08,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 12:58:08,208 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 12:58:08,208 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c7095f70ba7104a12a93da2a0b557c5b5c6880d23caa33c7c2fd19334f4cb537 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 12:58:08,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 12:58:08,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 12:58:08,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 12:58:08,449 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 12:58:08,450 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 12:58:08,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-09-01 12:58:09,334 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 12:58:09,528 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 12:58:09,528 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-09-01 12:58:09,532 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacbad73e/ec8d0722367748199aaafb9fdf29c960/FLAG5664aec25 [2023-09-01 12:58:09,541 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dacbad73e/ec8d0722367748199aaafb9fdf29c960 [2023-09-01 12:58:09,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 12:58:09,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 12:58:09,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 12:58:09,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 12:58:09,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 12:58:09,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8620faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09, skipping insertion in model container [2023-09-01 12:58:09,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 12:58:09,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 12:58:09,727 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-09-01 12:58:09,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 12:58:09,743 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 12:58:09,776 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-09-01 12:58:09,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 12:58:09,793 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 12:58:09,793 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 12:58:09,801 INFO L208 MainTranslator]: Completed translation [2023-09-01 12:58:09,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09 WrapperNode [2023-09-01 12:58:09,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 12:58:09,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 12:58:09,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 12:58:09,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 12:58:09,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,848 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 288 [2023-09-01 12:58:09,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 12:58:09,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 12:58:09,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 12:58:09,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 12:58:09,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,884 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 12:58:09,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 12:58:09,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 12:58:09,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 12:58:09,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (1/1) ... [2023-09-01 12:58:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 12:58:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 12:58:09,913 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) [2023-09-01 12:58:09,936 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 [2023-09-01 12:58:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 12:58:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 12:58:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 12:58:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 12:58:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 12:58:09,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 12:58:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 12:58:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 12:58:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 12:58:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 12:58:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 12:58:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 12:58:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 12:58:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-09-01 12:58:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-09-01 12:58:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-09-01 12:58:09,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-09-01 12:58:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 12:58:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 12:58:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 12:58:09,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 12:58:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 12:58:09,954 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 12:58:10,080 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 12:58:10,081 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 12:58:10,367 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 12:58:10,419 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 12:58:10,420 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 12:58:10,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:58:10 BoogieIcfgContainer [2023-09-01 12:58:10,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 12:58:10,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 12:58:10,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 12:58:10,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 12:58:10,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 12:58:09" (1/3) ... [2023-09-01 12:58:10,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5466ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:58:10, skipping insertion in model container [2023-09-01 12:58:10,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 12:58:09" (2/3) ... [2023-09-01 12:58:10,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5466ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 12:58:10, skipping insertion in model container [2023-09-01 12:58:10,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 12:58:10" (3/3) ... [2023-09-01 12:58:10,426 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-09-01 12:58:10,431 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 12:58:10,439 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 12:58:10,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 12:58:10,439 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 12:58:10,499 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-09-01 12:58:10,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 191 transitions, 430 flow [2023-09-01 12:58:10,626 INFO L130 PetriNetUnfolder]: 2/185 cut-off events. [2023-09-01 12:58:10,626 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 12:58:10,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 185 events. 2/185 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-09-01 12:58:10,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 191 transitions, 430 flow [2023-09-01 12:58:10,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 169 transitions, 374 flow [2023-09-01 12:58:10,638 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 12:58:10,646 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 169 transitions, 374 flow [2023-09-01 12:58:10,651 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 169 transitions, 374 flow [2023-09-01 12:58:10,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 169 transitions, 374 flow [2023-09-01 12:58:10,695 INFO L130 PetriNetUnfolder]: 2/169 cut-off events. [2023-09-01 12:58:10,695 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 12:58:10,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 169 events. 2/169 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-09-01 12:58:10,698 INFO L119 LiptonReduction]: Number of co-enabled transitions 3042 [2023-09-01 12:58:15,926 INFO L134 LiptonReduction]: Checked pairs total: 15662 [2023-09-01 12:58:15,926 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-09-01 12:58:15,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 12:58:15,939 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a99443c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 12:58:15,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 12:58:15,947 INFO L130 PetriNetUnfolder]: 0/49 cut-off events. [2023-09-01 12:58:15,947 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-09-01 12:58:15,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:58:15,948 INFO L208 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] [2023-09-01 12:58:15,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 12:58:15,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:58:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 477829290, now seen corresponding path program 1 times [2023-09-01 12:58:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:58:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677464870] [2023-09-01 12:58:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:58:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:58:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:58:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:58:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:58:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677464870] [2023-09-01 12:58:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677464870] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:58:17,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:58:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 12:58:17,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990688036] [2023-09-01 12:58:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:58:17,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:58:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:58:17,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:58:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:58:17,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 317 [2023-09-01 12:58:17,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:58:17,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:58:17,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 317 [2023-09-01 12:58:17,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:58:39,986 INFO L130 PetriNetUnfolder]: 421515/526270 cut-off events. [2023-09-01 12:58:39,987 INFO L131 PetriNetUnfolder]: For 30975/30975 co-relation queries the response was YES. [2023-09-01 12:58:41,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079754 conditions, 526270 events. 421515/526270 cut-off events. For 30975/30975 co-relation queries the response was YES. Maximal size of possible extension queue 9895. Compared 3008673 event pairs, 87704 based on Foata normal form. 2/526272 useless extension candidates. Maximal degree in co-relation 953919. Up to 234423 conditions per place. [2023-09-01 12:58:42,064 INFO L137 encePairwiseOnDemand]: 308/317 looper letters, 143 selfloop transitions, 18 changer transitions 58/219 dead transitions. [2023-09-01 12:58:42,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 219 transitions, 1014 flow [2023-09-01 12:58:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:58:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:58:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1250 transitions. [2023-09-01 12:58:42,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633168093735917 [2023-09-01 12:58:42,079 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1250 transitions. [2023-09-01 12:58:42,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1250 transitions. [2023-09-01 12:58:42,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:58:42,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1250 transitions. [2023-09-01 12:58:42,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.57142857142858) internal successors, (1250), 7 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:58:42,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:58:42,101 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:58:42,102 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 136 flow. Second operand 7 states and 1250 transitions. [2023-09-01 12:58:42,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 219 transitions, 1014 flow [2023-09-01 12:58:54,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 219 transitions, 922 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-09-01 12:58:54,562 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 236 flow [2023-09-01 12:58:54,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-09-01 12:58:54,565 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2023-09-01 12:58:54,565 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 236 flow [2023-09-01 12:58:54,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:58:54,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:58:54,566 INFO L208 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] [2023-09-01 12:58:54,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 12:58:54,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 12:58:54,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:58:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1298141890, now seen corresponding path program 2 times [2023-09-01 12:58:54,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:58:54,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497383904] [2023-09-01 12:58:54,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:58:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:58:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:58:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:58:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:58:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497383904] [2023-09-01 12:58:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497383904] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:58:54,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:58:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 12:58:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749836219] [2023-09-01 12:58:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:58:54,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 12:58:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:58:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 12:58:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 12:58:54,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 317 [2023-09-01 12:58:54,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:58:54,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:58:54,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 317 [2023-09-01 12:58:54,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:59:01,278 INFO L130 PetriNetUnfolder]: 110776/147831 cut-off events. [2023-09-01 12:59:01,278 INFO L131 PetriNetUnfolder]: For 4523/5029 co-relation queries the response was YES. [2023-09-01 12:59:01,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303404 conditions, 147831 events. 110776/147831 cut-off events. For 4523/5029 co-relation queries the response was YES. Maximal size of possible extension queue 5871. Compared 982459 event pairs, 16644 based on Foata normal form. 1180/139833 useless extension candidates. Maximal degree in co-relation 303393. Up to 115357 conditions per place. [2023-09-01 12:59:02,067 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 126 selfloop transitions, 30 changer transitions 0/184 dead transitions. [2023-09-01 12:59:02,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 184 transitions, 794 flow [2023-09-01 12:59:02,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 12:59:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 12:59:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1215 transitions. [2023-09-01 12:59:02,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5475439387111312 [2023-09-01 12:59:02,070 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1215 transitions. [2023-09-01 12:59:02,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1215 transitions. [2023-09-01 12:59:02,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:59:02,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1215 transitions. [2023-09-01 12:59:02,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.57142857142858) internal successors, (1215), 7 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:02,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:02,077 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 317.0) internal successors, (2536), 8 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:02,077 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 236 flow. Second operand 7 states and 1215 transitions. [2023-09-01 12:59:02,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 184 transitions, 794 flow [2023-09-01 12:59:02,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 184 transitions, 784 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 12:59:02,117 INFO L231 Difference]: Finished difference. Result has 74 places, 100 transitions, 403 flow [2023-09-01 12:59:02,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=74, PETRI_TRANSITIONS=100} [2023-09-01 12:59:02,118 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2023-09-01 12:59:02,118 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 403 flow [2023-09-01 12:59:02,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:02,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:59:02,119 INFO L208 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] [2023-09-01 12:59:02,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 12:59:02,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 12:59:02,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:59:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1863345826, now seen corresponding path program 3 times [2023-09-01 12:59:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:59:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301856229] [2023-09-01 12:59:02,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:59:02,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:59:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:59:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:59:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:59:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301856229] [2023-09-01 12:59:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301856229] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:59:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:59:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 12:59:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837319802] [2023-09-01 12:59:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:59:02,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 12:59:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:59:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 12:59:02,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-09-01 12:59:02,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 317 [2023-09-01 12:59:02,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 403 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:02,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:59:02,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 317 [2023-09-01 12:59:02,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:59:15,071 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 50#L45true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:15,071 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-09-01 12:59:15,071 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 12:59:15,071 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 12:59:15,071 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 12:59:16,786 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [60#L181-4true, 72#L150true, 44#L49true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:16,786 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-09-01 12:59:16,786 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 12:59:16,786 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 12:59:16,787 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 12:59:16,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 50#L45true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:16,845 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-09-01 12:59:16,845 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 12:59:16,845 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 12:59:16,845 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 12:59:17,852 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][313], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:17,853 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 12:59:17,853 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:17,853 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:17,853 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,021 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][312], [60#L181-4true, 72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, 129#L93true, 245#(<= (+ ~s~0 4) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:18,021 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,021 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,022 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,022 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,031 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][273], [72#L150true, 44#L49true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 147#L74true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 216#(and (= ~b~0 0) (not (= ~x~0 1))), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:18,031 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,031 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,031 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,031 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 12:59:18,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][313], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:18,942 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 12:59:18,942 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 12:59:18,943 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 12:59:18,943 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 12:59:19,067 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][312], [72#L150true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 49#thread5EXITtrue, 13#L52true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:19,067 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 12:59:19,067 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 12:59:19,067 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 12:59:19,067 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 12:59:20,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][199], [60#L181-4true, 243#(<= (+ 2 ~s~0) ~t~0), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 7#thread6EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:20,586 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 12:59:20,586 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 12:59:20,586 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 12:59:20,586 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 12:59:20,868 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][263], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, 243#(<= (+ 2 ~s~0) ~t~0), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 211#true, 195#L105true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:20,868 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 12:59:20,868 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:20,868 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:20,869 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:20,912 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([557] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][199], [243#(<= (+ 2 ~s~0) ~t~0), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 7#thread6EXITtrue, 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:20,912 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 12:59:20,912 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:20,913 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:20,913 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:21,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][263], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, 243#(<= (+ 2 ~s~0) ~t~0), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 211#true, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:21,091 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,091 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,091 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,091 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [72#L150true, 37#thread2EXITtrue, 110#L128true, 157#L183-1true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:21,115 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,116 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,116 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,116 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,117 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][202], [72#L150true, 37#thread2EXITtrue, 157#L183-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 211#true, 49#thread5EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 129#L93true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:21,117 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,117 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,117 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,117 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:21,483 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [113#L183-2true, 72#L150true, 110#L128true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:21,483 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 12:59:21,483 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 12:59:21,483 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 12:59:21,483 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 12:59:21,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([668] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_7| 0) (= (+ v_~s~0_135 1) v_~s~0_134) (= |v_thread3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_135} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_7|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_7|, thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_7|, ~s~0=v_~s~0_134} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base, thread3Thread1of1ForFork2_#t~post6#1, ~s~0][177], [72#L150true, 110#L128true, 80#thread3EXITtrue, 79#L184-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:21,560 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-09-01 12:59:21,560 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 12:59:21,560 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 12:59:21,560 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 12:59:21,681 INFO L130 PetriNetUnfolder]: 248438/349622 cut-off events. [2023-09-01 12:59:21,681 INFO L131 PetriNetUnfolder]: For 185337/185821 co-relation queries the response was YES. [2023-09-01 12:59:22,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913048 conditions, 349622 events. 248438/349622 cut-off events. For 185337/185821 co-relation queries the response was YES. Maximal size of possible extension queue 15070. Compared 2920985 event pairs, 49714 based on Foata normal form. 1114/325906 useless extension candidates. Maximal degree in co-relation 488008. Up to 92985 conditions per place. [2023-09-01 12:59:24,193 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 213 selfloop transitions, 153 changer transitions 0/394 dead transitions. [2023-09-01 12:59:24,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 394 transitions, 2129 flow [2023-09-01 12:59:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 12:59:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 12:59:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2254 transitions. [2023-09-01 12:59:24,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5469546226644019 [2023-09-01 12:59:24,198 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2254 transitions. [2023-09-01 12:59:24,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2254 transitions. [2023-09-01 12:59:24,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:59:24,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2254 transitions. [2023-09-01 12:59:24,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 173.3846153846154) internal successors, (2254), 13 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:24,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:24,208 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:24,208 INFO L175 Difference]: Start difference. First operand has 74 places, 100 transitions, 403 flow. Second operand 13 states and 2254 transitions. [2023-09-01 12:59:24,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 394 transitions, 2129 flow [2023-09-01 12:59:24,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 394 transitions, 2129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 12:59:24,824 INFO L231 Difference]: Finished difference. Result has 91 places, 240 transitions, 1596 flow [2023-09-01 12:59:24,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1596, PETRI_PLACES=91, PETRI_TRANSITIONS=240} [2023-09-01 12:59:24,825 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 22 predicate places. [2023-09-01 12:59:24,825 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 240 transitions, 1596 flow [2023-09-01 12:59:24,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:24,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 12:59:24,826 INFO L208 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] [2023-09-01 12:59:24,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 12:59:24,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 12:59:24,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 12:59:24,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1998415786, now seen corresponding path program 4 times [2023-09-01 12:59:24,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 12:59:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731512745] [2023-09-01 12:59:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 12:59:24,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 12:59:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 12:59:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 12:59:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 12:59:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731512745] [2023-09-01 12:59:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731512745] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 12:59:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 12:59:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 12:59:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895013353] [2023-09-01 12:59:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 12:59:25,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 12:59:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 12:59:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 12:59:25,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 12:59:25,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 317 [2023-09-01 12:59:25,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 240 transitions, 1596 flow. Second operand has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:25,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 12:59:25,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 317 [2023-09-01 12:59:25,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 12:59:47,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][340], [60#L181-4true, 72#L150true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 49#thread5EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 238#true, 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:47,237 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 12:59:47,237 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 12:59:47,237 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 12:59:47,238 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 12:59:47,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 194#thread1EXITtrue, 49#thread5EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 7#thread6EXITtrue, 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:47,557 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 12:59:47,557 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:47,557 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:47,557 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:47,596 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][340], [72#L150true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 263#true, 150#L112true, 211#true, 147#L74true, 194#thread1EXITtrue, 49#thread5EXITtrue, 238#true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:47,596 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 12:59:47,596 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:47,597 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:47,597 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 12:59:48,077 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 87#L182-1true, 263#true, 150#L112true, 211#true, 194#thread1EXITtrue, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:48,078 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 12:59:48,078 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:48,078 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:48,078 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 12:59:48,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 15#L182-2true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:48,240 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 12:59:48,240 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 12:59:48,240 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 12:59:48,240 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 12:59:48,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), 37#thread2EXITtrue, Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 157#L183-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, 150#L112true, 211#true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:48,346 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-09-01 12:59:48,346 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 12:59:48,346 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 12:59:48,346 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 12:59:48,403 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [113#L183-2true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:48,404 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-09-01 12:59:48,404 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-09-01 12:59:48,404 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-09-01 12:59:48,404 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-09-01 12:59:48,437 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][302], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 79#L184-1true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 263#true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 211#true, 49#thread5EXITtrue, 7#thread6EXITtrue, 242#(<= (+ ~s~0 1) ~t~0), 129#L93true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0)]) [2023-09-01 12:59:48,437 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-09-01 12:59:48,437 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-09-01 12:59:48,437 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-09-01 12:59:48,437 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-09-01 12:59:48,493 INFO L130 PetriNetUnfolder]: 253697/352376 cut-off events. [2023-09-01 12:59:48,493 INFO L131 PetriNetUnfolder]: For 666138/692667 co-relation queries the response was YES. [2023-09-01 12:59:49,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220336 conditions, 352376 events. 253697/352376 cut-off events. For 666138/692667 co-relation queries the response was YES. Maximal size of possible extension queue 14524. Compared 2836338 event pairs, 60519 based on Foata normal form. 5096/335420 useless extension candidates. Maximal degree in co-relation 656199. Up to 267679 conditions per place. [2023-09-01 12:59:51,795 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 222 selfloop transitions, 132 changer transitions 0/382 dead transitions. [2023-09-01 12:59:51,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 382 transitions, 3004 flow [2023-09-01 12:59:51,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 12:59:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 12:59:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1541 transitions. [2023-09-01 12:59:51,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401331931300386 [2023-09-01 12:59:51,816 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1541 transitions. [2023-09-01 12:59:51,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1541 transitions. [2023-09-01 12:59:51,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 12:59:51,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1541 transitions. [2023-09-01 12:59:51,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 171.22222222222223) internal successors, (1541), 9 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:51,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:51,836 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 12:59:51,836 INFO L175 Difference]: Start difference. First operand has 91 places, 240 transitions, 1596 flow. Second operand 9 states and 1541 transitions. [2023-09-01 12:59:51,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 382 transitions, 3004 flow [2023-09-01 13:00:27,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 382 transitions, 2865 flow, removed 66 selfloop flow, removed 1 redundant places. [2023-09-01 13:00:27,093 INFO L231 Difference]: Finished difference. Result has 102 places, 277 transitions, 2180 flow [2023-09-01 13:00:27,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2180, PETRI_PLACES=102, PETRI_TRANSITIONS=277} [2023-09-01 13:00:27,093 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 33 predicate places. [2023-09-01 13:00:27,094 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 277 transitions, 2180 flow [2023-09-01 13:00:27,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:00:27,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:00:27,094 INFO L208 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] [2023-09-01 13:00:27,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 13:00:27,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 13:00:27,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:00:27,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1949326470, now seen corresponding path program 5 times [2023-09-01 13:00:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:00:27,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319351224] [2023-09-01 13:00:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:00:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:00:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:00:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:00:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:00:27,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319351224] [2023-09-01 13:00:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319351224] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:00:27,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:00:27,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 13:00:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183627373] [2023-09-01 13:00:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:00:27,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 13:00:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:00:27,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 13:00:27,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 13:00:27,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 317 [2023-09-01 13:00:27,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 277 transitions, 2180 flow. Second operand has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:00:27,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:00:27,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 317 [2023-09-01 13:00:27,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:00:45,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 50#L45true, 263#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-09-01 13:00:45,831 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-09-01 13:00:45,831 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:00:45,831 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:00:45,831 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:00:47,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 44#L49true, Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-09-01 13:00:47,612 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 13:00:47,613 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:00:47,613 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:00:47,613 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:00:47,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][409], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true]) [2023-09-01 13:00:47,613 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 13:00:47,613 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:00:47,613 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:00:47,613 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:00:47,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 50#L45true, 263#true, 87#L182-1true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-09-01 13:00:47,674 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 13:00:47,674 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:00:47,674 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:00:47,674 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:00:48,998 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][306], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), 44#L49true, Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 124#thread4EXITtrue, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 216#(and (= ~b~0 0) (not (= ~x~0 1)))]) [2023-09-01 13:00:48,998 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 13:00:48,998 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:00:48,998 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:00:48,998 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:00:48,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][409], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 211#true, 124#thread4EXITtrue, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true]) [2023-09-01 13:00:48,999 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 13:00:48,999 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:00:48,999 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:00:48,999 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:00:49,356 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][405], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true]) [2023-09-01 13:00:49,356 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 13:00:49,356 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:00:49,356 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:00:49,356 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:00:50,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][405], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true]) [2023-09-01 13:00:50,298 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:00:50,298 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:00:50,298 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:00:50,298 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:00:51,365 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-09-01 13:00:51,365 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:00:51,365 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:00:51,365 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:00:51,365 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:00:51,924 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 87#L182-1true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-09-01 13:00:51,924 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:00:51,924 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:00:51,924 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:00:51,924 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:00:52,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 263#true, 211#true, 147#L74true, 15#L182-2true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-09-01 13:00:52,109 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 13:00:52,109 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:00:52,109 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:00:52,109 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:00:52,224 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][305], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 254#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m6~0)), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 157#L183-1true, 263#true, 211#true, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 80#thread3EXITtrue, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true]) [2023-09-01 13:00:52,224 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-09-01 13:00:52,224 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 13:00:52,224 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 13:00:52,224 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 13:00:52,388 INFO L130 PetriNetUnfolder]: 254801/353096 cut-off events. [2023-09-01 13:00:52,388 INFO L131 PetriNetUnfolder]: For 747740/783734 co-relation queries the response was YES. [2023-09-01 13:00:54,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235717 conditions, 353096 events. 254801/353096 cut-off events. For 747740/783734 co-relation queries the response was YES. Maximal size of possible extension queue 14237. Compared 2825076 event pairs, 69445 based on Foata normal form. 4560/335269 useless extension candidates. Maximal degree in co-relation 677528. Up to 266928 conditions per place. [2023-09-01 13:00:55,710 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 238 selfloop transitions, 189 changer transitions 0/455 dead transitions. [2023-09-01 13:00:55,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 455 transitions, 4113 flow [2023-09-01 13:00:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 13:00:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 13:00:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1553 transitions. [2023-09-01 13:00:55,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443392919733614 [2023-09-01 13:00:55,713 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1553 transitions. [2023-09-01 13:00:55,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1553 transitions. [2023-09-01 13:00:55,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:00:55,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1553 transitions. [2023-09-01 13:00:55,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 172.55555555555554) internal successors, (1553), 9 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:00:55,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:00:55,719 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 317.0) internal successors, (3170), 10 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:00:55,719 INFO L175 Difference]: Start difference. First operand has 102 places, 277 transitions, 2180 flow. Second operand 9 states and 1553 transitions. [2023-09-01 13:00:55,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 455 transitions, 4113 flow [2023-09-01 13:01:25,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 455 transitions, 3908 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-09-01 13:01:25,611 INFO L231 Difference]: Finished difference. Result has 109 places, 335 transitions, 3122 flow [2023-09-01 13:01:25,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=2047, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3122, PETRI_PLACES=109, PETRI_TRANSITIONS=335} [2023-09-01 13:01:25,612 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 40 predicate places. [2023-09-01 13:01:25,612 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 335 transitions, 3122 flow [2023-09-01 13:01:25,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:01:25,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:01:25,613 INFO L208 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] [2023-09-01 13:01:25,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 13:01:25,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 13:01:25,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:01:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1715764558, now seen corresponding path program 6 times [2023-09-01 13:01:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:01:25,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292523257] [2023-09-01 13:01:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:01:25,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:01:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:01:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:01:25,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:01:25,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292523257] [2023-09-01 13:01:25,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292523257] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:01:25,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:01:25,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-09-01 13:01:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128273909] [2023-09-01 13:01:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:01:25,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 13:01:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:01:25,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 13:01:25,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-09-01 13:01:25,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 317 [2023-09-01 13:01:25,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 335 transitions, 3122 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:01:25,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:01:25,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 317 [2023-09-01 13:01:25,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:01:53,718 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([658] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][218], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 302#(<= (+ ~s~0 1) ~t~0), 157#L183-1true, 211#true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 242#(<= (+ ~s~0 1) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 281#true, 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 184#L90true]) [2023-09-01 13:01:53,718 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:01:53,718 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:01:53,719 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:01:53,719 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:01:54,771 INFO L130 PetriNetUnfolder]: 258285/361623 cut-off events. [2023-09-01 13:01:54,772 INFO L131 PetriNetUnfolder]: For 874721/918757 co-relation queries the response was YES. [2023-09-01 13:01:56,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287670 conditions, 361623 events. 258285/361623 cut-off events. For 874721/918757 co-relation queries the response was YES. Maximal size of possible extension queue 14907. Compared 2982131 event pairs, 52402 based on Foata normal form. 9276/346546 useless extension candidates. Maximal degree in co-relation 751837. Up to 78583 conditions per place. [2023-09-01 13:01:58,394 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 225 selfloop transitions, 318 changer transitions 0/571 dead transitions. [2023-09-01 13:01:58,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 571 transitions, 5619 flow [2023-09-01 13:01:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 13:01:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 13:01:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2258 transitions. [2023-09-01 13:01:58,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5479252608590148 [2023-09-01 13:01:58,398 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2258 transitions. [2023-09-01 13:01:58,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2258 transitions. [2023-09-01 13:01:58,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:01:58,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2258 transitions. [2023-09-01 13:01:58,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 173.69230769230768) internal successors, (2258), 13 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:01:58,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:01:58,407 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:01:58,407 INFO L175 Difference]: Start difference. First operand has 109 places, 335 transitions, 3122 flow. Second operand 13 states and 2258 transitions. [2023-09-01 13:01:58,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 571 transitions, 5619 flow [2023-09-01 13:02:10,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 571 transitions, 5361 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 13:02:10,344 INFO L231 Difference]: Finished difference. Result has 119 places, 405 transitions, 4439 flow [2023-09-01 13:02:10,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4439, PETRI_PLACES=119, PETRI_TRANSITIONS=405} [2023-09-01 13:02:10,344 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 50 predicate places. [2023-09-01 13:02:10,344 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 405 transitions, 4439 flow [2023-09-01 13:02:10,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:02:10,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:10,346 INFO L208 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] [2023-09-01 13:02:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 13:02:10,346 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 13:02:10,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -407801938, now seen corresponding path program 7 times [2023-09-01 13:02:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:10,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678727963] [2023-09-01 13:02:10,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:02:10,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:02:10,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678727963] [2023-09-01 13:02:10,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678727963] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:02:10,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:02:10,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 13:02:10,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372189519] [2023-09-01 13:02:10,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:02:10,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 13:02:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:02:10,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 13:02:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 13:02:10,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 317 [2023-09-01 13:02:10,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 405 transitions, 4439 flow. Second operand has 8 states, 8 states have (on average 156.375) internal successors, (1251), 8 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:02:10,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:02:10,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 317 [2023-09-01 13:02:10,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:02:33,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 195#L105true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:33,347 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 13:02:33,347 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:02:33,347 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:02:33,347 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:02:35,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:35,209 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 13:02:35,209 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:35,209 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:35,209 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:35,254 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 87#L182-1true, 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 320#true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 195#L105true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:35,254 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 13:02:35,254 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:35,254 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:35,254 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:36,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][563], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 305#(<= (+ ~s~0 4) ~t~0), 211#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(<= (+ ~s~0 4) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:36,109 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 13:02:36,109 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:36,109 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:36,109 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:02:36,562 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 304#(<= (+ 3 ~s~0) ~t~0), 87#L182-1true, 211#true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 37#thread2EXITtrue, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 52#L109true, Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:36,562 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 13:02:36,562 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:02:36,562 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:02:36,562 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:02:37,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][563], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 87#L182-1true, 305#(<= (+ ~s~0 4) ~t~0), 211#true, 147#L74true, 124#thread4EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 245#(<= (+ ~s~0 4) ~t~0), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 13#L52true, 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:37,272 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 13:02:37,273 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:02:37,273 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:02:37,273 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:02:38,291 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 298#true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 320#true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:38,292 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:02:38,292 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:02:38,292 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:02:38,292 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:02:38,721 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][561], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 87#L182-1true, 211#true, 147#L74true, 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, 298#true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), 320#true, Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 238#true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:38,721 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:02:38,721 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:02:38,721 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:02:38,721 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:02:39,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([678] L131-->thread5EXIT: Formula: (and (= (+ v_~s~0_147 1) v_~s~0_146) (= |v_thread5Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread5Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~s~0=v_~s~0_147} OutVars{thread5Thread1of1ForFork1_#res#1.offset=|v_thread5Thread1of1ForFork1_#res#1.offset_7|, thread5Thread1of1ForFork1_#res#1.base=|v_thread5Thread1of1ForFork1_#res#1.base_7|, thread5Thread1of1ForFork1_#t~post10#1=|v_thread5Thread1of1ForFork1_#t~post10#1_7|, ~s~0=v_~s~0_146} AuxVars[] AssignedVars[thread5Thread1of1ForFork1_#res#1.offset, thread5Thread1of1ForFork1_#res#1.base, thread5Thread1of1ForFork1_#t~post10#1, ~s~0][526], [Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 244#(<= (+ 3 ~s~0) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 243#(<= (+ 2 ~s~0) ~t~0), 157#L183-1true, 211#true, 147#L74true, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 7#thread6EXITtrue, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, 303#(<= (+ 2 ~s~0) ~t~0), 129#L93true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:02:39,422 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 13:02:39,422 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:02:39,422 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:02:39,423 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:02:39,724 INFO L130 PetriNetUnfolder]: 265274/368294 cut-off events. [2023-09-01 13:02:39,724 INFO L131 PetriNetUnfolder]: For 1334464/1410254 co-relation queries the response was YES. [2023-09-01 13:02:41,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477770 conditions, 368294 events. 265274/368294 cut-off events. For 1334464/1410254 co-relation queries the response was YES. Maximal size of possible extension queue 14631. Compared 2960872 event pairs, 73051 based on Foata normal form. 8074/353011 useless extension candidates. Maximal degree in co-relation 865035. Up to 272051 conditions per place. [2023-09-01 13:02:43,572 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 242 selfloop transitions, 337 changer transitions 0/607 dead transitions. [2023-09-01 13:02:43,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 607 transitions, 7119 flow [2023-09-01 13:02:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 13:02:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 13:02:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1894 transitions. [2023-09-01 13:02:43,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5431603097218239 [2023-09-01 13:02:43,575 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1894 transitions. [2023-09-01 13:02:43,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1894 transitions. [2023-09-01 13:02:43,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:02:43,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1894 transitions. [2023-09-01 13:02:43,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 172.1818181818182) internal successors, (1894), 11 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:02:43,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:02:43,582 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 317.0) internal successors, (3804), 12 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:02:43,582 INFO L175 Difference]: Start difference. First operand has 119 places, 405 transitions, 4439 flow. Second operand 11 states and 1894 transitions. [2023-09-01 13:02:43,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 607 transitions, 7119 flow [2023-09-01 13:03:10,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 607 transitions, 6601 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 13:03:10,601 INFO L231 Difference]: Finished difference. Result has 125 places, 484 transitions, 5903 flow [2023-09-01 13:03:10,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=4004, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5903, PETRI_PLACES=125, PETRI_TRANSITIONS=484} [2023-09-01 13:03:10,602 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 56 predicate places. [2023-09-01 13:03:10,602 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 484 transitions, 5903 flow [2023-09-01 13:03:10,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 156.375) internal successors, (1251), 8 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:03:10,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:03:10,603 INFO L208 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] [2023-09-01 13:03:10,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 13:03:10,603 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 13:03:10,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:03:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -314242782, now seen corresponding path program 8 times [2023-09-01 13:03:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:03:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62853480] [2023-09-01 13:03:10,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:03:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:03:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:03:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:03:10,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:03:10,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62853480] [2023-09-01 13:03:10,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62853480] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:03:10,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:03:10,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-09-01 13:03:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569529064] [2023-09-01 13:03:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:03:10,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 13:03:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:03:10,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 13:03:10,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-09-01 13:03:10,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 317 [2023-09-01 13:03:10,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 484 transitions, 5903 flow. Second operand has 11 states, 11 states have (on average 153.9090909090909) internal successors, (1693), 11 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:03:10,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:03:10,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 317 [2023-09-01 13:03:10,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:03:42,165 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][732], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:03:42,165 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 13:03:42,165 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:03:42,165 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:03:42,165 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:03:43,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][732], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 87#L182-1true, 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), 147#L74true, Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), 194#thread1EXITtrue, Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), 22#L131true, Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), 320#true, Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 314#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:03:43,146 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:03:43,146 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:03:43,147 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:03:43,147 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:03:45,138 INFO L130 PetriNetUnfolder]: 273024/381178 cut-off events. [2023-09-01 13:03:45,138 INFO L131 PetriNetUnfolder]: For 1439384/1552348 co-relation queries the response was YES. [2023-09-01 13:03:47,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489593 conditions, 381178 events. 273024/381178 cut-off events. For 1439384/1552348 co-relation queries the response was YES. Maximal size of possible extension queue 15223. Compared 3119760 event pairs, 52066 based on Foata normal form. 21430/377480 useless extension candidates. Maximal degree in co-relation 961895. Up to 79900 conditions per place. [2023-09-01 13:03:49,272 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 250 selfloop transitions, 626 changer transitions 0/904 dead transitions. [2023-09-01 13:03:49,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 904 transitions, 11255 flow [2023-09-01 13:03:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 13:03:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 13:03:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3078 transitions. [2023-09-01 13:03:49,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5394321766561514 [2023-09-01 13:03:49,277 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3078 transitions. [2023-09-01 13:03:49,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3078 transitions. [2023-09-01 13:03:49,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:03:49,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3078 transitions. [2023-09-01 13:03:49,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 171.0) internal successors, (3078), 18 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:03:49,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 317.0) internal successors, (6023), 19 states have internal predecessors, (6023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:03:49,296 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 317.0) internal successors, (6023), 19 states have internal predecessors, (6023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:03:49,296 INFO L175 Difference]: Start difference. First operand has 125 places, 484 transitions, 5903 flow. Second operand 18 states and 3078 transitions. [2023-09-01 13:03:49,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 904 transitions, 11255 flow [2023-09-01 13:04:13,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 904 transitions, 10698 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-09-01 13:04:13,666 INFO L231 Difference]: Finished difference. Result has 141 places, 712 transitions, 10158 flow [2023-09-01 13:04:13,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=5527, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10158, PETRI_PLACES=141, PETRI_TRANSITIONS=712} [2023-09-01 13:04:13,667 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 72 predicate places. [2023-09-01 13:04:13,667 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 712 transitions, 10158 flow [2023-09-01 13:04:13,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 153.9090909090909) internal successors, (1693), 11 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:04:13,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:04:13,668 INFO L208 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] [2023-09-01 13:04:13,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 13:04:13,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 13:04:13,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:04:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2028382412, now seen corresponding path program 9 times [2023-09-01 13:04:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:04:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290011369] [2023-09-01 13:04:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:04:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:04:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:04:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:04:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:04:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290011369] [2023-09-01 13:04:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290011369] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:04:13,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:04:13,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 13:04:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033827204] [2023-09-01 13:04:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:04:13,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 13:04:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:04:13,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 13:04:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 13:04:13,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 317 [2023-09-01 13:04:13,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 712 transitions, 10158 flow. Second operand has 8 states, 8 states have (on average 155.375) internal successors, (1243), 8 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:04:13,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:04:13,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 317 [2023-09-01 13:04:13,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:04:52,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][855], [60#L181-4true, Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 369#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 381#(<= (+ 2 ~s~0) ~t~0), Black: 345#(<= (+ ~s~0 1) ~t~0), Black: 357#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0)), Black: 363#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 13#L52true, Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:04:52,106 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-09-01 13:04:52,107 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:04:52,107 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:04:52,108 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:04:54,030 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([569] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][855], [Black: 243#(<= (+ 2 ~s~0) ~t~0), Black: 242#(<= (+ ~s~0 1) ~t~0), Black: 256#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 348#(<= (+ ~s~0 4) ~t~0), 87#L182-1true, 211#true, Black: 326#(and (<= 3 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 3 ~m5~0) (<= 3 ~t~0) (= ~s~0 0)), 147#L74true, Black: 325#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 333#(and (<= 3 ~m5~0) (= ~m1~0 0) (<= 3 ~t~0) (= ~s~0 0)), Black: 268#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 275#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 49#thread5EXITtrue, Black: 267#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 273#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 244#(<= (+ 3 ~s~0) ~t~0), Black: 214#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), 223#true, Black: 217#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 72#L150true, Black: 291#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 80#thread3EXITtrue, Black: 286#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 293#(and (<= 2 ~m3~0) (<= 2 ~t~0) (= ~s~0 0)), Black: 225#(and (= ~t~0 0) (= ~s~0 0)), Black: 227#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 230#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 232#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 150#L112true, Black: 369#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m6~0)), Black: 345#(<= (+ ~s~0 1) ~t~0), 381#(<= (+ 2 ~s~0) ~t~0), Black: 357#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0)), Black: 363#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ ~s~0 4) ~m6~0)), 13#L52true, Black: 316#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0))]) [2023-09-01 13:04:54,031 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 13:04:54,031 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:04:54,031 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:04:54,031 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:05:00,162 INFO L130 PetriNetUnfolder]: 313146/444227 cut-off events. [2023-09-01 13:05:00,162 INFO L131 PetriNetUnfolder]: For 2117870/2252665 co-relation queries the response was YES. [2023-09-01 13:05:03,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966608 conditions, 444227 events. 313146/444227 cut-off events. For 2117870/2252665 co-relation queries the response was YES. Maximal size of possible extension queue 17835. Compared 3806350 event pairs, 57804 based on Foata normal form. 26398/445220 useless extension candidates. Maximal degree in co-relation 1317477. Up to 121392 conditions per place. [2023-09-01 13:05:05,906 INFO L137 encePairwiseOnDemand]: 303/317 looper letters, 342 selfloop transitions, 748 changer transitions 3/1121 dead transitions. [2023-09-01 13:05:05,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1121 transitions, 16391 flow [2023-09-01 13:05:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 13:05:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 13:05:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2253 transitions. [2023-09-01 13:05:05,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5467119631157487 [2023-09-01 13:05:05,910 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2253 transitions. [2023-09-01 13:05:05,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2253 transitions. [2023-09-01 13:05:05,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:05:05,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2253 transitions. [2023-09-01 13:05:05,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 173.30769230769232) internal successors, (2253), 13 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:05:05,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:05:05,918 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 317.0) internal successors, (4438), 14 states have internal predecessors, (4438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:05:05,918 INFO L175 Difference]: Start difference. First operand has 141 places, 712 transitions, 10158 flow. Second operand 13 states and 2253 transitions. [2023-09-01 13:05:05,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 1121 transitions, 16391 flow [2023-09-01 13:07:26,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 1121 transitions, 16232 flow, removed 46 selfloop flow, removed 4 redundant places. [2023-09-01 13:07:26,252 INFO L231 Difference]: Finished difference. Result has 155 places, 924 transitions, 15790 flow [2023-09-01 13:07:26,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=317, PETRI_DIFFERENCE_MINUEND_FLOW=8820, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15790, PETRI_PLACES=155, PETRI_TRANSITIONS=924} [2023-09-01 13:07:26,252 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 86 predicate places. [2023-09-01 13:07:26,252 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 924 transitions, 15790 flow [2023-09-01 13:07:26,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 155.375) internal successors, (1243), 8 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:07:26,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:07:26,253 INFO L208 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] [2023-09-01 13:07:26,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 13:07:26,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 13:07:26,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:07:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash -787308670, now seen corresponding path program 10 times [2023-09-01 13:07:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:07:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943438949] [2023-09-01 13:07:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:07:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:07:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:07:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:07:26,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:07:26,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943438949] [2023-09-01 13:07:26,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943438949] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:07:26,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:07:26,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 13:07:26,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975208835] [2023-09-01 13:07:26,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:07:26,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 13:07:26,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:07:26,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 13:07:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 13:07:26,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 317 [2023-09-01 13:07:26,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 924 transitions, 15790 flow. Second operand has 7 states, 7 states have (on average 156.14285714285714) internal successors, (1093), 7 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:07:26,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:07:26,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 317 [2023-09-01 13:07:26,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand