./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/pthread-wmm/mix007.oepc.i -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 87b62b2cd45c104fec3a3f6f97bb4a2e98408c552f26c7f9920866b9b8c9b373 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:41:42,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:41:42,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:41:42,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:41:42,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:41:42,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:41:42,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:41:42,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:41:42,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:41:42,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:41:42,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:41:42,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:41:42,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:41:42,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:41:42,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:41:42,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:41:42,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:41:42,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:41:42,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:41:42,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:41:42,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:41:42,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:41:42,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:41:42,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:41:42,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:41:42,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:41:42,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:41:42,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:41:42,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:41:42,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:41:42,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:41:42,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:41:42,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:41:42,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:41:42,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:41:42,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:41:42,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:41:42,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:41:42,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:41:42,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:41:42,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:41:42,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:41:42,915 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:41:42,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:41:42,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:41:42,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:41:42,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:41:42,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:41:42,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:41:42,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:41:42,923 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:41:42,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:41:42,924 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:41:42,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:41:42,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:41:42,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:41:42,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:41:42,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:41:42,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:41:42,925 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:41:42,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:41:42,926 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:41:42,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:41:42,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:41:42,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:41:42,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:41:42,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:41:42,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:41:42,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:41:42,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:41:42,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:41:42,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:41:42,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:41:42,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:41:42,929 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:41:42,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:41:42,929 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:41:42,929 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 -> 87b62b2cd45c104fec3a3f6f97bb4a2e98408c552f26c7f9920866b9b8c9b373 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 -> AFTER [2023-08-30 16:41:43,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:41:43,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:41:43,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:41:43,300 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:41:43,300 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:41:43,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-30 16:41:44,494 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:41:44,772 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:41:44,773 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i [2023-08-30 16:41:44,786 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5d432b6/2df7337454e34313bd1f28bb00a390ff/FLAGb925205db [2023-08-30 16:41:44,801 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5d432b6/2df7337454e34313bd1f28bb00a390ff [2023-08-30 16:41:44,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:41:44,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:41:44,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:41:44,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:41:44,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:41:44,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:41:44" (1/1) ... [2023-08-30 16:41:44,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbd0919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:44, skipping insertion in model container [2023-08-30 16:41:44,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:41:44" (1/1) ... [2023-08-30 16:41:44,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:41:44,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:41:44,998 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i[945,958] [2023-08-30 16:41:45,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:41:45,150 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:41:45,172 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007.oepc.i[945,958] [2023-08-30 16:41:45,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:41:45,292 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:41:45,292 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:41:45,298 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:41:45,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45 WrapperNode [2023-08-30 16:41:45,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:41:45,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:41:45,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:41:45,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:41:45,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,377 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 16:41:45,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:41:45,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:41:45,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:41:45,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:41:45,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,415 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:41:45,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:41:45,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:41:45,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:41:45,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (1/1) ... [2023-08-30 16:41:45,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:41:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:41:45,469 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-08-30 16:41:45,488 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-08-30 16:41:45,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:41:45,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:41:45,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:41:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:41:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:41:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:41:45,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:41:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:41:45,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:41:45,516 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:41:45,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:41:45,516 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:41:45,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:41:45,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:41:45,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:41:45,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:41:45,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:41:45,518 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:41:45,677 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:41:45,679 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:41:45,984 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:41:46,115 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:41:46,121 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:41:46,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:41:46 BoogieIcfgContainer [2023-08-30 16:41:46,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:41:46,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:41:46,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:41:46,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:41:46,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:41:44" (1/3) ... [2023-08-30 16:41:46,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6a5a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:41:46, skipping insertion in model container [2023-08-30 16:41:46,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:41:45" (2/3) ... [2023-08-30 16:41:46,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6a5a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:41:46, skipping insertion in model container [2023-08-30 16:41:46,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:41:46" (3/3) ... [2023-08-30 16:41:46,133 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.oepc.i [2023-08-30 16:41:46,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:41:46,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:41:46,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:41:46,151 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:41:46,225 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:41:46,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 16:41:46,338 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 16:41:46,338 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:41:46,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 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/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:41:46,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 16:41:46,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-30 16:41:46,358 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:41:46,379 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 16:41:46,385 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 16:41:46,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-30 16:41:46,440 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 16:41:46,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:41:46,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 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/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:41:46,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 3286 [2023-08-30 16:41:50,623 INFO L134 LiptonReduction]: Checked pairs total: 9535 [2023-08-30 16:41:50,623 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-30 16:41:50,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:41:50,641 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;@5dcac21b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:41:50,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:41:50,645 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:41:50,646 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:41:50,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:50,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:41:50,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:41:50,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash 554491, now seen corresponding path program 1 times [2023-08-30 16:41:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309844785] [2023-08-30 16:41:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:41:51,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309844785] [2023-08-30 16:41:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309844785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:51,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:51,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:41:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300774490] [2023-08-30 16:41:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:51,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:41:51,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:41:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:41:51,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-30 16:41:51,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:41:51,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:51,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-30 16:41:51,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:52,080 INFO L130 PetriNetUnfolder]: 4903/6751 cut-off events. [2023-08-30 16:41:52,081 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 16:41:52,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13599 conditions, 6751 events. 4903/6751 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33758 event pairs, 2535 based on Foata normal form. 0/6404 useless extension candidates. Maximal degree in co-relation 13587. Up to 5335 conditions per place. [2023-08-30 16:41:52,128 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-30 16:41:52,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-08-30 16:41:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:41:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:41:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-30 16:41:52,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5495867768595041 [2023-08-30 16:41:52,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-30 16:41:52,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-30 16:41:52,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:52,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-30 16:41:52,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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-08-30 16:41:52,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-08-30 16:41:52,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-08-30 16:41:52,158 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 399 transitions. [2023-08-30 16:41:52,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-08-30 16:41:52,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:41:52,163 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-08-30 16:41:52,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-30 16:41:52,168 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-30 16:41:52,169 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-08-30 16:41:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:41:52,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:52,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:41:52,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:41:52,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1210786638, now seen corresponding path program 1 times [2023-08-30 16:41:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930081434] [2023-08-30 16:41:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:41:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:52,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930081434] [2023-08-30 16:41:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930081434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:52,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:52,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:41:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986039361] [2023-08-30 16:41:52,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:52,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:41:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:41:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:41:52,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-30 16:41:52,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-08-30 16:41:52,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:52,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-30 16:41:52,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:54,975 INFO L130 PetriNetUnfolder]: 17545/23784 cut-off events. [2023-08-30 16:41:54,976 INFO L131 PetriNetUnfolder]: For 1219/1219 co-relation queries the response was YES. [2023-08-30 16:41:55,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49340 conditions, 23784 events. 17545/23784 cut-off events. For 1219/1219 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 124470 event pairs, 6299 based on Foata normal form. 548/24332 useless extension candidates. Maximal degree in co-relation 49330. Up to 16775 conditions per place. [2023-08-30 16:41:55,153 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-08-30 16:41:55,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 240 flow [2023-08-30 16:41:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:41:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:41:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-30 16:41:55,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-08-30 16:41:55,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-30 16:41:55,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-30 16:41:55,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:55,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-30 16:41:55,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-08-30 16:41:55,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-08-30 16:41:55,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-08-30 16:41:55,161 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 374 transitions. [2023-08-30 16:41:55,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 240 flow [2023-08-30 16:41:55,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:41:55,164 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 128 flow [2023-08-30 16:41:55,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-30 16:41:55,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-08-30 16:41:55,165 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 128 flow [2023-08-30 16:41:55,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-08-30 16:41:55,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:55,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:55,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:41:55,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:41:55,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1120321375, now seen corresponding path program 1 times [2023-08-30 16:41:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022597086] [2023-08-30 16:41:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:41:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:55,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022597086] [2023-08-30 16:41:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022597086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:41:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872453321] [2023-08-30 16:41:55,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:55,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:41:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:55,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:41:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:41:55,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-30 16:41:55,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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-08-30 16:41:55,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:55,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-30 16:41:55,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:57,466 INFO L130 PetriNetUnfolder]: 16209/22000 cut-off events. [2023-08-30 16:41:57,466 INFO L131 PetriNetUnfolder]: For 8433/8433 co-relation queries the response was YES. [2023-08-30 16:41:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54442 conditions, 22000 events. 16209/22000 cut-off events. For 8433/8433 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 111186 event pairs, 4613 based on Foata normal form. 280/22280 useless extension candidates. Maximal degree in co-relation 54430. Up to 11031 conditions per place. [2023-08-30 16:41:57,602 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-30 16:41:57,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 348 flow [2023-08-30 16:41:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:41:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:41:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-08-30 16:41:57,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010330578512396 [2023-08-30 16:41:57,605 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-08-30 16:41:57,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-08-30 16:41:57,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:57,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-08-30 16:41:57,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 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-08-30 16:41:57,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-08-30 16:41:57,609 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-08-30 16:41:57,609 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 128 flow. Second operand 4 states and 485 transitions. [2023-08-30 16:41:57,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 348 flow [2023-08-30 16:41:57,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:41:57,679 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 180 flow [2023-08-30 16:41:57,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-30 16:41:57,681 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-30 16:41:57,683 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 180 flow [2023-08-30 16:41:57,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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-08-30 16:41:57,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:57,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:57,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:41:57,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:41:57,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -409342910, now seen corresponding path program 1 times [2023-08-30 16:41:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:57,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999434695] [2023-08-30 16:41:57,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:57,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:41:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999434695] [2023-08-30 16:41:57,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999434695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:41:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641752569] [2023-08-30 16:41:57,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:57,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:41:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:57,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:41:57,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:41:57,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242 [2023-08-30 16:41:57,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-08-30 16:41:57,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:57,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242 [2023-08-30 16:41:57,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:41:59,444 INFO L130 PetriNetUnfolder]: 10829/15667 cut-off events. [2023-08-30 16:41:59,444 INFO L131 PetriNetUnfolder]: For 8096/8481 co-relation queries the response was YES. [2023-08-30 16:41:59,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38126 conditions, 15667 events. 10829/15667 cut-off events. For 8096/8481 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 93793 event pairs, 3489 based on Foata normal form. 289/15434 useless extension candidates. Maximal degree in co-relation 38111. Up to 9752 conditions per place. [2023-08-30 16:41:59,545 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 41 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-30 16:41:59,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 310 flow [2023-08-30 16:41:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:41:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:41:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 16:41:59,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2023-08-30 16:41:59,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 16:41:59,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 16:41:59,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:41:59,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 16:41:59,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-08-30 16:41:59,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-08-30 16:41:59,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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-08-30 16:41:59,556 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 180 flow. Second operand 3 states and 388 transitions. [2023-08-30 16:41:59,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 310 flow [2023-08-30 16:41:59,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:41:59,571 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 191 flow [2023-08-30 16:41:59,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-30 16:41:59,572 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-08-30 16:41:59,573 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 191 flow [2023-08-30 16:41:59,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-08-30 16:41:59,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:41:59,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:41:59,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:41:59,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:41:59,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:41:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 185686995, now seen corresponding path program 1 times [2023-08-30 16:41:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:41:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422571296] [2023-08-30 16:41:59,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:41:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:41:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:41:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:41:59,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:41:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422571296] [2023-08-30 16:41:59,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422571296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:41:59,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:41:59,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:41:59,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544623384] [2023-08-30 16:41:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:41:59,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:41:59,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:41:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:41:59,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:41:59,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:41:59,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 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-08-30 16:41:59,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:41:59,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:41:59,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:01,072 INFO L130 PetriNetUnfolder]: 9003/13453 cut-off events. [2023-08-30 16:42:01,072 INFO L131 PetriNetUnfolder]: For 5448/6018 co-relation queries the response was YES. [2023-08-30 16:42:01,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31924 conditions, 13453 events. 9003/13453 cut-off events. For 5448/6018 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 86705 event pairs, 1809 based on Foata normal form. 1112/14040 useless extension candidates. Maximal degree in co-relation 31907. Up to 5487 conditions per place. [2023-08-30 16:42:01,148 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 60 selfloop transitions, 6 changer transitions 0/80 dead transitions. [2023-08-30 16:42:01,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 447 flow [2023-08-30 16:42:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:42:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:42:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-08-30 16:42:01,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196280991735537 [2023-08-30 16:42:01,151 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-08-30 16:42:01,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-08-30 16:42:01,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:01,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-08-30 16:42:01,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 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-08-30 16:42:01,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-08-30 16:42:01,155 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-08-30 16:42:01,155 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 191 flow. Second operand 4 states and 503 transitions. [2023-08-30 16:42:01,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 447 flow [2023-08-30 16:42:01,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:42:01,162 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 229 flow [2023-08-30 16:42:01,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-30 16:42:01,165 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-08-30 16:42:01,165 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 229 flow [2023-08-30 16:42:01,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 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-08-30 16:42:01,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:01,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:42:01,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:42:01,167 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:01,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1970146418, now seen corresponding path program 1 times [2023-08-30 16:42:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:01,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939375961] [2023-08-30 16:42:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:01,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939375961] [2023-08-30 16:42:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939375961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:01,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:42:01,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325487053] [2023-08-30 16:42:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:01,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:42:01,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:01,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:42:01,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:42:01,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:42:01,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 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-08-30 16:42:01,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:01,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:42:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:02,657 INFO L130 PetriNetUnfolder]: 7306/11313 cut-off events. [2023-08-30 16:42:02,658 INFO L131 PetriNetUnfolder]: For 7755/8155 co-relation queries the response was YES. [2023-08-30 16:42:02,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32837 conditions, 11313 events. 7306/11313 cut-off events. For 7755/8155 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 74554 event pairs, 1677 based on Foata normal form. 712/11689 useless extension candidates. Maximal degree in co-relation 32818. Up to 4272 conditions per place. [2023-08-30 16:42:02,732 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 77 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2023-08-30 16:42:02,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 602 flow [2023-08-30 16:42:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:42:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:42:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-08-30 16:42:02,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5223140495867769 [2023-08-30 16:42:02,735 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-08-30 16:42:02,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-08-30 16:42:02,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:02,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-08-30 16:42:02,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 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-08-30 16:42:02,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:42:02,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:42:02,741 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 229 flow. Second operand 5 states and 632 transitions. [2023-08-30 16:42:02,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 602 flow [2023-08-30 16:42:02,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:42:02,750 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 294 flow [2023-08-30 16:42:02,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-30 16:42:02,751 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-08-30 16:42:02,752 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 294 flow [2023-08-30 16:42:02,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 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-08-30 16:42:02,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:02,753 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] [2023-08-30 16:42:02,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:42:02,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:02,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:02,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1989898883, now seen corresponding path program 1 times [2023-08-30 16:42:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:02,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220846137] [2023-08-30 16:42:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:02,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220846137] [2023-08-30 16:42:02,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220846137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:02,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:02,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:42:02,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476432723] [2023-08-30 16:42:02,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:02,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:42:02,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:02,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:42:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:42:02,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:42:02,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 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-08-30 16:42:02,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:02,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:42:02,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:04,320 INFO L130 PetriNetUnfolder]: 12012/18621 cut-off events. [2023-08-30 16:42:04,321 INFO L131 PetriNetUnfolder]: For 31494/31935 co-relation queries the response was YES. [2023-08-30 16:42:04,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63002 conditions, 18621 events. 12012/18621 cut-off events. For 31494/31935 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 128888 event pairs, 4124 based on Foata normal form. 152/18301 useless extension candidates. Maximal degree in co-relation 62980. Up to 9317 conditions per place. [2023-08-30 16:42:04,441 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 73 selfloop transitions, 3 changer transitions 22/109 dead transitions. [2023-08-30 16:42:04,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 811 flow [2023-08-30 16:42:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:42:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:42:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-30 16:42:04,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2023-08-30 16:42:04,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-30 16:42:04,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-30 16:42:04,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:04,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-30 16:42:04,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:42:04,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-08-30 16:42:04,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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-08-30 16:42:04,450 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 294 flow. Second operand 4 states and 517 transitions. [2023-08-30 16:42:04,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 811 flow [2023-08-30 16:42:04,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 109 transitions, 773 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-30 16:42:04,489 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 300 flow [2023-08-30 16:42:04,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-30 16:42:04,490 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-08-30 16:42:04,490 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 300 flow [2023-08-30 16:42:04,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 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-08-30 16:42:04,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:04,490 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] [2023-08-30 16:42:04,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:42:04,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:04,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash -942809175, now seen corresponding path program 2 times [2023-08-30 16:42:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795877309] [2023-08-30 16:42:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795877309] [2023-08-30 16:42:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795877309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:04,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:42:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941178021] [2023-08-30 16:42:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:42:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:42:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:42:04,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:42:04,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 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-08-30 16:42:04,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:04,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:42:04,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:06,234 INFO L130 PetriNetUnfolder]: 10128/15782 cut-off events. [2023-08-30 16:42:06,234 INFO L131 PetriNetUnfolder]: For 20205/20591 co-relation queries the response was YES. [2023-08-30 16:42:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50901 conditions, 15782 events. 10128/15782 cut-off events. For 20205/20591 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 112061 event pairs, 2276 based on Foata normal form. 438/15722 useless extension candidates. Maximal degree in co-relation 50878. Up to 6337 conditions per place. [2023-08-30 16:42:06,336 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 90 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2023-08-30 16:42:06,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 119 transitions, 774 flow [2023-08-30 16:42:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:42:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:42:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2023-08-30 16:42:06,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-08-30 16:42:06,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2023-08-30 16:42:06,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2023-08-30 16:42:06,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:06,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2023-08-30 16:42:06,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 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-08-30 16:42:06,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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-08-30 16:42:06,345 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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-08-30 16:42:06,345 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 300 flow. Second operand 6 states and 759 transitions. [2023-08-30 16:42:06,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 119 transitions, 774 flow [2023-08-30 16:42:06,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 119 transitions, 769 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:42:06,370 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 384 flow [2023-08-30 16:42:06,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2023-08-30 16:42:06,371 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-08-30 16:42:06,371 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 384 flow [2023-08-30 16:42:06,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 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-08-30 16:42:06,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:06,372 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] [2023-08-30 16:42:06,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:42:06,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:06,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1577835879, now seen corresponding path program 1 times [2023-08-30 16:42:06,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:06,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461099268] [2023-08-30 16:42:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:06,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:07,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461099268] [2023-08-30 16:42:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461099268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:07,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:42:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006875370] [2023-08-30 16:42:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:07,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:42:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:07,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:42:07,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:42:07,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242 [2023-08-30 16:42:07,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 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-08-30 16:42:07,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:07,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242 [2023-08-30 16:42:07,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:09,361 INFO L130 PetriNetUnfolder]: 19934/29275 cut-off events. [2023-08-30 16:42:09,361 INFO L131 PetriNetUnfolder]: For 84193/84193 co-relation queries the response was YES. [2023-08-30 16:42:09,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113519 conditions, 29275 events. 19934/29275 cut-off events. For 84193/84193 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 191387 event pairs, 2982 based on Foata normal form. 11/29286 useless extension candidates. Maximal degree in co-relation 113493. Up to 8740 conditions per place. [2023-08-30 16:42:09,536 INFO L137 encePairwiseOnDemand]: 229/242 looper letters, 148 selfloop transitions, 48 changer transitions 47/243 dead transitions. [2023-08-30 16:42:09,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 243 transitions, 2103 flow [2023-08-30 16:42:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:42:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:42:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 953 transitions. [2023-08-30 16:42:09,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922520661157025 [2023-08-30 16:42:09,542 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 953 transitions. [2023-08-30 16:42:09,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 953 transitions. [2023-08-30 16:42:09,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:09,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 953 transitions. [2023-08-30 16:42:09,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 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-08-30 16:42:09,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 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-08-30 16:42:09,548 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 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-08-30 16:42:09,549 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 384 flow. Second operand 8 states and 953 transitions. [2023-08-30 16:42:09,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 243 transitions, 2103 flow [2023-08-30 16:42:10,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 243 transitions, 1941 flow, removed 44 selfloop flow, removed 3 redundant places. [2023-08-30 16:42:10,485 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 760 flow [2023-08-30 16:42:10,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=760, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2023-08-30 16:42:10,486 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2023-08-30 16:42:10,486 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 760 flow [2023-08-30 16:42:10,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 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-08-30 16:42:10,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:10,487 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] [2023-08-30 16:42:10,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:42:10,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:10,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash 843163569, now seen corresponding path program 2 times [2023-08-30 16:42:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544951570] [2023-08-30 16:42:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:10,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:10,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544951570] [2023-08-30 16:42:10,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544951570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:42:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453724931] [2023-08-30 16:42:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:10,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:42:10,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:42:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:42:10,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 242 [2023-08-30 16:42:10,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 760 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 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-08-30 16:42:10,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:10,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 242 [2023-08-30 16:42:10,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:13,526 INFO L130 PetriNetUnfolder]: 14685/22443 cut-off events. [2023-08-30 16:42:13,526 INFO L131 PetriNetUnfolder]: For 73760/73760 co-relation queries the response was YES. [2023-08-30 16:42:13,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101260 conditions, 22443 events. 14685/22443 cut-off events. For 73760/73760 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 149093 event pairs, 3251 based on Foata normal form. 16/22459 useless extension candidates. Maximal degree in co-relation 101229. Up to 7488 conditions per place. [2023-08-30 16:42:13,675 INFO L137 encePairwiseOnDemand]: 231/242 looper letters, 213 selfloop transitions, 83 changer transitions 69/365 dead transitions. [2023-08-30 16:42:13,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 365 transitions, 3616 flow [2023-08-30 16:42:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:42:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:42:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1190 transitions. [2023-08-30 16:42:13,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49173553719008267 [2023-08-30 16:42:13,678 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1190 transitions. [2023-08-30 16:42:13,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1190 transitions. [2023-08-30 16:42:13,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:13,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1190 transitions. [2023-08-30 16:42:13,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 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-08-30 16:42:13,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 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-08-30 16:42:13,687 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 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-08-30 16:42:13,687 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 760 flow. Second operand 10 states and 1190 transitions. [2023-08-30 16:42:13,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 365 transitions, 3616 flow [2023-08-30 16:42:15,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 365 transitions, 3350 flow, removed 42 selfloop flow, removed 6 redundant places. [2023-08-30 16:42:15,311 INFO L231 Difference]: Finished difference. Result has 85 places, 145 transitions, 1576 flow [2023-08-30 16:42:15,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1576, PETRI_PLACES=85, PETRI_TRANSITIONS=145} [2023-08-30 16:42:15,312 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-08-30 16:42:15,312 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 145 transitions, 1576 flow [2023-08-30 16:42:15,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 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-08-30 16:42:15,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:15,313 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] [2023-08-30 16:42:15,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:42:15,314 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:15,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1550794115, now seen corresponding path program 3 times [2023-08-30 16:42:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830845895] [2023-08-30 16:42:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:15,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:15,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830845895] [2023-08-30 16:42:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830845895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:15,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:42:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347258150] [2023-08-30 16:42:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:15,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:42:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:42:15,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:42:15,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2023-08-30 16:42:15,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 145 transitions, 1576 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-08-30 16:42:15,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:15,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2023-08-30 16:42:15,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:18,803 INFO L130 PetriNetUnfolder]: 17940/27873 cut-off events. [2023-08-30 16:42:18,804 INFO L131 PetriNetUnfolder]: For 105330/105330 co-relation queries the response was YES. [2023-08-30 16:42:18,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125610 conditions, 27873 events. 17940/27873 cut-off events. For 105330/105330 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 196309 event pairs, 3774 based on Foata normal form. 28/27901 useless extension candidates. Maximal degree in co-relation 125573. Up to 10468 conditions per place. [2023-08-30 16:42:19,228 INFO L137 encePairwiseOnDemand]: 232/242 looper letters, 123 selfloop transitions, 78 changer transitions 95/296 dead transitions. [2023-08-30 16:42:19,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 296 transitions, 3408 flow [2023-08-30 16:42:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:42:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:42:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2023-08-30 16:42:19,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 16:42:19,242 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 726 transitions. [2023-08-30 16:42:19,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 726 transitions. [2023-08-30 16:42:19,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:19,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 726 transitions. [2023-08-30 16:42:19,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 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-08-30 16:42:19,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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-08-30 16:42:19,246 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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-08-30 16:42:19,247 INFO L175 Difference]: Start difference. First operand has 85 places, 145 transitions, 1576 flow. Second operand 6 states and 726 transitions. [2023-08-30 16:42:19,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 296 transitions, 3408 flow [2023-08-30 16:42:20,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 296 transitions, 3400 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-30 16:42:20,113 INFO L231 Difference]: Finished difference. Result has 92 places, 135 transitions, 1670 flow [2023-08-30 16:42:20,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1670, PETRI_PLACES=92, PETRI_TRANSITIONS=135} [2023-08-30 16:42:20,113 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-08-30 16:42:20,114 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 135 transitions, 1670 flow [2023-08-30 16:42:20,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 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-08-30 16:42:20,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:20,114 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] [2023-08-30 16:42:20,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:42:20,116 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:20,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1320065777, now seen corresponding path program 4 times [2023-08-30 16:42:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:20,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110980656] [2023-08-30 16:42:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:20,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:20,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110980656] [2023-08-30 16:42:20,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110980656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:42:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567809309] [2023-08-30 16:42:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:20,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:42:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:42:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:42:20,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2023-08-30 16:42:20,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 135 transitions, 1670 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 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-08-30 16:42:20,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:20,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2023-08-30 16:42:20,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:21,908 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][115], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 209#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 81#L878-3true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 101#L808true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 264#(= ~z~0 1), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), 286#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 116#L775true, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-08-30 16:42:21,908 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:42:21,908 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:42:21,908 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:42:21,908 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:42:22,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][84], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 209#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 81#L878-3true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 23#L831true, Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 286#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 40#L818true, 116#L775true, 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-08-30 16:42:22,110 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,110 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,110 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,110 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,111 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][115], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, 109#L811true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 209#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 81#L878-3true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 286#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 116#L775true, 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-08-30 16:42:22,112 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,112 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,112 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,112 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,167 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][192], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 288#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 2) (<= 0 ~main$tmp_guard0~0)), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 81#L878-3true, P0Thread1of1ForFork1InUse, 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, Black: 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 106#P0EXITtrue, 101#L808true, 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 264#(= ~z~0 1), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 187#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1)), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-08-30 16:42:22,167 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,167 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,167 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,167 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:42:22,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][149], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 288#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 2) (<= 0 ~main$tmp_guard0~0)), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 81#L878-3true, P0Thread1of1ForFork1InUse, 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 106#P0EXITtrue, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 23#L831true, Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 40#L818true, 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 187#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1)), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-08-30 16:42:22,322 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,322 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,322 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,323 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][192], [Black: 241#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0)), Black: 250#(and (= ~z~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff1~0 0)), Black: 242#(and (= ~z~0 1) (= ~a$w_buff1~0 0)), Black: 244#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 288#(and (<= ~main$tmp_guard0~0 (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256))) (<= ~__unbuffered_cnt~0 2) (<= 0 ~main$tmp_guard0~0)), Black: 246#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(= ~x~0 1), 157#true, 109#L811true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 81#L878-3true, P0Thread1of1ForFork1InUse, 211#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 106#P0EXITtrue, 271#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 264#(= ~z~0 1), 58#L847true, Black: 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 196#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 160#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 167#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 231#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 252#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (= ~a$w_buff1~0 0)), Black: 229#(and (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff0_used~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 223#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 217#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 112#P1EXITtrue, Black: 248#(and (= ~z~0 1) (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 187#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1)), Black: 240#(and (<= 0 ~a$w_buff0~0) (<= ~a$w_buff0~0 0))]) [2023-08-30 16:42:22,325 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,325 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,325 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,325 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:42:22,936 INFO L130 PetriNetUnfolder]: 11109/18228 cut-off events. [2023-08-30 16:42:22,937 INFO L131 PetriNetUnfolder]: For 64753/66022 co-relation queries the response was YES. [2023-08-30 16:42:23,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76175 conditions, 18228 events. 11109/18228 cut-off events. For 64753/66022 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 141482 event pairs, 1485 based on Foata normal form. 628/18404 useless extension candidates. Maximal degree in co-relation 76134. Up to 6857 conditions per place. [2023-08-30 16:42:23,094 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 94 selfloop transitions, 18 changer transitions 114/253 dead transitions. [2023-08-30 16:42:23,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 253 transitions, 3216 flow [2023-08-30 16:42:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:42:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:42:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-30 16:42:23,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047225501770957 [2023-08-30 16:42:23,097 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-30 16:42:23,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-30 16:42:23,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:23,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-30 16:42:23,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 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-08-30 16:42:23,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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-08-30 16:42:23,103 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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-08-30 16:42:23,103 INFO L175 Difference]: Start difference. First operand has 92 places, 135 transitions, 1670 flow. Second operand 7 states and 855 transitions. [2023-08-30 16:42:23,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 253 transitions, 3216 flow [2023-08-30 16:42:24,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 253 transitions, 2984 flow, removed 41 selfloop flow, removed 6 redundant places. [2023-08-30 16:42:24,424 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 825 flow [2023-08-30 16:42:24,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=825, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2023-08-30 16:42:24,425 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-08-30 16:42:24,425 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 825 flow [2023-08-30 16:42:24,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 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-08-30 16:42:24,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:24,426 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] [2023-08-30 16:42:24,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:42:24,426 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:24,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1454072826, now seen corresponding path program 1 times [2023-08-30 16:42:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:24,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652493568] [2023-08-30 16:42:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:42:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:42:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:42:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652493568] [2023-08-30 16:42:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652493568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:42:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:42:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:42:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926384319] [2023-08-30 16:42:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:42:25,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:42:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:42:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:42:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:42:25,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-08-30 16:42:25,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 825 flow. Second operand has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 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-08-30 16:42:25,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:42:25,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-08-30 16:42:25,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:42:26,440 INFO L130 PetriNetUnfolder]: 3076/5262 cut-off events. [2023-08-30 16:42:26,441 INFO L131 PetriNetUnfolder]: For 17626/17822 co-relation queries the response was YES. [2023-08-30 16:42:26,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22790 conditions, 5262 events. 3076/5262 cut-off events. For 17626/17822 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 34873 event pairs, 630 based on Foata normal form. 122/5178 useless extension candidates. Maximal degree in co-relation 22752. Up to 2547 conditions per place. [2023-08-30 16:42:26,462 INFO L137 encePairwiseOnDemand]: 237/242 looper letters, 64 selfloop transitions, 6 changer transitions 53/141 dead transitions. [2023-08-30 16:42:26,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 1468 flow [2023-08-30 16:42:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:42:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:42:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-08-30 16:42:26,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5110192837465565 [2023-08-30 16:42:26,464 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-08-30 16:42:26,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-08-30 16:42:26,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:42:26,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-08-30 16:42:26,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 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-08-30 16:42:26,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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-08-30 16:42:26,468 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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-08-30 16:42:26,468 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 825 flow. Second operand 6 states and 742 transitions. [2023-08-30 16:42:26,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 1468 flow [2023-08-30 16:42:26,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 141 transitions, 1111 flow, removed 50 selfloop flow, removed 18 redundant places. [2023-08-30 16:42:26,562 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 515 flow [2023-08-30 16:42:26,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2023-08-30 16:42:26,563 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places. [2023-08-30 16:42:26,563 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 515 flow [2023-08-30 16:42:26,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 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-08-30 16:42:26,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:42:26,564 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] [2023-08-30 16:42:26,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:42:26,564 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:42:26,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:42:26,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1954623648, now seen corresponding path program 2 times [2023-08-30 16:42:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:42:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139931233] [2023-08-30 16:42:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:42:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:42:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:42:26,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:42:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:42:26,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:42:26,703 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:42:26,704 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:42:26,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:42:26,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:42:26,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:42:26,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:42:26,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:42:26,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:42:26,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:42:26,708 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 16:42:26,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:42:26,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:42:26,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:42:26 BasicIcfg [2023-08-30 16:42:26,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:42:26,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:42:26,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:42:26,776 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:42:26,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:41:46" (3/4) ... [2023-08-30 16:42:26,778 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:42:26,872 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:42:26,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:42:26,872 INFO L158 Benchmark]: Toolchain (without parser) took 42068.48ms. Allocated memory was 75.5MB in the beginning and 7.2GB in the end (delta: 7.2GB). Free memory was 51.3MB in the beginning and 6.2GB in the end (delta: -6.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 16:42:26,873 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 38.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:42:26,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.49ms. Allocated memory is still 75.5MB. Free memory was 51.0MB in the beginning and 45.6MB in the end (delta: 5.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-08-30 16:42:26,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.85ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 42.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:42:26,874 INFO L158 Benchmark]: Boogie Preprocessor took 57.64ms. Allocated memory is still 75.5MB. Free memory was 42.9MB in the beginning and 41.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:42:26,874 INFO L158 Benchmark]: RCFGBuilder took 688.43ms. Allocated memory is still 75.5MB. Free memory was 40.8MB in the beginning and 51.1MB in the end (delta: -10.2MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-08-30 16:42:26,876 INFO L158 Benchmark]: TraceAbstraction took 40648.94ms. Allocated memory was 75.5MB in the beginning and 7.2GB in the end (delta: 7.2GB). Free memory was 50.4MB in the beginning and 6.2GB in the end (delta: -6.2GB). Peak memory consumption was 990.7MB. Max. memory is 16.1GB. [2023-08-30 16:42:26,876 INFO L158 Benchmark]: Witness Printer took 96.17ms. Allocated memory is still 7.2GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:42:26,878 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 38.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.49ms. Allocated memory is still 75.5MB. Free memory was 51.0MB in the beginning and 45.6MB in the end (delta: 5.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.85ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 42.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.64ms. Allocated memory is still 75.5MB. Free memory was 42.9MB in the beginning and 41.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.43ms. Allocated memory is still 75.5MB. Free memory was 40.8MB in the beginning and 51.1MB in the end (delta: -10.2MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40648.94ms. Allocated memory was 75.5MB in the beginning and 7.2GB in the end (delta: 7.2GB). Free memory was 50.4MB in the beginning and 6.2GB in the end (delta: -6.2GB). Peak memory consumption was 990.7MB. Max. memory is 16.1GB. * Witness Printer took 96.17ms. Allocated memory is still 7.2GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 140 PlacesBefore, 44 PlacesAfterwards, 129 TransitionsBefore, 32 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 9535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3719, independent: 3465, independent conditional: 0, independent unconditional: 3465, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1742, independent: 1698, independent conditional: 0, independent unconditional: 1698, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3719, independent: 1767, independent conditional: 0, independent unconditional: 1767, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 1742, unknown conditional: 0, unknown unconditional: 1742] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t177, ((void *)0), P0, ((void *)0))=-1, t177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t178; [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t178, ((void *)0), P1, ((void *)0))=0, t177={5:0}, t178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t179; [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t179, ((void *)0), P2, ((void *)0))=1, t177={5:0}, t178={6:0}, t179={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t180; [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t180, ((void *)0), P3, ((void *)0))=2, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t177={5:0}, t178={6:0}, t179={7:0}, t180={3:0}, weak$$choice2=0, x=1, y=2, z=1] [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1014 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 356 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2099 IncrementalHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 59 mSDtfsCounter, 2099 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1670occurred in iteration=11, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 2132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:42:26,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE