./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.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 --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 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:10:52,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:10:52,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:10:52,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:10:52,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:10:52,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:10:52,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:10:52,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:10:52,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:10:52,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:10:52,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:10:52,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:10:52,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:10:52,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:10:52,426 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:10:52,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:10:52,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:10:52,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:10:52,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:10:52,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:10:52,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:10:52,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:10:52,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:10:52,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:10:52,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:10:52,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:10:52,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:10:52,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:10:52,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:10:52,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:10:52,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:10:52,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:10:52,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:10:52,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:10:52,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:10:52,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:10:52,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:10:52,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:10:52,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:10:52,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:10:52,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:10:52,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:10:52,437 INFO L153 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 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 -> 3bbcbfea07b4de27a61735028fd08097276598be4815bd7ea5f14ba44ebf2380 [2024-11-16 19:10:52,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:10:52,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:10:52,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:10:52,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:10:52,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:10:52,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2024-11-16 19:10:54,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:10:54,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:10:54,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i [2024-11-16 19:10:54,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13776279/b8d4326bbced49668839e0909c818b16/FLAGfa33ca3f8 [2024-11-16 19:10:54,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13776279/b8d4326bbced49668839e0909c818b16 [2024-11-16 19:10:54,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:10:54,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:10:54,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:10:54,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:10:54,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:10:54,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:10:54" (1/1) ... [2024-11-16 19:10:54,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d481b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:54, skipping insertion in model container [2024-11-16 19:10:54,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:10:54" (1/1) ... [2024-11-16 19:10:54,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:10:55,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2024-11-16 19:10:55,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:10:55,212 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:10:55,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix025_pso.opt_rmo.opt.i[999,1012] [2024-11-16 19:10:55,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:10:55,306 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:10:55,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55 WrapperNode [2024-11-16 19:10:55,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:10:55,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:10:55,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:10:55,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:10:55,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,363 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-11-16 19:10:55,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:10:55,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:10:55,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:10:55,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:10:55,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,392 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:10:55,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:10:55,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:10:55,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:10:55,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:10:55,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (1/1) ... [2024-11-16 19:10:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:10:55,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:10:55,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:10:55,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:10:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:10:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:10:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:10:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:10:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:10:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:10:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-16 19:10:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-16 19:10:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:10:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:10:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:10:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:10:55,522 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:10:55,687 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:10:55,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:10:55,991 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:10:55,991 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:10:56,247 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:10:56,248 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:10:56,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:10:56 BoogieIcfgContainer [2024-11-16 19:10:56,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:10:56,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:10:56,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:10:56,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:10:56,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:10:54" (1/3) ... [2024-11-16 19:10:56,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af89298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:10:56, skipping insertion in model container [2024-11-16 19:10:56,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:10:55" (2/3) ... [2024-11-16 19:10:56,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af89298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:10:56, skipping insertion in model container [2024-11-16 19:10:56,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:10:56" (3/3) ... [2024-11-16 19:10:56,259 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2024-11-16 19:10:56,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:10:56,275 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:10:56,275 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:10:56,326 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:10:56,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-11-16 19:10:56,391 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-11-16 19:10:56,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:10:56,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-11-16 19:10:56,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-11-16 19:10:56,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-11-16 19:10:56,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:10:56,419 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@28538ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:10:56,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 19:10:56,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:10:56,430 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-16 19:10:56,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:10:56,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:56,431 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 19:10:56,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:10:56,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1921620532, now seen corresponding path program 1 times [2024-11-16 19:10:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:56,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791490404] [2024-11-16 19:10:56,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791490404] [2024-11-16 19:10:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791490404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:56,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:56,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 19:10:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106807102] [2024-11-16 19:10:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:56,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:10:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:56,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:10:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:10:56,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:10:56,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:56,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:56,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:10:56,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:58,148 INFO L124 PetriNetUnfolderBase]: 5603/8028 cut-off events. [2024-11-16 19:10:58,148 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-16 19:10:58,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16075 conditions, 8028 events. 5603/8028 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43652 event pairs, 618 based on Foata normal form. 252/8267 useless extension candidates. Maximal degree in co-relation 16064. Up to 6936 conditions per place. [2024-11-16 19:10:58,209 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 47 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-16 19:10:58,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 226 flow [2024-11-16 19:10:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:10:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:10:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-16 19:10:58,222 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-11-16 19:10:58,224 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 78 transitions. [2024-11-16 19:10:58,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 226 flow [2024-11-16 19:10:58,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:10:58,231 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-11-16 19:10:58,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-16 19:10:58,236 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-11-16 19:10:58,237 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-11-16 19:10:58,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:58,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:58,237 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:10:58,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:10:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash 963019023, now seen corresponding path program 1 times [2024-11-16 19:10:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914129826] [2024-11-16 19:10:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:10:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:10:58,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:10:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914129826] [2024-11-16 19:10:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914129826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:10:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:10:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:10:58,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161953239] [2024-11-16 19:10:58,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:10:58,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:10:58,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:10:58,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:10:58,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:10:58,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:10:58,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:58,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:10:58,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:10:58,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:10:59,911 INFO L124 PetriNetUnfolderBase]: 7135/10445 cut-off events. [2024-11-16 19:10:59,911 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-11-16 19:10:59,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21223 conditions, 10445 events. 7135/10445 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 59320 event pairs, 1761 based on Foata normal form. 0/10194 useless extension candidates. Maximal degree in co-relation 21213. Up to 6723 conditions per place. [2024-11-16 19:10:59,962 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 40 selfloop transitions, 3 changer transitions 70/117 dead transitions. [2024-11-16 19:10:59,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 117 transitions, 484 flow [2024-11-16 19:10:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:10:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:10:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-11-16 19:10:59,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.534375 [2024-11-16 19:10:59,968 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 8 states and 171 transitions. [2024-11-16 19:10:59,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 117 transitions, 484 flow [2024-11-16 19:10:59,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 117 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:10:59,975 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 107 flow [2024-11-16 19:10:59,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2024-11-16 19:10:59,978 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-11-16 19:10:59,978 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 107 flow [2024-11-16 19:10:59,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:10:59,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:10:59,979 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:10:59,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:10:59,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:10:59,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:10:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1040134318, now seen corresponding path program 1 times [2024-11-16 19:10:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:10:59,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379593499] [2024-11-16 19:10:59,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:10:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:10:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:00,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379593499] [2024-11-16 19:11:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379593499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:00,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:00,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:11:00,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105194017] [2024-11-16 19:11:00,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:00,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:11:00,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:00,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:11:00,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:11:00,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:11:00,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:00,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:00,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:11:00,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:02,055 INFO L124 PetriNetUnfolderBase]: 8035/11789 cut-off events. [2024-11-16 19:11:02,055 INFO L125 PetriNetUnfolderBase]: For 4909/4909 co-relation queries the response was YES. [2024-11-16 19:11:02,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27498 conditions, 11789 events. 8035/11789 cut-off events. For 4909/4909 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 68002 event pairs, 1241 based on Foata normal form. 360/12138 useless extension candidates. Maximal degree in co-relation 27483. Up to 5105 conditions per place. [2024-11-16 19:11:02,122 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 58 selfloop transitions, 5 changer transitions 81/148 dead transitions. [2024-11-16 19:11:02,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 148 transitions, 687 flow [2024-11-16 19:11:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:11:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:11:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2024-11-16 19:11:02,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-11-16 19:11:02,125 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 107 flow. Second operand 10 states and 215 transitions. [2024-11-16 19:11:02,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 148 transitions, 687 flow [2024-11-16 19:11:02,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 148 transitions, 664 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-16 19:11:02,257 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 164 flow [2024-11-16 19:11:02,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=164, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2024-11-16 19:11:02,258 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2024-11-16 19:11:02,258 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 164 flow [2024-11-16 19:11:02,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:02,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:02,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:11:02,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:11:02,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:02,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -204057672, now seen corresponding path program 1 times [2024-11-16 19:11:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124882029] [2024-11-16 19:11:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:02,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:02,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124882029] [2024-11-16 19:11:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124882029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:02,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:11:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996451606] [2024-11-16 19:11:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:02,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:11:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:11:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:11:02,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:11:02,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:02,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:02,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:11:02,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:03,283 INFO L124 PetriNetUnfolderBase]: 5377/8207 cut-off events. [2024-11-16 19:11:03,283 INFO L125 PetriNetUnfolderBase]: For 10026/10026 co-relation queries the response was YES. [2024-11-16 19:11:03,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22130 conditions, 8207 events. 5377/8207 cut-off events. For 10026/10026 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 47251 event pairs, 939 based on Foata normal form. 372/8568 useless extension candidates. Maximal degree in co-relation 22107. Up to 4537 conditions per place. [2024-11-16 19:11:03,337 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 73 selfloop transitions, 5 changer transitions 1/83 dead transitions. [2024-11-16 19:11:03,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 524 flow [2024-11-16 19:11:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:11:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:11:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-16 19:11:03,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6125 [2024-11-16 19:11:03,341 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 164 flow. Second operand 4 states and 98 transitions. [2024-11-16 19:11:03,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 524 flow [2024-11-16 19:11:03,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 494 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-11-16 19:11:03,393 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 182 flow [2024-11-16 19:11:03,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-11-16 19:11:03,396 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2024-11-16 19:11:03,396 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 182 flow [2024-11-16 19:11:03,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:03,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:03,398 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:11:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:11:03,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 842041102, now seen corresponding path program 1 times [2024-11-16 19:11:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305652056] [2024-11-16 19:11:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305652056] [2024-11-16 19:11:03,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305652056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:11:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358461956] [2024-11-16 19:11:03,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:03,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:11:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:03,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:11:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:11:03,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:11:03,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:03,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:03,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:11:03,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:04,206 INFO L124 PetriNetUnfolderBase]: 3077/4767 cut-off events. [2024-11-16 19:11:04,206 INFO L125 PetriNetUnfolderBase]: For 4917/4917 co-relation queries the response was YES. [2024-11-16 19:11:04,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13527 conditions, 4767 events. 3077/4767 cut-off events. For 4917/4917 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 24900 event pairs, 513 based on Foata normal form. 268/5024 useless extension candidates. Maximal degree in co-relation 13505. Up to 1554 conditions per place. [2024-11-16 19:11:04,233 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 87 selfloop transitions, 8 changer transitions 2/101 dead transitions. [2024-11-16 19:11:04,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 634 flow [2024-11-16 19:11:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:11:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:11:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-11-16 19:11:04,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-16 19:11:04,235 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 182 flow. Second operand 5 states and 125 transitions. [2024-11-16 19:11:04,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 634 flow [2024-11-16 19:11:04,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 624 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-16 19:11:04,243 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 222 flow [2024-11-16 19:11:04,243 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2024-11-16 19:11:04,244 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2024-11-16 19:11:04,244 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 222 flow [2024-11-16 19:11:04,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:04,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:04,245 INFO L204 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] [2024-11-16 19:11:04,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:11:04,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:04,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1519152987, now seen corresponding path program 1 times [2024-11-16 19:11:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536458014] [2024-11-16 19:11:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:04,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:04,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536458014] [2024-11-16 19:11:04,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536458014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:04,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:04,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:11:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811066952] [2024-11-16 19:11:04,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:04,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:11:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:11:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:11:04,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:11:04,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:04,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:04,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:11:04,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:05,475 INFO L124 PetriNetUnfolderBase]: 3851/5960 cut-off events. [2024-11-16 19:11:05,475 INFO L125 PetriNetUnfolderBase]: For 7979/7979 co-relation queries the response was YES. [2024-11-16 19:11:05,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18056 conditions, 5960 events. 3851/5960 cut-off events. For 7979/7979 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 31935 event pairs, 825 based on Foata normal form. 76/6032 useless extension candidates. Maximal degree in co-relation 18032. Up to 2690 conditions per place. [2024-11-16 19:11:05,510 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 96 selfloop transitions, 18 changer transitions 38/156 dead transitions. [2024-11-16 19:11:05,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 156 transitions, 1049 flow [2024-11-16 19:11:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:11:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:11:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2024-11-16 19:11:05,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2024-11-16 19:11:05,513 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 222 flow. Second operand 9 states and 193 transitions. [2024-11-16 19:11:05,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 156 transitions, 1049 flow [2024-11-16 19:11:05,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 156 transitions, 977 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-11-16 19:11:05,532 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 384 flow [2024-11-16 19:11:05,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-11-16 19:11:05,533 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2024-11-16 19:11:05,534 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 384 flow [2024-11-16 19:11:05,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:05,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:05,534 INFO L204 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] [2024-11-16 19:11:05,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:11:05,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 274121843, now seen corresponding path program 2 times [2024-11-16 19:11:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:05,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476695779] [2024-11-16 19:11:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476695779] [2024-11-16 19:11:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476695779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:05,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:11:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557514821] [2024-11-16 19:11:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:05,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:11:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:11:05,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:11:05,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:11:05,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:05,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:05,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:11:05,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:06,926 INFO L124 PetriNetUnfolderBase]: 4867/7516 cut-off events. [2024-11-16 19:11:06,927 INFO L125 PetriNetUnfolderBase]: For 14617/14617 co-relation queries the response was YES. [2024-11-16 19:11:06,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23740 conditions, 7516 events. 4867/7516 cut-off events. For 14617/14617 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 42131 event pairs, 1207 based on Foata normal form. 56/7568 useless extension candidates. Maximal degree in co-relation 23710. Up to 2980 conditions per place. [2024-11-16 19:11:06,974 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 100 selfloop transitions, 18 changer transitions 46/168 dead transitions. [2024-11-16 19:11:06,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 168 transitions, 1221 flow [2024-11-16 19:11:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:11:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:11:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-11-16 19:11:06,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-16 19:11:06,976 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 384 flow. Second operand 8 states and 190 transitions. [2024-11-16 19:11:06,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 168 transitions, 1221 flow [2024-11-16 19:11:07,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 168 transitions, 1181 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-11-16 19:11:07,018 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 393 flow [2024-11-16 19:11:07,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=393, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2024-11-16 19:11:07,020 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2024-11-16 19:11:07,020 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 393 flow [2024-11-16 19:11:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:07,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:07,021 INFO L204 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] [2024-11-16 19:11:07,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:11:07,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 249451739, now seen corresponding path program 3 times [2024-11-16 19:11:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164622295] [2024-11-16 19:11:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:07,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164622295] [2024-11-16 19:11:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164622295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:07,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:07,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:11:07,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219568466] [2024-11-16 19:11:07,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:07,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:11:07,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:11:07,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:11:07,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-11-16 19:11:07,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:07,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:07,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-11-16 19:11:07,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:07,712 INFO L124 PetriNetUnfolderBase]: 2547/3997 cut-off events. [2024-11-16 19:11:07,713 INFO L125 PetriNetUnfolderBase]: For 9756/9756 co-relation queries the response was YES. [2024-11-16 19:11:07,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12714 conditions, 3997 events. 2547/3997 cut-off events. For 9756/9756 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21014 event pairs, 469 based on Foata normal form. 156/4142 useless extension candidates. Maximal degree in co-relation 12683. Up to 1460 conditions per place. [2024-11-16 19:11:07,729 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 68 selfloop transitions, 11 changer transitions 29/112 dead transitions. [2024-11-16 19:11:07,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 985 flow [2024-11-16 19:11:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:11:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:11:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-11-16 19:11:07,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2024-11-16 19:11:07,732 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 393 flow. Second operand 6 states and 124 transitions. [2024-11-16 19:11:07,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 985 flow [2024-11-16 19:11:07,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 823 flow, removed 36 selfloop flow, removed 10 redundant places. [2024-11-16 19:11:07,745 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 268 flow [2024-11-16 19:11:07,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2024-11-16 19:11:07,747 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2024-11-16 19:11:07,747 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 268 flow [2024-11-16 19:11:07,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:07,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:07,748 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:11:07,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:11:07,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:07,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash 582490040, now seen corresponding path program 1 times [2024-11-16 19:11:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:07,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370181508] [2024-11-16 19:11:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370181508] [2024-11-16 19:11:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370181508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:08,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:11:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449837005] [2024-11-16 19:11:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:08,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:11:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:08,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:11:08,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:11:08,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:11:08,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:08,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:08,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:11:08,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:08,346 INFO L124 PetriNetUnfolderBase]: 1873/2981 cut-off events. [2024-11-16 19:11:08,347 INFO L125 PetriNetUnfolderBase]: For 5356/5356 co-relation queries the response was YES. [2024-11-16 19:11:08,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9334 conditions, 2981 events. 1873/2981 cut-off events. For 5356/5356 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14919 event pairs, 623 based on Foata normal form. 8/2984 useless extension candidates. Maximal degree in co-relation 9307. Up to 1594 conditions per place. [2024-11-16 19:11:08,360 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 39 selfloop transitions, 3 changer transitions 36/82 dead transitions. [2024-11-16 19:11:08,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 591 flow [2024-11-16 19:11:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:11:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:11:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2024-11-16 19:11:08,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-11-16 19:11:08,362 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 268 flow. Second operand 6 states and 104 transitions. [2024-11-16 19:11:08,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 591 flow [2024-11-16 19:11:08,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 470 flow, removed 26 selfloop flow, removed 10 redundant places. [2024-11-16 19:11:08,383 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 153 flow [2024-11-16 19:11:08,383 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2024-11-16 19:11:08,384 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places. [2024-11-16 19:11:08,384 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 153 flow [2024-11-16 19:11:08,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:08,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:08,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:11:08,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:11:08,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:08,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -885798276, now seen corresponding path program 2 times [2024-11-16 19:11:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682245213] [2024-11-16 19:11:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:11:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:11:08,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:11:08,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682245213] [2024-11-16 19:11:08,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682245213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:11:08,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:11:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:11:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140977148] [2024-11-16 19:11:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:11:08,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 19:11:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:11:08,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 19:11:08,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 19:11:08,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-11-16 19:11:08,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 39 transitions, 153 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:08,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:11:08,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-11-16 19:11:08,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:11:09,340 INFO L124 PetriNetUnfolderBase]: 895/1453 cut-off events. [2024-11-16 19:11:09,340 INFO L125 PetriNetUnfolderBase]: For 914/914 co-relation queries the response was YES. [2024-11-16 19:11:09,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 1453 events. 895/1453 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6247 event pairs, 170 based on Foata normal form. 8/1460 useless extension candidates. Maximal degree in co-relation 3681. Up to 571 conditions per place. [2024-11-16 19:11:09,345 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 54 selfloop transitions, 5 changer transitions 36/99 dead transitions. [2024-11-16 19:11:09,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 550 flow [2024-11-16 19:11:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:11:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:11:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-11-16 19:11:09,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3972222222222222 [2024-11-16 19:11:09,347 INFO L175 Difference]: Start difference. First operand has 65 places, 39 transitions, 153 flow. Second operand 9 states and 143 transitions. [2024-11-16 19:11:09,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 550 flow [2024-11-16 19:11:09,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 486 flow, removed 19 selfloop flow, removed 12 redundant places. [2024-11-16 19:11:09,351 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 146 flow [2024-11-16 19:11:09,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-11-16 19:11:09,351 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2024-11-16 19:11:09,352 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 146 flow [2024-11-16 19:11:09,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:11:09,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:11:09,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:11:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:11:09,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:11:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:11:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 17140258, now seen corresponding path program 3 times [2024-11-16 19:11:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:11:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199731179] [2024-11-16 19:11:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:11:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:11:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:11:09,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:11:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:11:09,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:11:09,551 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:11:09,552 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-16 19:11:09,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-16 19:11:09,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-16 19:11:09,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-16 19:11:09,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-16 19:11:09,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-16 19:11:09,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:11:09,555 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2024-11-16 19:11:09,657 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:11:09,657 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:11:09,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:11:09 BasicIcfg [2024-11-16 19:11:09,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:11:09,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:11:09,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:11:09,668 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:11:09,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:10:56" (3/4) ... [2024-11-16 19:11:09,670 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:11:09,779 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:11:09,779 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:11:09,780 INFO L158 Benchmark]: Toolchain (without parser) took 14998.83ms. Allocated memory was 174.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 117.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. [2024-11-16 19:11:09,780 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:11:09,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.60ms. Allocated memory is still 174.1MB. Free memory was 116.6MB in the beginning and 90.9MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 19:11:09,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.20ms. Allocated memory is still 174.1MB. Free memory was 90.9MB in the beginning and 88.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:11:09,781 INFO L158 Benchmark]: Boogie Preprocessor took 57.27ms. Allocated memory is still 174.1MB. Free memory was 88.4MB in the beginning and 85.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:11:09,781 INFO L158 Benchmark]: IcfgBuilder took 826.73ms. Allocated memory is still 174.1MB. Free memory was 85.1MB in the beginning and 123.6MB in the end (delta: -38.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-16 19:11:09,781 INFO L158 Benchmark]: TraceAbstraction took 13416.27ms. Allocated memory was 174.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 123.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-16 19:11:09,781 INFO L158 Benchmark]: Witness Printer took 111.49ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 19:11:09,783 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.60ms. Allocated memory is still 174.1MB. Free memory was 116.6MB in the beginning and 90.9MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.20ms. Allocated memory is still 174.1MB. Free memory was 90.9MB in the beginning and 88.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.27ms. Allocated memory is still 174.1MB. Free memory was 88.4MB in the beginning and 85.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 826.73ms. Allocated memory is still 174.1MB. Free memory was 85.1MB in the beginning and 123.6MB in the end (delta: -38.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13416.27ms. Allocated memory was 174.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 123.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 111.49ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L746] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666=-2, t667=-1, t668=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 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: 13.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 717 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 714 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1984 IncrementalHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 2 mSDtfsCounter, 1984 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=7, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2024-11-16 19:11:09,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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