./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix026.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/mix026.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 a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 --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:48:16,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:48:16,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:48:16,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:48:16,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:48:16,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:48:16,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:48:16,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:48:16,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:48:16,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:48:16,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:48:16,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:48:16,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:48:16,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:48:16,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:48:16,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:48:16,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:48:16,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:48:16,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:48:16,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:48:16,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:48:16,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:48:16,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:48:16,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:48:16,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:48:16,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:48:16,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:48:16,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:48:16,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:48:16,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:48:16,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:48:16,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:48:16,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:48:16,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:48:16,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:48:16,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:48:16,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:48:16,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:48:16,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:48:16,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:48:16,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:48:16,480 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:48:16,516 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:48:16,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:48:16,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:48:16,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:48:16,519 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:48:16,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:48:16,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:48:16,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:48:16,520 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:48:16,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:48:16,521 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:48:16,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:48:16,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:48:16,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:48:16,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:48:16,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:48:16,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:48:16,522 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:48:16,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:48:16,522 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:48:16,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:48:16,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:48:16,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:48:16,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:48:16,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:48:16,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:48:16,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:48:16,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:48:16,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:48:16,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:48:16,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:48:16,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:48:16,525 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:48:16,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:48:16,525 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:48:16,526 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 -> a107688f8a9743f96e4ba7fbbac745d7f444b48f461db6b6c74848593b202e05 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:48:16,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:48:16,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:48:16,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:48:16,844 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:48:16,845 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:48:16,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2023-08-30 16:48:17,933 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:48:18,207 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:48:18,208 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2023-08-30 16:48:18,221 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ebda7bd/50e956aaa2cd489a8d37518de108d95b/FLAG039c4e605 [2023-08-30 16:48:18,235 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ebda7bd/50e956aaa2cd489a8d37518de108d95b [2023-08-30 16:48:18,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:48:18,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:48:18,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:48:18,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:48:18,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:48:18,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,245 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:48:18, skipping insertion in model container [2023-08-30 16:48:18,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:48:18,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:48:18,432 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/mix026.oepc.i[945,958] [2023-08-30 16:48:18,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:48:18,689 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:48:18,701 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/mix026.oepc.i[945,958] [2023-08-30 16:48:18,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:48:18,837 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:48:18,837 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:48:18,843 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:48:18,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18 WrapperNode [2023-08-30 16:48:18,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:48:18,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:48:18,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:48:18,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:48:18,852 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:48:18" (1/1) ... [2023-08-30 16:48:18,890 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:48:18" (1/1) ... [2023-08-30 16:48:18,916 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-30 16:48:18,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:48:18,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:48:18,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:48:18,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:48:18,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,962 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:48:18,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:48:18,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:48:18,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:48:18,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (1/1) ... [2023-08-30 16:48:18,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:48:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:48:19,005 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:48:19,018 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:48:19,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:48:19,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:48:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:48:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:48:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:48:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:48:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:48:19,043 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:48:19,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:48:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:48:19,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:48:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:48:19,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:48:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:48:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:48:19,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:48:19,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:48:19,046 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:48:19,242 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:48:19,245 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:48:19,573 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:48:19,689 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:48:19,689 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:48:19,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:48:19 BoogieIcfgContainer [2023-08-30 16:48:19,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:48:19,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:48:19,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:48:19,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:48:19,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:48:18" (1/3) ... [2023-08-30 16:48:19,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e57bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:48:19, skipping insertion in model container [2023-08-30 16:48:19,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:48:18" (2/3) ... [2023-08-30 16:48:19,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e57bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:48:19, skipping insertion in model container [2023-08-30 16:48:19,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:48:19" (3/3) ... [2023-08-30 16:48:19,699 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2023-08-30 16:48:19,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:48:19,715 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:48:19,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:48:19,716 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:48:19,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:48:19,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 16:48:19,871 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 16:48:19,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:48:19,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 16:48:19,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 16:48:19,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-30 16:48:19,885 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:48:19,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 16:48:19,896 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 16:48:19,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-30 16:48:19,927 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 16:48:19,931 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:48:19,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 16:48:19,936 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-08-30 16:48:23,990 INFO L134 LiptonReduction]: Checked pairs total: 9238 [2023-08-30 16:48:23,990 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-30 16:48:24,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:48:24,021 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;@75b86927, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:48:24,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:48:24,030 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-30 16:48:24,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:48:24,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:24,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:48:24,032 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:48:24,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 549528, now seen corresponding path program 1 times [2023-08-30 16:48:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406716210] [2023-08-30 16:48:24,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:24,416 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:48:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:24,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406716210] [2023-08-30 16:48:24,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406716210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:24,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:24,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:48:24,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687688318] [2023-08-30 16:48:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:24,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:48:24,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:48:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:48:24,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 241 [2023-08-30 16:48:24,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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:48:24,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:24,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 241 [2023-08-30 16:48:24,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:25,566 INFO L130 PetriNetUnfolder]: 4903/7131 cut-off events. [2023-08-30 16:48:25,566 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2023-08-30 16:48:25,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 7131 events. 4903/7131 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41983 event pairs, 895 based on Foata normal form. 0/6791 useless extension candidates. Maximal degree in co-relation 13967. Up to 5335 conditions per place. [2023-08-30 16:48:25,621 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-30 16:48:25,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-08-30 16:48:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:48:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:48:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-30 16:48:25,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435684647302904 [2023-08-30 16:48:25,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-30 16:48:25,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-30 16:48:25,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:25,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-30 16:48:25,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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:48:25,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:48:25,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:48:25,662 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 393 transitions. [2023-08-30 16:48:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-08-30 16:48:25,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:25,670 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 16:48:25,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 16:48:25,677 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:48:25,678 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 16:48:25,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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:48:25,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:25,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:25,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:48:25,682 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:48:25,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1011822437, now seen corresponding path program 1 times [2023-08-30 16:48:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:25,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374834671] [2023-08-30 16:48:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:25,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:26,139 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:48:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374834671] [2023-08-30 16:48:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374834671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:26,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:48:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469212780] [2023-08-30 16:48:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:26,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:48:26,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:48:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:48:26,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 16:48:26,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 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:48:26,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:26,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 16:48:26,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:28,230 INFO L130 PetriNetUnfolder]: 14367/19536 cut-off events. [2023-08-30 16:48:28,230 INFO L131 PetriNetUnfolder]: For 1005/1005 co-relation queries the response was YES. [2023-08-30 16:48:28,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40520 conditions, 19536 events. 14367/19536 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 100276 event pairs, 5297 based on Foata normal form. 458/19994 useless extension candidates. Maximal degree in co-relation 40510. Up to 13505 conditions per place. [2023-08-30 16:48:28,424 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-30 16:48:28,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-08-30 16:48:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:48:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:48:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-30 16:48:28,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145228215767634 [2023-08-30 16:48:28,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-30 16:48:28,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-30 16:48:28,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:28,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-30 16:48:28,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:28,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:48:28,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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:48:28,431 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 372 transitions. [2023-08-30 16:48:28,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-08-30 16:48:28,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:28,433 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-08-30 16:48:28,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-30 16:48:28,433 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-30 16:48:28,434 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-08-30 16:48:28,434 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:48:28,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:28,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:28,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:48:28,435 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:48:28,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1301726651, now seen corresponding path program 1 times [2023-08-30 16:48:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:28,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847283383] [2023-08-30 16:48:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:28,668 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:48:28,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847283383] [2023-08-30 16:48:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847283383] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:28,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:28,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:48:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438617320] [2023-08-30 16:48:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:28,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:28,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 16:48:28,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 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:48:28,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:28,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 16:48:28,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:30,510 INFO L130 PetriNetUnfolder]: 13285/18086 cut-off events. [2023-08-30 16:48:30,511 INFO L131 PetriNetUnfolder]: For 5515/5515 co-relation queries the response was YES. [2023-08-30 16:48:30,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43686 conditions, 18086 events. 13285/18086 cut-off events. For 5515/5515 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 89930 event pairs, 3757 based on Foata normal form. 230/18316 useless extension candidates. Maximal degree in co-relation 43674. Up to 8781 conditions per place. [2023-08-30 16:48:30,610 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-30 16:48:30,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 314 flow [2023-08-30 16:48:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-30 16:48:30,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 16:48:30,613 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-30 16:48:30,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-30 16:48:30,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:30,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-30 16:48:30,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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:48:30,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:30,618 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:30,618 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 482 transitions. [2023-08-30 16:48:30,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 314 flow [2023-08-30 16:48:30,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:30,679 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 152 flow [2023-08-30 16:48:30,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-30 16:48:30,680 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-30 16:48:30,683 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 152 flow [2023-08-30 16:48:30,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:48:30,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:30,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:30,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:48:30,684 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:48:30,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1701274142, now seen corresponding path program 1 times [2023-08-30 16:48:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708996167] [2023-08-30 16:48:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:31,046 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:48:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708996167] [2023-08-30 16:48:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708996167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:48:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228053974] [2023-08-30 16:48:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:31,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:31,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:31,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:31,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:48:31,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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:48:31,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:31,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:48:31,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:32,475 INFO L130 PetriNetUnfolder]: 8165/12127 cut-off events. [2023-08-30 16:48:32,476 INFO L131 PetriNetUnfolder]: For 2974/3344 co-relation queries the response was YES. [2023-08-30 16:48:32,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27858 conditions, 12127 events. 8165/12127 cut-off events. For 2974/3344 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 75281 event pairs, 1479 based on Foata normal form. 892/12754 useless extension candidates. Maximal degree in co-relation 27843. Up to 5207 conditions per place. [2023-08-30 16:48:32,562 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 57 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2023-08-30 16:48:32,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 382 flow [2023-08-30 16:48:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-30 16:48:32,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134854771784232 [2023-08-30 16:48:32,565 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-30 16:48:32,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-30 16:48:32,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:32,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-30 16:48:32,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 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:48:32,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:32,570 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:32,570 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 152 flow. Second operand 4 states and 495 transitions. [2023-08-30 16:48:32,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 382 flow [2023-08-30 16:48:32,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:48:32,585 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 195 flow [2023-08-30 16:48:32,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-30 16:48:32,585 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-30 16:48:32,586 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 195 flow [2023-08-30 16:48:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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:48:32,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:32,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:48:32,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:48:32,587 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:48:32,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1819110839, now seen corresponding path program 1 times [2023-08-30 16:48:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820275956] [2023-08-30 16:48:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:33,000 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:48:33,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820275956] [2023-08-30 16:48:33,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820275956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:33,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:33,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:48:33,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371832095] [2023-08-30 16:48:33,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:33,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:48:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:33,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:48:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:48:33,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:48:33,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:33,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:33,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:48:33,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:34,026 INFO L130 PetriNetUnfolder]: 6526/10004 cut-off events. [2023-08-30 16:48:34,026 INFO L131 PetriNetUnfolder]: For 5211/5417 co-relation queries the response was YES. [2023-08-30 16:48:34,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28214 conditions, 10004 events. 6526/10004 cut-off events. For 5211/5417 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 63271 event pairs, 1399 based on Foata normal form. 590/10374 useless extension candidates. Maximal degree in co-relation 28196. Up to 3733 conditions per place. [2023-08-30 16:48:34,095 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 73 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-30 16:48:34,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 530 flow [2023-08-30 16:48:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:48:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:48:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2023-08-30 16:48:34,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161825726141079 [2023-08-30 16:48:34,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 622 transitions. [2023-08-30 16:48:34,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 622 transitions. [2023-08-30 16:48:34,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:34,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 622 transitions. [2023-08-30 16:48:34,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 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:48:34,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:48:34,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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:48:34,104 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 195 flow. Second operand 5 states and 622 transitions. [2023-08-30 16:48:34,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 530 flow [2023-08-30 16:48:34,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 94 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:48:34,115 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 260 flow [2023-08-30 16:48:34,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-30 16:48:34,116 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-30 16:48:34,116 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 260 flow [2023-08-30 16:48:34,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:34,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:34,117 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] [2023-08-30 16:48:34,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:48:34,117 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:48:34,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash -493523634, now seen corresponding path program 1 times [2023-08-30 16:48:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445125995] [2023-08-30 16:48:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:34,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:34,857 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:48:34,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:34,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445125995] [2023-08-30 16:48:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445125995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:34,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:48:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167847008] [2023-08-30 16:48:34,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:34,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:48:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:48:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:48:34,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 241 [2023-08-30 16:48:34,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 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:48:34,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:34,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 241 [2023-08-30 16:48:34,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:36,342 INFO L130 PetriNetUnfolder]: 11286/16297 cut-off events. [2023-08-30 16:48:36,342 INFO L131 PetriNetUnfolder]: For 28664/28664 co-relation queries the response was YES. [2023-08-30 16:48:36,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55330 conditions, 16297 events. 11286/16297 cut-off events. For 28664/28664 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 93065 event pairs, 802 based on Foata normal form. 54/16351 useless extension candidates. Maximal degree in co-relation 55309. Up to 8044 conditions per place. [2023-08-30 16:48:36,427 INFO L137 encePairwiseOnDemand]: 228/241 looper letters, 129 selfloop transitions, 54 changer transitions 14/197 dead transitions. [2023-08-30 16:48:36,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 197 transitions, 1353 flow [2023-08-30 16:48:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:48:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:48:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1047 transitions. [2023-08-30 16:48:36,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827109266943292 [2023-08-30 16:48:36,431 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1047 transitions. [2023-08-30 16:48:36,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1047 transitions. [2023-08-30 16:48:36,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:36,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1047 transitions. [2023-08-30 16:48:36,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.33333333333333) internal successors, (1047), 9 states have internal predecessors, (1047), 0 states have call successors, (0), 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:48:36,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 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:48:36,438 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 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:48:36,438 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 260 flow. Second operand 9 states and 1047 transitions. [2023-08-30 16:48:36,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 197 transitions, 1353 flow [2023-08-30 16:48:36,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 197 transitions, 1309 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:36,485 INFO L231 Difference]: Finished difference. Result has 67 places, 94 transitions, 710 flow [2023-08-30 16:48:36,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=710, PETRI_PLACES=67, PETRI_TRANSITIONS=94} [2023-08-30 16:48:36,486 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-08-30 16:48:36,486 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 94 transitions, 710 flow [2023-08-30 16:48:36,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 states have internal predecessors, (614), 0 states have call successors, (0), 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:48:36,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:36,486 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] [2023-08-30 16:48:36,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:48:36,487 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:48:36,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 660020462, now seen corresponding path program 2 times [2023-08-30 16:48:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:36,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994912151] [2023-08-30 16:48:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:36,875 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:48:36,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994912151] [2023-08-30 16:48:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994912151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:36,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:48:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759478307] [2023-08-30 16:48:36,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:36,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:48:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:36,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:48:36,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:48:36,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:48:36,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 94 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 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:48:36,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:36,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:48:36,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:37,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, 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][95], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), 213#(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)), Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 166#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P3Thread1of1ForFork2InUse, 155#true, P1Thread1of1ForFork3InUse, 106#P0EXITtrue, 180#(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)), Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 36#L873-3true, 117#L813true, Black: 176#(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) (<= 0 ~main$tmp_guard0~0)), 64#L786true, 184#true]) [2023-08-30 16:48:37,541 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:48:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:37,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:48:37,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, 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][132], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 166#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 36#L873-3true, 215#(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: 180#(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)), 64#L786true, 176#(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) (<= 0 ~main$tmp_guard0~0)), 184#true]) [2023-08-30 16:48:37,605 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:48:37,605 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:48:37,605 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:48:37,605 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:48:37,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, 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][132], [Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), 102#L876true, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 215#(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: 180#(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)), Black: 176#(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) (<= 0 ~main$tmp_guard0~0)), 64#L786true, 184#true]) [2023-08-30 16:48:37,662 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 16:48:37,662 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:48:37,662 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:48:37,662 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 16:48:37,804 INFO L130 PetriNetUnfolder]: 3699/5840 cut-off events. [2023-08-30 16:48:37,804 INFO L131 PetriNetUnfolder]: For 13243/13641 co-relation queries the response was YES. [2023-08-30 16:48:37,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22132 conditions, 5840 events. 3699/5840 cut-off events. For 13243/13641 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 34538 event pairs, 502 based on Foata normal form. 437/6133 useless extension candidates. Maximal degree in co-relation 22104. Up to 1987 conditions per place. [2023-08-30 16:48:37,864 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 132 selfloop transitions, 14 changer transitions 4/182 dead transitions. [2023-08-30 16:48:37,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 182 transitions, 1433 flow [2023-08-30 16:48:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:48:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:48:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-30 16:48:37,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152143845089903 [2023-08-30 16:48:37,874 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-30 16:48:37,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-30 16:48:37,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:37,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-30 16:48:37,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 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:48:37,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:48:37,880 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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:48:37,880 INFO L175 Difference]: Start difference. First operand has 67 places, 94 transitions, 710 flow. Second operand 6 states and 745 transitions. [2023-08-30 16:48:37,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 182 transitions, 1433 flow [2023-08-30 16:48:38,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 182 transitions, 1411 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 16:48:38,010 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 746 flow [2023-08-30 16:48:38,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=746, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2023-08-30 16:48:38,011 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-30 16:48:38,011 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 746 flow [2023-08-30 16:48:38,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 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:48:38,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:38,012 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:48:38,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:48:38,013 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:48:38,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash -447439276, now seen corresponding path program 1 times [2023-08-30 16:48:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:38,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187517585] [2023-08-30 16:48:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:38,718 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:48:38,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:38,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187517585] [2023-08-30 16:48:38,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187517585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:38,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:38,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:48:38,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71417284] [2023-08-30 16:48:38,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:38,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:48:38,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:38,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:48:38,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:48:38,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 241 [2023-08-30 16:48:38,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 746 flow. Second operand has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 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:48:38,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:38,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 241 [2023-08-30 16:48:38,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:40,209 INFO L130 PetriNetUnfolder]: 7189/10780 cut-off events. [2023-08-30 16:48:40,209 INFO L131 PetriNetUnfolder]: For 28812/28812 co-relation queries the response was YES. [2023-08-30 16:48:40,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45430 conditions, 10780 events. 7189/10780 cut-off events. For 28812/28812 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 60813 event pairs, 938 based on Foata normal form. 13/10793 useless extension candidates. Maximal degree in co-relation 45400. Up to 4690 conditions per place. [2023-08-30 16:48:40,249 INFO L137 encePairwiseOnDemand]: 228/241 looper letters, 126 selfloop transitions, 67 changer transitions 99/292 dead transitions. [2023-08-30 16:48:40,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 292 transitions, 2573 flow [2023-08-30 16:48:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:48:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:48:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1273 transitions. [2023-08-30 16:48:40,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48019615239532254 [2023-08-30 16:48:40,262 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1273 transitions. [2023-08-30 16:48:40,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1273 transitions. [2023-08-30 16:48:40,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:40,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1273 transitions. [2023-08-30 16:48:40,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 0 states have call successors, (0), 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:48:40,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 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:48:40,270 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 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:48:40,270 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 746 flow. Second operand 11 states and 1273 transitions. [2023-08-30 16:48:40,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 292 transitions, 2573 flow [2023-08-30 16:48:40,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 292 transitions, 2484 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-30 16:48:40,474 INFO L231 Difference]: Finished difference. Result has 82 places, 121 transitions, 1094 flow [2023-08-30 16:48:40,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1094, PETRI_PLACES=82, PETRI_TRANSITIONS=121} [2023-08-30 16:48:40,475 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-08-30 16:48:40,475 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 121 transitions, 1094 flow [2023-08-30 16:48:40,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.125) internal successors, (825), 8 states have internal predecessors, (825), 0 states have call successors, (0), 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:48:40,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:40,476 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] [2023-08-30 16:48:40,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:48:40,477 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:48:40,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash 707565699, now seen corresponding path program 1 times [2023-08-30 16:48:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807691981] [2023-08-30 16:48:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:41,383 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:48:41,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807691981] [2023-08-30 16:48:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807691981] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:41,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:41,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:48:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770539449] [2023-08-30 16:48:41,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:41,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:48:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:41,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:48:41,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:48:41,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 241 [2023-08-30 16:48:41,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 121 transitions, 1094 flow. Second operand has 9 states, 9 states have (on average 102.66666666666667) internal successors, (924), 9 states have internal predecessors, (924), 0 states have call successors, (0), 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:48:41,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:41,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 241 [2023-08-30 16:48:41,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:42,968 INFO L130 PetriNetUnfolder]: 7225/10753 cut-off events. [2023-08-30 16:48:42,968 INFO L131 PetriNetUnfolder]: For 28604/28604 co-relation queries the response was YES. [2023-08-30 16:48:43,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46706 conditions, 10753 events. 7225/10753 cut-off events. For 28604/28604 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 60879 event pairs, 884 based on Foata normal form. 16/10769 useless extension candidates. Maximal degree in co-relation 46672. Up to 3991 conditions per place. [2023-08-30 16:48:43,074 INFO L137 encePairwiseOnDemand]: 227/241 looper letters, 279 selfloop transitions, 128 changer transitions 25/432 dead transitions. [2023-08-30 16:48:43,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 432 transitions, 4226 flow [2023-08-30 16:48:43,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:48:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:48:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1297 transitions. [2023-08-30 16:48:43,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4892493398717465 [2023-08-30 16:48:43,079 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1297 transitions. [2023-08-30 16:48:43,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1297 transitions. [2023-08-30 16:48:43,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:43,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1297 transitions. [2023-08-30 16:48:43,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.9090909090909) internal successors, (1297), 11 states have internal predecessors, (1297), 0 states have call successors, (0), 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:48:43,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 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:48:43,089 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 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:48:43,089 INFO L175 Difference]: Start difference. First operand has 82 places, 121 transitions, 1094 flow. Second operand 11 states and 1297 transitions. [2023-08-30 16:48:43,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 432 transitions, 4226 flow [2023-08-30 16:48:43,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 432 transitions, 4079 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 16:48:43,483 INFO L231 Difference]: Finished difference. Result has 94 places, 224 transitions, 2724 flow [2023-08-30 16:48:43,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2724, PETRI_PLACES=94, PETRI_TRANSITIONS=224} [2023-08-30 16:48:43,484 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2023-08-30 16:48:43,484 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 224 transitions, 2724 flow [2023-08-30 16:48:43,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.66666666666667) internal successors, (924), 9 states have internal predecessors, (924), 0 states have call successors, (0), 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:48:43,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:43,485 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] [2023-08-30 16:48:43,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:48:43,486 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:48:43,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash -780855464, now seen corresponding path program 1 times [2023-08-30 16:48:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634152079] [2023-08-30 16:48:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:44,163 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:48:44,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:44,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634152079] [2023-08-30 16:48:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634152079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:44,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:44,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:48:44,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9864843] [2023-08-30 16:48:44,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:44,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:48:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:44,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:48:44,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:48:44,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-30 16:48:44,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 224 transitions, 2724 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 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:48:44,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:44,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-30 16:48:44,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:45,579 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, 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][170], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, 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) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 242#true, Black: 215#(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)), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 36#L873-3true, 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(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)), 184#true]) [2023-08-30 16:48:45,579 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 16:48:45,579 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 16:48:45,579 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 16:48:45,579 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 16:48:45,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, 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][170], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), 102#L876true, Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 242#true, Black: 215#(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)), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 53#L842true, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(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)), 184#true]) [2023-08-30 16:48:45,654 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 16:48:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 16:48:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 16:48:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 16:48:45,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([406] L826-->L842: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse8 (not .cse4)) (.cse12 (= (mod v_~a$w_buff0_used~0_140 256) 0)) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse6 (and .cse4 .cse11))) (let ((.cse2 (or .cse12 .cse9 .cse6)) (.cse3 (and .cse8 (not .cse12)))) (let ((.cse1 (ite .cse2 v_~a~0_92 (ite .cse3 v_~a$w_buff0~0_51 v_~a$w_buff1~0_48))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse5 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_139 256) 0))) (and (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 .cse1)) (= v_~a$w_buff0_used~0_139 (ite .cse0 v_~a$w_buff0_used~0_140 (ite .cse2 v_~a$w_buff0_used~0_140 (ite .cse3 0 v_~a$w_buff0_used~0_140)))) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= v_~a$r_buff0_thd4~0_57 (ite .cse0 v_~a$r_buff0_thd4~0_58 (ite (or (and .cse4 .cse5) .cse6 .cse7) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse7) .cse8) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$w_buff1_used~0_130 (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse9 .cse6 .cse7) v_~a$w_buff1_used~0_131 0))) (= v_~a$w_buff0~0_51 v_~a$w_buff0~0_50) (= .cse1 v_~__unbuffered_p3_EBX~0_14) (= v_~a$flush_delayed~0_35 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse10 .cse5) (and .cse10 .cse11) .cse7)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55)))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_51, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_140, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_139, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_50, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34, 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][170], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 155#true, P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 215#(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#true, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 53#L842true, 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(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)), 28#L884true, 184#true]) [2023-08-30 16:48:45,696 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 16:48:45,697 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 16:48:45,697 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 16:48:45,697 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 16:48:45,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([521] L884-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_26) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_26} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][332], [Black: 248#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a~0) (<= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (< 0 (+ (div ~a$w_buff0_used~0 256) 1)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 189#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 250#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 193#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 244#(and (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 195#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 245#(and (= ~a$w_buff0~0 0) (= ~x~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 191#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 252#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 186#(and (= ~a~0 0) (= ~a$r_buff0_thd4~0 0)), P0Thread1of1ForFork1InUse, Black: 187#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 246#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P2Thread1of1ForFork0InUse, Black: 258#(and (not (= ~a$w_buff0~0 0)) (= ~__unbuffered_p0_EAX~0 ~a$w_buff0~0) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd4~0 0)), Black: 256#(and (not (= ~a$w_buff0~0 0)) (= ~x~0 ~a$w_buff0~0) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd2~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (<= 1 ~a$w_buff0_used~0) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), P3Thread1of1ForFork2InUse, 155#true, P1Thread1of1ForFork3InUse, 271#(and (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 106#P0EXITtrue, Black: 151#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 215#(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#true, 68#P2EXITtrue, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 83#L826true, 122#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 168#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 219#true, Black: 234#(and (= ~x~0 ~a$w_buff0~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 222#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (= ~a~0 0) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), 112#P1EXITtrue, Black: 180#(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)), 184#true]) [2023-08-30 16:48:45,723 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-08-30 16:48:45,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-08-30 16:48:45,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-08-30 16:48:45,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-08-30 16:48:45,770 INFO L130 PetriNetUnfolder]: 7280/11759 cut-off events. [2023-08-30 16:48:45,770 INFO L131 PetriNetUnfolder]: For 53700/54459 co-relation queries the response was YES. [2023-08-30 16:48:45,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56036 conditions, 11759 events. 7280/11759 cut-off events. For 53700/54459 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 79252 event pairs, 1265 based on Foata normal form. 307/11798 useless extension candidates. Maximal degree in co-relation 55994. Up to 3760 conditions per place. [2023-08-30 16:48:45,840 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 160 selfloop transitions, 45 changer transitions 71/357 dead transitions. [2023-08-30 16:48:45,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 357 transitions, 4239 flow [2023-08-30 16:48:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:48:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:48:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-30 16:48:45,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074096028452875 [2023-08-30 16:48:45,843 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-30 16:48:45,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-30 16:48:45,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:45,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-30 16:48:45,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:45,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:48:45,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:48:45,849 INFO L175 Difference]: Start difference. First operand has 94 places, 224 transitions, 2724 flow. Second operand 7 states and 856 transitions. [2023-08-30 16:48:45,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 357 transitions, 4239 flow [2023-08-30 16:48:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 357 transitions, 4211 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-08-30 16:48:46,464 INFO L231 Difference]: Finished difference. Result has 104 places, 224 transitions, 2866 flow [2023-08-30 16:48:46,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=2700, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2866, PETRI_PLACES=104, PETRI_TRANSITIONS=224} [2023-08-30 16:48:46,465 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2023-08-30 16:48:46,465 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 224 transitions, 2866 flow [2023-08-30 16:48:46,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 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:48:46,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:46,466 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:48:46,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:48:46,466 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:48:46,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1048013744, now seen corresponding path program 2 times [2023-08-30 16:48:46,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:46,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269624806] [2023-08-30 16:48:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:46,708 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:48:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269624806] [2023-08-30 16:48:46,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269624806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:46,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:46,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:48:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611553912] [2023-08-30 16:48:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:46,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:46,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:46,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:46,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 16:48:46,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 224 transitions, 2866 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 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:48:46,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:46,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 16:48:46,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:48,683 INFO L130 PetriNetUnfolder]: 9839/15551 cut-off events. [2023-08-30 16:48:48,683 INFO L131 PetriNetUnfolder]: For 92194/92521 co-relation queries the response was YES. [2023-08-30 16:48:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80760 conditions, 15551 events. 9839/15551 cut-off events. For 92194/92521 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 104581 event pairs, 2453 based on Foata normal form. 211/15635 useless extension candidates. Maximal degree in co-relation 80712. Up to 6661 conditions per place. [2023-08-30 16:48:48,776 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 170 selfloop transitions, 29 changer transitions 162/378 dead transitions. [2023-08-30 16:48:48,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 378 transitions, 5152 flow [2023-08-30 16:48:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-30 16:48:48,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.520746887966805 [2023-08-30 16:48:48,778 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-30 16:48:48,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-30 16:48:48,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:48,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-30 16:48:48,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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:48:48,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:48,782 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:48,782 INFO L175 Difference]: Start difference. First operand has 104 places, 224 transitions, 2866 flow. Second operand 4 states and 502 transitions. [2023-08-30 16:48:48,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 378 transitions, 5152 flow [2023-08-30 16:48:49,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 378 transitions, 5071 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:49,652 INFO L231 Difference]: Finished difference. Result has 103 places, 164 transitions, 1904 flow [2023-08-30 16:48:49,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=2797, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1904, PETRI_PLACES=103, PETRI_TRANSITIONS=164} [2023-08-30 16:48:49,653 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places. [2023-08-30 16:48:49,653 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 164 transitions, 1904 flow [2023-08-30 16:48:49,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 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:48:49,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:49,654 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] [2023-08-30 16:48:49,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:48:49,654 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:48:49,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1866422155, now seen corresponding path program 2 times [2023-08-30 16:48:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:49,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369462632] [2023-08-30 16:48:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:50,547 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:48:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369462632] [2023-08-30 16:48:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369462632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:48:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671978405] [2023-08-30 16:48:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:50,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:48:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:50,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:48:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:48:50,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 16:48:50,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 164 transitions, 1904 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:48:50,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:50,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 16:48:50,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:52,131 INFO L130 PetriNetUnfolder]: 6075/10180 cut-off events. [2023-08-30 16:48:52,132 INFO L131 PetriNetUnfolder]: For 52769/53350 co-relation queries the response was YES. [2023-08-30 16:48:52,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49960 conditions, 10180 events. 6075/10180 cut-off events. For 52769/53350 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 70974 event pairs, 475 based on Foata normal form. 206/10222 useless extension candidates. Maximal degree in co-relation 49913. Up to 3590 conditions per place. [2023-08-30 16:48:52,203 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 170 selfloop transitions, 51 changer transitions 51/304 dead transitions. [2023-08-30 16:48:52,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 304 transitions, 3495 flow [2023-08-30 16:48:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:48:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:48:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-30 16:48:52,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180794309425015 [2023-08-30 16:48:52,206 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-30 16:48:52,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-30 16:48:52,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:52,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-30 16:48:52,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 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:48:52,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:48:52,211 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:48:52,211 INFO L175 Difference]: Start difference. First operand has 103 places, 164 transitions, 1904 flow. Second operand 7 states and 874 transitions. [2023-08-30 16:48:52,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 304 transitions, 3495 flow [2023-08-30 16:48:52,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 304 transitions, 3367 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:52,684 INFO L231 Difference]: Finished difference. Result has 108 places, 173 transitions, 2107 flow [2023-08-30 16:48:52,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2107, PETRI_PLACES=108, PETRI_TRANSITIONS=173} [2023-08-30 16:48:52,685 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2023-08-30 16:48:52,685 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 173 transitions, 2107 flow [2023-08-30 16:48:52,686 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:48:52,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:52,686 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:48:52,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:48:52,686 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:48:52,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1478996784, now seen corresponding path program 3 times [2023-08-30 16:48:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:52,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870189605] [2023-08-30 16:48:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:52,909 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:48:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:52,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870189605] [2023-08-30 16:48:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870189605] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:52,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:52,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:48:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201222362] [2023-08-30 16:48:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:52,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:48:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:52,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:48:52,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:48:52,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-08-30 16:48:52,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 173 transitions, 2107 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:52,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:52,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-08-30 16:48:52,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:54,685 INFO L130 PetriNetUnfolder]: 9384/15597 cut-off events. [2023-08-30 16:48:54,685 INFO L131 PetriNetUnfolder]: For 106769/107349 co-relation queries the response was YES. [2023-08-30 16:48:54,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82094 conditions, 15597 events. 9384/15597 cut-off events. For 106769/107349 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 115054 event pairs, 2020 based on Foata normal form. 193/15667 useless extension candidates. Maximal degree in co-relation 82043. Up to 7052 conditions per place. [2023-08-30 16:48:54,822 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 197 selfloop transitions, 2 changer transitions 129/349 dead transitions. [2023-08-30 16:48:54,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 349 transitions, 4861 flow [2023-08-30 16:48:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:48:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:48:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-30 16:48:54,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238589211618258 [2023-08-30 16:48:54,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-30 16:48:54,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-30 16:48:54,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:54,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-30 16:48:54,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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:48:54,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:54,829 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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:48:54,829 INFO L175 Difference]: Start difference. First operand has 108 places, 173 transitions, 2107 flow. Second operand 4 states and 505 transitions. [2023-08-30 16:48:54,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 349 transitions, 4861 flow [2023-08-30 16:48:55,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 349 transitions, 4754 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-30 16:48:55,815 INFO L231 Difference]: Finished difference. Result has 107 places, 164 transitions, 1948 flow [2023-08-30 16:48:55,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1948, PETRI_PLACES=107, PETRI_TRANSITIONS=164} [2023-08-30 16:48:55,816 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2023-08-30 16:48:55,816 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 164 transitions, 1948 flow [2023-08-30 16:48:55,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:48:55,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:55,817 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] [2023-08-30 16:48:55,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:48:55,817 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:48:55,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 547146855, now seen corresponding path program 3 times [2023-08-30 16:48:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:55,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327468495] [2023-08-30 16:48:55,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:56,154 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:48:56,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:56,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327468495] [2023-08-30 16:48:56,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327468495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:56,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:56,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:48:56,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336378479] [2023-08-30 16:48:56,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:56,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:48:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:48:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:48:56,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 241 [2023-08-30 16:48:56,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 164 transitions, 1948 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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:48:56,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:48:56,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 241 [2023-08-30 16:48:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:48:57,800 INFO L130 PetriNetUnfolder]: 7751/12991 cut-off events. [2023-08-30 16:48:57,801 INFO L131 PetriNetUnfolder]: For 89605/90747 co-relation queries the response was YES. [2023-08-30 16:48:57,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64654 conditions, 12991 events. 7751/12991 cut-off events. For 89605/90747 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 98486 event pairs, 808 based on Foata normal form. 633/13363 useless extension candidates. Maximal degree in co-relation 64604. Up to 4934 conditions per place. [2023-08-30 16:48:57,881 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 191 selfloop transitions, 18 changer transitions 60/291 dead transitions. [2023-08-30 16:48:57,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 291 transitions, 3723 flow [2023-08-30 16:48:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:48:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:48:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-08-30 16:48:57,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4985180794309425 [2023-08-30 16:48:57,885 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-08-30 16:48:57,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-08-30 16:48:57,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:48:57,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-08-30 16:48:57,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 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:48:57,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:48:57,890 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:48:57,890 INFO L175 Difference]: Start difference. First operand has 107 places, 164 transitions, 1948 flow. Second operand 7 states and 841 transitions. [2023-08-30 16:48:57,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 291 transitions, 3723 flow [2023-08-30 16:48:58,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 291 transitions, 3678 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-30 16:48:58,961 INFO L231 Difference]: Finished difference. Result has 113 places, 135 transitions, 1536 flow [2023-08-30 16:48:58,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1536, PETRI_PLACES=113, PETRI_TRANSITIONS=135} [2023-08-30 16:48:58,962 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places. [2023-08-30 16:48:58,962 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 135 transitions, 1536 flow [2023-08-30 16:48:58,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 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:48:58,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:48:58,962 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] [2023-08-30 16:48:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:48:58,963 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:48:58,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:48:58,963 INFO L85 PathProgramCache]: Analyzing trace with hash 256999797, now seen corresponding path program 1 times [2023-08-30 16:48:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:48:58,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886743310] [2023-08-30 16:48:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:48:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:48:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:48:59,986 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:48:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:48:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886743310] [2023-08-30 16:48:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886743310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:48:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:48:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:48:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428411095] [2023-08-30 16:48:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:48:59,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:48:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:48:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:48:59,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:49:00,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 16:49:00,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 135 transitions, 1536 flow. Second operand has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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:49:00,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:49:00,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 16:49:00,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:49:00,916 INFO L130 PetriNetUnfolder]: 2881/4946 cut-off events. [2023-08-30 16:49:00,918 INFO L131 PetriNetUnfolder]: For 27090/27293 co-relation queries the response was YES. [2023-08-30 16:49:00,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25925 conditions, 4946 events. 2881/4946 cut-off events. For 27090/27293 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 30874 event pairs, 405 based on Foata normal form. 41/4876 useless extension candidates. Maximal degree in co-relation 25881. Up to 1846 conditions per place. [2023-08-30 16:49:00,960 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 134 selfloop transitions, 25 changer transitions 47/226 dead transitions. [2023-08-30 16:49:00,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 226 transitions, 2676 flow [2023-08-30 16:49:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:49:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:49:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-30 16:49:00,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074096028452875 [2023-08-30 16:49:00,964 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-30 16:49:00,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-30 16:49:00,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:49:00,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-30 16:49:00,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:49:00,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:49:00,969 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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:49:00,969 INFO L175 Difference]: Start difference. First operand has 113 places, 135 transitions, 1536 flow. Second operand 7 states and 856 transitions. [2023-08-30 16:49:00,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 226 transitions, 2676 flow [2023-08-30 16:49:01,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 226 transitions, 2282 flow, removed 84 selfloop flow, removed 15 redundant places. [2023-08-30 16:49:01,152 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 1196 flow [2023-08-30 16:49:01,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1196, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2023-08-30 16:49:01,153 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2023-08-30 16:49:01,153 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 1196 flow [2023-08-30 16:49:01,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 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:49:01,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:49:01,153 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] [2023-08-30 16:49:01,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:49:01,154 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:49:01,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:49:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 442705501, now seen corresponding path program 2 times [2023-08-30 16:49:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:49:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813029769] [2023-08-30 16:49:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:49:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:49:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:49:01,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:49:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:49:01,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:49:01,323 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:49:01,325 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:49:01,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:49:01,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:49:01,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:49:01,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:49:01,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:49:01,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:49:01,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:49:01,331 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 16:49:01,337 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:49:01,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:49:01,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:49:01 BasicIcfg [2023-08-30 16:49:01,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:49:01,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:49:01,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:49:01,433 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:49:01,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:48:19" (3/4) ... [2023-08-30 16:49:01,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:49:01,525 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:49:01,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:49:01,526 INFO L158 Benchmark]: Toolchain (without parser) took 43288.25ms. Allocated memory was 79.7MB in the beginning and 4.0GB in the end (delta: 4.0GB). Free memory was 55.8MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-08-30 16:49:01,526 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:49:01,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.54ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 50.1MB in the end (delta: 5.5MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-08-30 16:49:01,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.93ms. Allocated memory is still 79.7MB. Free memory was 50.1MB in the beginning and 47.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:49:01,527 INFO L158 Benchmark]: Boogie Preprocessor took 56.03ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 45.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:49:01,528 INFO L158 Benchmark]: RCFGBuilder took 717.56ms. Allocated memory is still 79.7MB. Free memory was 45.2MB in the beginning and 34.1MB in the end (delta: 11.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2023-08-30 16:49:01,528 INFO L158 Benchmark]: TraceAbstraction took 41739.04ms. Allocated memory was 79.7MB in the beginning and 4.0GB in the end (delta: 4.0GB). Free memory was 33.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-08-30 16:49:01,528 INFO L158 Benchmark]: Witness Printer took 92.89ms. Allocated memory is still 4.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:49:01,530 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.19ms. Allocated memory is still 65.0MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.54ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 50.1MB in the end (delta: 5.5MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.93ms. Allocated memory is still 79.7MB. Free memory was 50.1MB in the beginning and 47.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.03ms. Allocated memory is still 79.7MB. Free memory was 47.6MB in the beginning and 45.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 717.56ms. Allocated memory is still 79.7MB. Free memory was 45.2MB in the beginning and 34.1MB in the end (delta: 11.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 41739.04ms. Allocated memory was 79.7MB in the beginning and 4.0GB in the end (delta: 4.0GB). Free memory was 33.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 92.89ms. Allocated memory is still 4.0GB. Free memory was 1.8GB in the beginning and 1.8GB 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.1s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 9238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3488, independent: 3243, independent conditional: 0, independent unconditional: 3243, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1676, independent: 1630, independent conditional: 0, independent unconditional: 1630, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3488, independent: 1613, independent conditional: 0, independent unconditional: 1613, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1676, unknown conditional: 0, unknown unconditional: 1676] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t681, ((void *)0), P0, ((void *)0))=-3, t681={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t682, ((void *)0), P1, ((void *)0))=-2, t681={5:0}, t682={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t683, ((void *)0), P2, ((void *)0))=-1, t681={5:0}, t682={6:0}, t683={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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(&t684, ((void *)0), P3, ((void *)0))=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [L788] 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) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 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 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 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) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=1, x=1, y=1, z=2] [L844] 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) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 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 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __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=1, x=1, y=1, z=2] [L768] 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) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 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 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __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=1, x=1, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 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) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 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 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __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=1, x=1, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __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, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 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 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __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, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L888] 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_p1_EAX=0, __unbuffered_p3_EAX=2, __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=1, x=1, y=1, z=2] - 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: 867]: 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: 871]: 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: 873]: 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: 869]: 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, 168 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: 41.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1339 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1158 mSDsluCounter, 755 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 605 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3324 IncrementalHoareTripleChecker+Invalid, 3534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 150 mSDtfsCounter, 3324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2866occurred in iteration=10, InterpolantAutomatonStates: 92, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 3017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:49:01,565 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